Automating Computational Proofs for Public-Key-Based Key Exchange
From MaRDI portal
Publication:4933211
Recommendations
- Automated proofs for asymmetric encryption
- Automated proofs for asymmetric encryption
- Programming Languages and Systems
- 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
- scientific article; zbMATH DE number 1618043 (Why is no real title available?)
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1024060 (Why is no real title available?)
- scientific article; zbMATH DE number 2086716 (Why is no real title available?)
- Authenticated key exchange secure against dictionary attacks
- Automated proofs for asymmetric encryption
- Automated security proof for symmetric encryption modes
- Errors in Computational Complexity Proofs for Protocols
- Modular Security Proofs for Key Agreement Protocols
- On the security of public key protocols
- Programming Languages and Systems
- Security in Communication Networks
- Theory of Cryptography
- Theory of Cryptography
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)