Automating Computational Proofs for Public-Key-Based Key Exchange
From MaRDI portal
Publication:4933211
DOI10.1007/978-3-642-16280-0_4zbMATH Open1286.94080OpenAlexW1591893114MaRDI QIDQ4933211FDOQ4933211
Authors:
Publication date: 12 October 2010
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://eprints.qut.edu.au/38763/13/c38763.pdf
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
- Modular Security Proofs for Key Agreement Protocols
- Authenticated key exchange secure against dictionary attacks
- Automated security proof for symmetric encryption modes
- Automated proofs for asymmetric encryption
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the security of public key protocols
- Errors in Computational Complexity Proofs for Protocols
- Security in Communication Networks
- Theory of Cryptography
- Title not available (Why is that?)
- Programming Languages and Systems
- 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)
