Computer-aided cryptographic proofs
From MaRDI portal
Publication:2914729
DOI10.1007/978-3-642-32347-8_2zbMATH Open1360.94294OpenAlexW4211150876MaRDI QIDQ2914729FDOQ2914729
Authors: Gilles Barthe, Juan Manuel Crespo, Benjamin Grégoire, César Kunz, Santiago Zanella-Béguelin 
Publication date: 20 September 2012
Published in: Interactive Theorem Proving (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00765842/file/main.pdf
Recommendations
Cited In (21)
- Verified cryptographic code for everybody
- Formal verification of Saber's public-key encryption scheme in easycrypt
- Computer-Aided Security Proofs for the Working Cryptographer
- Automated unbounded analysis of cryptographic constructions in the generic group model
- Automated proofs for asymmetric encryption
- Another look at automated theorem-proving
- Probabilistic relational Hoare logics for computer-aided security proofs
- Automating regression verification of pointer programs by predicate abstraction
- Machine-checked security for XMSS as in RFC 8391 and SPHINCS\textsuperscript{+}
- Finding a middle ground for computer-aided cryptography
- Formal Certification of ElGamal Encryption
- Proof techniques for cryptographic processes
- Formal certification of code-based cryptographic proofs
- Another look at automated theorem-proving. II
- Towards mechanized correctness proofs for cryptographic algorithms: axiomatization of a probabilistic Hoare style logic
- Formalization of Shannon's theorems
- Programming language techniques for cryptographic proofs
- Automating Computational Proofs for Public-Key-Based Key Exchange
- Functional Correctness Proofs of Encryption Algorithms
- EasyCrypt: a tutorial
- Proof producing synthesis of arithmetic and cryptographic hardware
Uses Software
This page was built for publication: Computer-aided cryptographic proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914729)
