Formally certifying the security of digital signature schemes

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2009, Pages 237-250

  Béguelin, Santiago Zanella ^a   Grégoire, Benjamin ^a   Barthe, Gilles ^b   Olmedo, Federico ^b  

^a Parc Orsay Université   (France)

^b IMDEA SOFTWARE INSTITUTE   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL MODEL; COQ PROOF ASSISTANT; CRYPTOGRAPHIC SYSTEMS; DIGITAL SIGNATURE SCHEMES; EXACT SECURITY; HASH SIGNATURE; MESSAGE ATTACK; OPTIMAL REDUCTIONS; TWO MACHINES; UNFORGEABILITY;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK SECURITY;

COMPUTER CRIME;

EID: 70449646572     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2009.17     Document Type: Conference Paper

References (20)

1. S. Goldwasser and S. Micali, "Probabilistic encryption." J. Comput. Syst. Sci., vol.28, no.2, pp. 270-299, 1984.
2. J. Stern, "Why provable security matters?" in Advances in Cryptology - EUROCRYPT'03, ser. Lecture Notes in Computer Science, vol.2656. Springer-Verlag, 2003, pp. 449-461.
3. M. Bellare and P. Rogaway, "The security of triple encryption and a framework for code-based game-playing proofs," in Advances in Cryptology - EUROCRYPT'06, ser. Lecture Notes in Computer Science, vol.4004. Springer-Verlag, 2006, pp. 409-426.
4. D. Catalano, R. Cramer, I. Damgard, G. D. Crescenzo, D. Pointcheval, and T. Takagi, Contemporary Cryptology (Advanced Courses in Mathematics - CRM Barcelona). Birkhauser, 2005.
5. V. Shoup, "Sequences of games: a tool for taming complexity in security proofs," Cryptology ePrint Archive, Report 2004/332, 2004.
6. S. Halevi, "A plausible approach to computer-aided cryptographic proofs," Cryptology ePrint Archive, Report 2005/181, 2005.
7. B. Blanchet, "A computationally sound mechanized prover for security protocols," in IEEE Symposium on Security and Privacy. IEEE Computer Society, 2006, pp. 140-154.
8. B. Blanchet and D. Pointcheval, "Automated security proofs with sequences of games," in Advances in Cryptology - CRYPTO'06, ser. Lecture Notes in Computer Science, vol.4117. Springer-Verlag, 2006, pp. 537-554.
9. J.-S. Coron, "On the exact security of Full Domain Hash," in Advances in Cryptology, ser. Lecture Notes in Computer Science, vol.1880. Springer-Verlag, 2000, pp. 229-235.
10. G. Barthe, B. Grégoire, and S. Zanella Béguelin, "Formal certification of code-based cryptographic proofs," in Proceedings of the 36th ACM Symposium on Principles of Programming Languages. ACM Press, 2009, pp. 90-101.
11. G. Barthe, B. Grégoire, S. Heraud, and S. Zanella Béguelin, "Formal certification of ElGamal encryption. A gentle introduction to CertiCrypt," in 5th International Workshop on Formal Aspects in Security and Trust, FAST 2008, ser. Lecture Notes in Computer Science. Springer-Verlag, 2008, in press.
12. The Coq development team, "The Coq Proof Assistant Reference Manual v8.2," 2008, [Online]. Available: http://coq.inria.fr.
13. X. Leroy, "Formal certification of a compiler back-end, or: programming a compiler with a proof assistant," in Proceedings of the 33rd ACM Symposium Principles of Programming Languages. ACM Press, 2006, pp. 42-54.
14. M. Bellare and P. Rogaway, "The exact security of digital signatures - How to sign with RSA and Rabin," in Advances in Cryptology - EUROCRYPT'96, ser. Lecture Notes in Computer Science, vol.1070. Springer-Verlag, 1996, pp. 399-416.
15. -, "Random oracles are practical: A paradigm for designing efficient protocols," in Proceedings of the 1st ACM Conference on Computer and Communications Security. ACM Press, 1993, pp. 62-73.
16. J.-S. Coron, "Optimal security proofs for PSS and other signature schemes," in Advances in Cryptology - EUROCRYPT'02, ser. Lecture Notes in Computer Science, vol.2332. Springer-Verlag, 2002, pp. 272-287.
17. J. Courant, M. Daubignard, C. Ene, P. Lafourcade, and Y. Lakhnech, "Towards automated proofs for asymmetric encryption schemes in the random oracle model," in Proceedings of the 15th ACM Conference on Computer and Communications Security. ACM Press, 2008, pp. 371-380.
18. D. Nowak, "A framework for game-based security proofs," in Information and Communications Security, vol.4861. Springer-Verlag, 2007, pp. 319-333.
19. R. Affeldt, M. Tanaka, and N. Marti, "Formal proof of provable security by game-playing in a proof assistant," in Proceedings of International Conference on Provable Security, ser. Lecture Notes in Computer Science, vol.4784. Springer-Verlag, 2007, pp. 151-168.
20. M. Backes, M. Berg, and D. Unruh, "A formal language for cryptographic pseudocode," in Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'08). Springer-Verlag, 2008, pp. 353-376.