Computer-aided cryptographic proofs
From MaRDI portal
Publication:2914729
Recommendations
Cited in
(21)- Formal certification of code-based cryptographic proofs
- Automating Computational Proofs for Public-Key-Based Key Exchange
- Automated proofs for asymmetric encryption
- Finding a middle ground for computer-aided cryptography
- Verified cryptographic code for everybody
- Towards mechanized correctness proofs for cryptographic algorithms: axiomatization of a probabilistic Hoare style logic
- EasyCrypt: a tutorial
- Automating regression verification of pointer programs by predicate abstraction
- Formalization of Shannon's theorems
- Programming language techniques for cryptographic proofs
- Probabilistic relational Hoare logics for computer-aided security proofs
- Another look at automated theorem-proving
- Functional Correctness Proofs of Encryption Algorithms
- Formal Certification of ElGamal Encryption
- Formal verification of Saber's public-key encryption scheme in easycrypt
- Proof producing synthesis of arithmetic and cryptographic hardware
- Computer-Aided Security Proofs for the Working Cryptographer
- Automated unbounded analysis of cryptographic constructions in the generic group model
- Proof techniques for cryptographic processes
- Machine-checked security for XMSS as in RFC 8391 and SPHINCS\textsuperscript{+}
- Another look at automated theorem-proving. II
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)