Computationally Sound, Automated Proofs for Security Protocols
- 1 January 2005
- book chapter
- Published by Springer Nature
- Vol. 3444, 157-171
- https://doi.org/10.1007/978-3-540-31987-0_12
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An efficient cryptographic protocol verifier based on prolog rulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Computationally Sound, Automated Proofs for Security ProtocolsPublished by Springer Nature ,2005
- Symmetric encryption in automatic analyses for con .dentiality against active adversariesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- A composable cryptographic library with nested operationsPublished by Association for Computing Machinery (ACM) ,2003
- HERMES: An Automatic Tool for Verification of Secrecy in Security ProtocolsPublished by Springer Nature ,2003
- Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*Journal of Cryptology, 2002
- Taming the AdversaryPublished by Springer Nature ,2000
- Public-Key Encryption in a Multi-user Setting: Security Proofs and ImprovementsPublished by Springer Nature ,2000
- Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDRPublished by Springer Nature ,1996
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988