Automated security proofs with sequences of games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4117 LNCS, Issue , 2006, Pages 537-554

  Blanchet, Bruno ^a   Pointcheval, David ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SECURITY OF DATA; SEMANTICS; THEOREM PROVING;

ASYMMETRIC CRYPTOGRAPHY; COMPUTATIONAL MODELS; SECURITY ANALYSES;

GAME THEORY;

EID: 33749579704     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_32     Document Type: Conference Paper

References (39)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2): 103-127, 2002.
2. M. Backes and P. Laud. A mechanized, cryptographically sound type inference checker. In Workshop on Formal and Computational Cryptography (FCC'06), July 2006. To appear.
3. M. Backes and B. Pfitzmann. Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In CSFW'04- IEEE, June 2004.
4. M. Backes and B. Pfitzmann. Relating symbolic and cryptographic secrecy. In 26th IEEE Symposium on Security and Privacy, pages 171-182. IEEE, May 2005.
5. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations. In CCS'03, pages 220-230. ACM, Oct. 2003.
6. M. Backes, B. Pfitzmann, and M. Waidner. Symmetric authentication within a simulatable cryptographic library. In ESORICS'03, LNCS 2808, pages 271-290. Springer, Oct. 2003.
7. G. Barthe, J. Cederquist, and S. Tarento. A machine-checked formalization of the generic model and the random oracle model. In IJCAR'04, LNCS 3097, pages 385-399. Springer, July 2004.
8. M. Bellare. Practice-Oriented Provable Security. In ISW'97, LNCS 1396. Springer, 1997.
9. M. Bellare and P. Rogaway. Random Oracles Are Practical: a Paradigm for Designing Efficient Protocols. In CCS'93, pages 62-73. ACM Press, 1993.
10. M. Bellare and P. Rogaway. The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In Eurocrypt '96, LNCS 1070, pages 399-416. Springer, 1996.
11. M. Bellare and P. Rogaway. The Game-Playing Technique and its Application to Triple Encryption, 2004. Cryptology ePrint Archive 2004/331.
12. B. Blanchet. Automatic proof of strong secrecy for security protocols. In IEEE Symposium on Security and Privacy, pages 86-100, May 2004.
13. B. Blanchet. A computationally sound mechanized prover for security protocols. Cryptology ePrint Archive, Report 2005/401, Nov. 2005. Available at http://eprint.iacr.org/2005/401.
14. B. Blanchet. A computationally sound mechanized prover for security protocols. In IEEE Symposium on Security and Privacy, pages 140-154, May 2006.
15. B. Blanchet and D. Pointcheval. Automated security proofs with sequences of games. Cryptology ePrint Archive, Report 2006/069, Feb. 2006. Available at http://eprint.iacr.org/2006/069.
16. R. Canetti. Universally composable security: A new paradigm for cryptographic protocols. In FOCS'01, pages 136-145. IEEE, Oct. 2001. An updated version is available at Cryptology ePrint Archive, http://eprint.iacr.org/2000/ 067.
17. R. Canetti and J. Herzog. Universally composable symbolic analysis of cryptographic protocols (the case of encryption-based mutual authentication and key exchange). Cryptology ePrint Archive, Report 2004/334, 2004. Available at http://eprint.iacr.org/2004/334.
18. V. Cortier and B. Warinschi. Computationally sound, automated proofs for security protocols. In ESOP'05, LNCS 3444, pages 157-171. Springer, Apr. 2005.
19. A. Datta, A. Derek, J. C. Mitchell, V. Shmatikov, and M. Turuani. Probabilistic polynomial-time semantics for a protocol security logic. In ICALP'05, LNCS 3580, pages 16-29. Springer, July 2005.
20. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, November 1976.
21. D. Dolev and A. C. Yao. On the Security of Public-Key Protocols. IEEE Transactions on Information Theory, 29(2):198-208, 1983.
22. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28:270-299, 1984.
23. S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptative Chosen-Message Attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
24. S. Halevi. A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive, Report 2005/181, June 2005. Available at http://eprint.iacr.org/2005/181.
25. R. Janvier, Y. Lakhnech, and L. Mazaré. Completing the picture: Soundness of formal encryption in the presence of active adversaries. In ESOP'05, LNCS 3444, pages 172-185. Springer, Apr. 2005.
26. P. Laud. Handling encryption in an analysis for secure information flow. In ESOP'03, LNCS 2618, pages 159-173. Springer, Apr. 2003.
27. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In IEEE Symposium on Security and Privacy, pages 71-85, May 2004.
28. P. Laud. Secrecy types for a simulatable cryptographic library. In CCS'05, pages 26-35. ACM, Nov. 2005.
29. P. D. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. A probabilistic poly-time framework for protocol analysis. In CCS'98, pages 112-121, Nov. 1998.
30. P. D. Lincoln, J. C. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security protocols. In FM'99, LNCS 1708, pages 776-793. Springer, Sept. 1999.
31. P. Mateus, J. Mitchell, and A. Scedrov. Composition of cryptographic protocols in a probabilistic polynomial-time process calculus. In CONCUR 2003, LNCS 2761, pages 327-349. Springer, Sept. 2003.
32. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In TCC'04, LNCS 2951, pages 133-151. Springer, Feb. 2004.
33. J. C. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for the analysis of cryptographic protocols. Theoretical Computer Science, 353(1-3):118-164, Mar. 2006.
34. M. Naor and M. Yung. Universal One-Way Hash Functions and Their Cryptographic Applications. In STOC'89, pages 33-43. ACM Press, 1989.
35. C. Rackoff and D. R. Simon. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Crypto '91, LNCS 576, pages 433-444. Springer, 1992.
36. A. Ramanathan, J. Mitchell, A. Scedrov, and V. Teague. Probabilistic bisimulation and equivalence for security analysis of network protocols. In FOSSACS'04, LNCS 2987, pages 468-483. Springer, Mar. 2004.
37. V. Shoup. Sequences of games: a tool for taming complexity in security proofs, 2004. Cryptology ePrint Archive 2004/332.
38. C. Sprenger, M. Backes, D. Basin, B. Pfitzmann, and M. Waidner. Cryptographically sound theorem proving. In CSFW'06. IEEE, July 2006. To appear.
39. S. Tarento. Machine-checked security proofs of cryptographic signature schemes. In ESORICS'05, LNCS 3679, pages 140-158. Springer, Sept. 2005.