International audienceCode-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 ...
150 pagesModern software systems today have increasingly complex security requirements – such as sup...
Verifying cryptographic security proofs manually is inherently tedious and error-prone. The game-pla...
We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approa...
International audienceCode-based game-playing is a popular methodology for proving security of crypt...
The game-based approach is a popular methodology for structuring cryptographic proofs as sequences o...
Abstract. This paper presents the first automatic technique for proving not only protocols but also ...
The game-based approach to security proofs in cryptography is a widely-used methodology for writing ...
Computer-aided cryptography improves the rigor of security proofs by mechanizing their verification....
Abstract. The game-based approach to security proofs in cryptography is a widely-used methodology fo...
International audienceAfter a short introduction to the field of security protocol verification, we ...
Abstract. After a short introduction to the field of security protocol verification, we present the ...
We develop a compositional method for proving cryptographically sound security properties of key exc...
We present a new mechanized prover for secrecy properties of cryptographic protocols. In contrast to...
International audienceCerticrypt is a general framework to certify the security of cryptographic pri...
In cryptography, secure Multi-Party Computation (MPC) protocols allow participants to compute a func...
150 pagesModern software systems today have increasingly complex security requirements – such as sup...
Verifying cryptographic security proofs manually is inherently tedious and error-prone. The game-pla...
We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approa...
International audienceCode-based game-playing is a popular methodology for proving security of crypt...
The game-based approach is a popular methodology for structuring cryptographic proofs as sequences o...
Abstract. This paper presents the first automatic technique for proving not only protocols but also ...
The game-based approach to security proofs in cryptography is a widely-used methodology for writing ...
Computer-aided cryptography improves the rigor of security proofs by mechanizing their verification....
Abstract. The game-based approach to security proofs in cryptography is a widely-used methodology fo...
International audienceAfter a short introduction to the field of security protocol verification, we ...
Abstract. After a short introduction to the field of security protocol verification, we present the ...
We develop a compositional method for proving cryptographically sound security properties of key exc...
We present a new mechanized prover for secrecy properties of cryptographic protocols. In contrast to...
International audienceCerticrypt is a general framework to certify the security of cryptographic pri...
In cryptography, secure Multi-Party Computation (MPC) protocols allow participants to compute a func...
150 pagesModern software systems today have increasingly complex security requirements – such as sup...
Verifying cryptographic security proofs manually is inherently tedious and error-prone. The game-pla...
We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approa...