Machine-checked security proofs of cryptographic signature schemes
From MaRDI portal
Recommendations
Cites work
- A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
- Automated Reasoning
- Complexity of a determinate algorithm for the discrete logarithm
- Generic groups, collision resistance, and ECDSA
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 2080670 (Why is no real title available?)
- Logics for reasoning about cryptographic constructions
- New directions in cryptography
- Open issues in formal methods for cryptographic protocol analysis
- Probabilistic polynomial-time equivalence and security analysis
- Proof-assistants using dependent type systems
- Reconciling two views of cryptography (the computational soundness of formal encryption)
- Security of signed ElGamal encryption
- Symmetric authentication within a simulatable cryptographic library
- The exact security of ECIES in the generic group model
- Why provable security matters?
Cited in
(3)
This page was built for publication: Machine-checked security proofs of cryptographic signature schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862663)