Binsec/Rel: Efficient Relational Symbolic Execution for Constant-Time at Binary-Level
Authors:
- 1 May 2020
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1021-1038
Abstract
The constant-time programming discipline (CT) is an efficient countermeasure against timing side-channel attacks, requiring the control flow and the memory accesses to be independent from the secrets. Yet, writing CT code is challenging as it demands to reason about pairs of execution traces (2-hypersafety property) and it is generally not preserved by the compiler, requiring binary-level analysis. Unfortunately, current verification tools for CT either reason at higher level (C or LLVM), or sacrifice bug-finding or bounded-verification, or do not scale. We tackle the problem of designing an efficient binary-level verification tool for CT providing both bug-finding and bounded-verification. The technique builds on relational symbolic execution enhanced with new optimizations dedicated to information flow and binary-level analysis, yielding a dramatic improvement over prior work based on symbolic execution. We implement a prototype, BINSEC/REL, and perform extensive experiments on a set of 338 cryptographic implementations, demonstrating the benefits of our approach in both bug-finding and bounded-verification. Using BINSEC/REL, we also automate a previous manual study of CT preservation by compilers. Interestingly, we discovered that gcc -O0 and backend passes of clang introduce violations of CT in implementations that were previously deemed secure by a state-of-the-art CT verification tool operating at LLVM level, showing the importance of reasoning at binary-level.Keywords
All Related Versions
This publication has 60 references indexed in Scilit:
- Symbolic execution for software testingCommunications of the ACM, 2013
- SAGECommunications of the ACM, 2012
- The S2E PlatformACM Transactions on Computer Systems, 2012
- The BINCOA Framework for Binary Code Analysis2011
- Relational Verification Using Product Programs2011
- WYSINWYXACM Transactions on Programming Languages and Systems, 2010
- Cache Attacks and Countermeasures: The Case of AES2006
- Remote timing attacks are practicalComputer Networks, 2005
- Secure Information Flow as a Safety Problem2005
- Symbolic execution and program testingCommunications of the ACM, 1976