Title
Symbolic Methods in Computational Cryptography Proofs
Abstract
Code-based game-playing is a popular methodology for proving security of cryptographic constructions and side-channel countermeasures. This methodology relies on treating cryptographic proofs as an instance of relational program verification (between probabilistic programs), and decomposing the latter into a series of elementary relational program verification steps. In this paper, we develop principled methods for proving such elementary steps for probabilistic programs that operate over finite fields and related algebraic structures. We focus on three essential properties: program equivalence, information flow, and uniformity. We give characterizations of these properties based on deducibility and other notions from symbolic cryptography. We use (sometimes improve) tools from symbolic cryptography to obtain decision procedures or sound proof methods for program equivalence, information flow, and uniformity. Finally, we evaluate our approach using examples drawn from provable security and from side-channel analysis - for the latter, we focus on the masking countermeasure against differential power analysis. A partial implementation of our approach is integrated in EasyCrypt, a proof assistant for provable security, and in MaskVerif, a fully automated prover for masked implementations.
Year
DOI
Venue
2019
10.1109/CSF.2019.00017
2019 IEEE 32nd Computer Security Foundations Symposium (CSF)
Keywords
Field
DocType
computer aided cryptography,formal methods and verification,decidability and complexity
Power analysis,Cryptography,Computer science,Theoretical computer science,Equivalence (measure theory),Mathematical proof,Probabilistic logic,Gas meter prover,Proof assistant,Provable security
Conference
ISSN
ISBN
Citations 
1940-1434
978-1-7281-1408-8
1
PageRank 
References 
Authors
0.37
17
5
Name
Order
Citations
PageRank
Gilles Barthe12337152.36
Benjamin Grégoire281748.93
Charlie Jacomme362.49
Steve Kremer4465.30
Pierre-Yves Strub554029.87