Automated Security Proofs with Sequences of Games
- 1 January 2006
- book chapter
- Published by Springer Nature
- Vol. 2006, 537-554
- https://doi.org/10.1007/11818175_32
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Probabilistic Polynomial-Time Semantics for a Protocol Security LogicPublished by Springer Nature ,2005
- Computationally Sound, Automated Proofs for Security ProtocolsPublished by Springer Nature ,2005
- A Machine-Checked Formalization of the Generic Model and the Random Oracle ModelPublished by Springer Nature ,2004
- A composable cryptographic library with nested operationsPublished by Association for Computing Machinery (ACM) ,2003
- Symmetric Authentication within a Simulatable Cryptographic LibraryPublished by Springer Nature ,2003
- Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*Journal of Cryptology, 2002
- Practice-oriented provable-securityPublished by Springer Nature ,1998
- The Exact Security of Digital Signatures-How to Sign with RSA and RabinPublished by Springer Nature ,1996
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- New directions in cryptographyIEEE Transactions on Information Theory, 1976