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 1583771 (Why is no real title available?)
- scientific article; zbMATH DE number 1739881 (Why is no real title available?)
- scientific article; zbMATH DE number 2009973 (Why is no real title available?)
- scientific article; zbMATH DE number 2080670 (Why is no real title available?)
- scientific article; zbMATH DE number 1487486 (Why is no real title available?)
- scientific article; zbMATH DE number 1759457 (Why is no real title available?)
- Logics for reasoning about cryptographic constructions
- New directions in cryptography
- Proof-assistants using dependent type systems
- Symmetric authentication within a simulatable cryptographic library
- The Exact Security of ECIES in the Generic Group Model
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)