• Publications
  • Influence
Computer-Aided Security Proofs for the Working Cryptographer
TLDR
It is argued that EasyCrypt is a plausible candidate for adoption by working cryptographers and its application to security proofs of the Cramer-Shoup and Hashed ElGamal cryptosystems is illustrated.
A Machine-Checked Formalization of Sigma-Protocols
TLDR
A first machine-checked formalization of a comprehensive theory of Σ-protocols is presented, which includes basic definitions, relations between different security properties that appear in the literature, and general composability theorems.
Formal Certification of ElGamal Encryption A Gentle Introduction to CertiCrypt
TLDR
This article focuses on a simple but illustrative example, namely the semantic security of the Hashed ElGamal encryption scheme in both, the standard and the random oracle model.
Formal Certification of ElGamal Encryption
TLDR
This article focuses on a simple but illustrative example, namely the semantic security of the Hashed ElGamal encryption scheme in both, the standard and the random oracle model.
Verified Indifferentiable Hashing into Elliptic Curves
TLDR
This work presents a machine-checked proof of the first generic construction for hashing into ordinary elliptic curves indifferentiable from a random oracle, based on an extension of the CertiCrypt framework with logics and mechanized tools for reasoning about approximate forms of observational equivalence, and integrates mathematical libraries of group theory and elliptic curve.
Verified indifferentiable hashing into elliptic curves
TLDR
This work presents a machine-checked proof of the first generic construction for hashing into ordinary elliptic curves indifferentiable from a random oracle, based on an extension of the CertiCrypt framework with logics and mechanized tools for reasoning about approximate forms of observational equivalence, and integrates mathematical libraries of group theory and elliptic curve.
A Formalization of Polytime Functions
We present a deep embedding of Bellantoni and Cook's syntactic characterization of polytime functions. We prove formally that it is correct and complete with respect to the original characterization
Implementing a Direct Method for Certificate Translation
TLDR
This paper reports on the development of a certificate translator prototype, which takes as input a high-level program, defined in a small subset of the C programming language, and a logical specification a la ACSL, and computes a set of verification conditions for the Coq proof assistant.
Towards automating code-based game-based cryptographic proofs
TLDR
The long-term goal of this work is to increase the automation of CertiCrypt, to the point that the user can submit a proof sketch of a code-based game-based cryptographic proof, consisting of a sequence of games, and relational invariants, and that Certi Crypt can automatically complete the proof sketch.