Formal proof of provable security by game-playing in a proof assistant

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

Volumn 4784 LNCS, Issue , 2007, Pages 151-168

  Affeldt, Reynald ^a   Tanaka, Miki ^b   Marti, Nicolas ^c  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b NATIONAL INSTITUTE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY   (Japan)

^c UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; GAME THEORY; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SYNTACTICS;

GAME TRANSFORMATIONS; INTRACTABLE PROBLEMS; PROVABLE SECURITY; SECURITY PROOFS;

NETWORK SECURITY;

EID: 38149007757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75670-5_10     Document Type: Conference Paper

References (16)

1. The LogiCal Project, INRIA. The Coq proof assistant: http://coq.inria.fr
2. Thompson, S.: Type Theory and Functional Programming. Addison-Wesley, Reading (1991)
3. Winskel, G.: The Formal Semantics of Programming Languages. MIT Press, Cambridge (1993)
4. Bellare, M., Rogaway, P.: Random Oracle are Practical: A Paradigm for Designing Efficient Protocols. In: CCS 1993. 1st ACM Conference on Computer and Communications Security, pp. 62-73. ACM Press, New York
5. Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399-416. Springer, Heidelberg (1996)
6. Shoup, V.: Sequence of Games: A Tool for Taming Complexity in Security Proofs. Manuscript (2004) (Revised 2006), available at http://www.shoup.net/ papers/games.pdf
7. Bellare, M., Rogaway, P.: Code-Based Game-Playing Proofs and the Security of Triple Encryption. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409-426. Springer, Heidelberg (2006)
8. Pointcheval, D.: Provable Security for Public Key Schemes. In: Contemporary Cryptology, Advanced Courses in Mathematics CRM Barcelona, pp. 133-189. Birkhäuser Publishers (2005)
9. Halevi, S.: A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive: Report (2005)/181
10. Tarento, S.: Machine-Checked Security Proofs of Cryptographic Signature Schemes. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 140-158. Springer, Heidelberg (2005)
11. Marti, N., Affeldt, R., Yonezawa, A.: Formal Verification of the Heap Manager of an Operating System using Separation Logic. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 400-419. Springer, Heidelberg (2006)
12. Corin, R., den Hartog, J.: A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 252-263. Springer, Heidelberg (2006)
13. Blanchet, B., Pointcheval, D.: Automated Security Proofs with Sequences of Games. In: CRYPTO 2006. LNCS, vol. 4117, pp. 537-554. Springer (2006) Extended version: Cryptology ePrint Archive: Report (2006)/069
14. Affeldt, R., Marti, N.: An Approach to Formal Verification of Arithmetic Functions in Assembly. In: 11th Annual Asian Computing Science Conference (ASIAN 2006), Focusing on Secure Software and Related Issues, Lecture Notes in Computer Science. Springer (to appear, 2007)
15. Nowak, D.: A Framework for Game-Based Security Proofs. Cryptology ePrint Archive: Report (2007)/199
16. Affeldt, R., Tanaka, M., Marti, N.: Formal Proof of Provable Security by Gameplaying in a Proof Assistant. Coq scripts, available at http://staff.aist. go.jp/reynald.affeldt/secprf/provsec2007