Automating Computational Proofs for Public-Key-Based Key Exchange
From MaRDI portal
Recommendations
- Automated proofs for asymmetric encryption
- Automated proofs for asymmetric encryption
- Computationally sound, automated proofs for security protocols
- scientific article; zbMATH DE number 2086169
- Automated verification of equivalence properties of cryptographic protocols
- Automated verification of equivalence properties of cryptographic protocols
- Computer-aided cryptographic proofs
Cites work
- Authenticated key exchange secure against dictionary attacks
- Automated proofs for asymmetric encryption
- Automated security proof for symmetric encryption modes
- Computationally sound, automated proofs for security protocols
- Entity authentication and key distribution
- Errors in Computational Complexity Proofs for Protocols
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- Modular Security Proofs for Key Agreement Protocols
- On the security of public key protocols
- Security in Communication Networks
- The gap-problems: A new class of problems for the security of cryptographic schemes
- Theory of Cryptography
- Theory of Cryptography
- Universally composable notions of key exchange and secure channels. Extended Abstract
This page was built for publication: Automating Computational Proofs for Public-Key-Based Key Exchange
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933211)