A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 252-263
- https://doi.org/10.1007/11787006_22
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Probabilistic Hoare-style Logic for Game-Based Cryptographic ProofsPublished by Springer Nature ,2006
- Proofs of Randomized Algorithms in CoqPublished by Springer Nature ,2006
- A computationally sound mechanized prover for security protocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Boneh-Franklin Identity Based Encryption RevisitedPublished by Springer Nature ,2005
- Machine-Checked Security Proofs of Cryptographic Signature SchemesPublished by Springer Nature ,2005
- Probabilistic Bisimulation and Equivalence for Security Analysis of Network ProtocolsPublished by Springer Nature ,2004
- VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGICInternational Journal of Foundations of Computer Science, 2002
- Identity-Based Encryption from the Weil PairingPublished by Springer Nature ,2001
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- An axiomatic basis for computer programmingCommunications of the ACM, 1969