The constant time property is considered the security standard for cryptographic code. Code following the constant time discipline is free from secret-dependent branches and memory accesses, and thus avoids leaking secrets through cache and timing side channels. Though security against side channel attacks is an important concern for secure cryptographic implementations, the constant time property makes a number of implicit assumptions that are fundamentally at odds with the reality of cryptographic code. We propose a notion of robust constant time parameterized by a notion of attacker model that better captures the realities of software security for cryptographic code.
Sat 21 JanDisplayed time zone: Eastern Time (US & Canada) change
Sat 21 Jan
Displayed time zone: Eastern Time (US & Canada) change
11:00 - 12:30 | |||
11:00 25mTalk | Automated Learning and Verification of Embedded Security Architectures PriSC Matteo Busi University Ca' Foscari, Venice, Riccardo Focardi University Ca' Foscari, Venice, Flaminia L. Luccio University Ca' Foscari, Venice File Attached | ||
11:25 25mTalk | pi_RA: A pi-calculus for verifying protocols that use remote attestation PriSC File Attached | ||
11:50 25mTalk | Robust Constant-Time Cryptography PriSC Matthew Kolosick University of California at San Diego, Basavesh Ammanaghatta Shivakumar Max Planck Institute for Security and Privacy (MPI-SP), Sunjay Cauligi University of California at San Diego, USA, Marco Patrignani University of Trento, Marco Vassena Utrecht University, Ranjit Jhala University of California at San Diego, Deian Stefan University of California at San Diego Pre-print | ||
12:15 15mTalk | Short Talk: Generalising secure compilation criteria PriSC Emiel Lanckriet KU Leuven |