EasyCrypt

Computer-aided security proofs for the working cryptographer. 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 sequence of games and hints. Proof sketches are checked automatically using off-the-shelf SMT solvers and automated theorem provers, and then compiled into verifiable proofs in the CertiCrypt framework. The tool supports most common reasoning patterns and is significantly easier to use than its predecessors. We argue that EasyCrypt is a plausible candidate for adoption by working cryptographers and illustrate its application to security proofs of the Cramer-Shoup and Hashed ElGamal cryptosystems.


References in zbMATH (referenced in 20 articles )

Showing results 1 to 20 of 20.
Sorted by year (citations)

  1. Dal Lago, Ugo; Grellois, Charles: Probabilistic termination by monadic affine sized typing (2017)
  2. Barthe, Gilles; Gaboardi, Marco; Arias, Emilio Jesús Gallego; Hsu, Justin; Roth, Aaron; Strub, Pierre-Yves: Computer-aided verification for mechanism design (2016)
  3. Gagné, Martin; Lafourcade, Pascal; Lakhnech, Yassine; Safavi-Naini, Reihaneh: Automated proofs of block cipher modes of operation (2016)
  4. Lochbihler, Andreas: Probabilistic functions and cryptographic oracles in higher order logic (2016)
  5. Meadows, Catherine: Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later (2015)
  6. Nowak, David; Zhang, Yu: Formal security proofs with minimal fuss: implicit computational complexity at work (2015)
  7. Rand, Robert; Zdancewic, Steve: VPHL: a verified partial-correctness logic for probabilistic programs (2015)
  8. Barthe, Gilles; Dupressoir, François; Grégoire, Benjamin; Kunz, César; Schmidt, Benedikt; Strub, Pierre-Yves: EasyCrypt: a tutorial (2014)
  9. Barthe, Gilles; Fournet, Cédric; Grégoire, Benjamin; Strub, Pierre-Yves; Swamy, Nikhil; Zanella-Béguelin, Santiago: Probabilistic relational verification for cryptographic implementations (2014)
  10. Blanchet, Bruno: Automatic verification of security protocols in the symbolic model: the verifier proverif (2014)
  11. Barthe, Gilles; Crespo, Juan Manuel; Kunz, César: Beyond 2-safety: asymmetric product programs for relational program verification (2013)
  12. Barthe, Gilles; Olmedo, Federico: Beyond differential privacy: composition theorems and relational logic for $f$-divergences between probabilistic programs (2013)
  13. Comon-Lundh, Hubert; Cortier, Véronique; Scerri, Guillaume: Tractable inference systems: an extension with a deducibility predicate (2013)
  14. Barthe, Gilles; Crespo, Juan Manuel; Grégoire, Benjamin; Kunz, César; Zanella Béguelin, Santiago: Computer-aided cryptographic proofs (2012)
  15. Barthe, Gilles; Grégoire, Benjamin; Heraud, Sylvain; Olmedo, Federico; Zanella Béguelin, Santiago: Verified indifferentiable hashing into elliptic curves (2012)
  16. Barthe, Gilles; Grégoire, Benjamin; Kunz, César; Lakhnech, Yassine; Zanella Béguelin, Santiago: Automation in computer-aided cryptography: proofs, attacks and designs (2012)
  17. Barthe, Gilles; Grégoire, Benjamin; Zanella Béguelin, Santiago: Probabilistic relational Hoare logics for computer-aided security proofs (2012)
  18. Blanchet, Bruno: Security protocol verification: symbolic and computational models (2012)
  19. Barthe, Gilles; Grégoire, Benjamin; Heraud, Sylvain; Béguelin, Santiago Zanella: Computer-aided security proofs for the working cryptographer (2011)
  20. Koblitz, Neal: Another look at automated theorem-proving. II (2011)