We present EasyCrypt, an automated tool for elaborating security proofs of cryptographic
systems from proof sketches–compact, formal representations of the essence of a proof as a …

As cryptographic proofs have become essentially unverifiable, cryptographers have argued
in favor of develo** techniques that help tame the complexity of their proofs. Game-based …

Since the 1980s, two approaches have been developed for analyzing security protocols.
One of the approaches relies on a computational model that considers issues of complexity …

This document presents the security protocol verifier CryptoVerif. CryptoVerif does not rely
on the symbolic, Dolev-Yao model, but on the computational model. It can verify secrecy …

We present a computational analysis of basic Kerberos and Kerberos with public-key
authentication (PKINIT) in which we consider authentication and key secrecy properties. Our …

Governments and international standards bodies have established certification procedures
for security-critical technologies, such as cryptographic algorithms. Such standards have not …

We present a computational analysis of basic Kerberos with and without its public-key
extension PKINIT in which we consider authentication and key secrecy properties. Our …

We present a mechanized proof of the password-based protocol One-Encryption Key
Exchange (OEKE) using the computationally-sound protocol prover Crypto Verif. OEKE is a …

Verifying cryptographic security proofs manually is inherently tedious and error-prone. The
game-playing technique for cryptographic proofs advocates a modular proof design where …

The game-based approach is a popular methodology for structuring cryptographic proofs as
sequences of games. Game-based proofs can be rigorously formalized by taking a code …