Formal certification of elgamal encryption a gentle introduction to certicrypt

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

Volumn 5491 LNCS, Issue , 2009, Pages 1-19

  Barthe, Gilles ^a   Gŕegoire, Benjamin ^b,c   Heraud, Sylvain ^c   Béguelin, Santiago Zanella ^b,c  

^a IMDEA SOFTWARE INSTITUTE   (Spain)

^b Parc Orsay Université   (France)

^c INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC SYSTEMS; DIGITAL SIGNATURE SCHEMES; ELGAMAL ENCRYPTION; EXACT SECURITY; FORMAL CERTIFICATION; ILLUSTRATIVE EXAMPLES; PADDING SCHEME; RANDOM ORACLE MODEL; SEMANTIC SECURITY; THIRD PARTIES;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; FIRE FIGHTING EQUIPMENT; NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 67650675340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01465-9_1     Document Type: Conference Paper

References (14)

1. Barthe, G., Gŕegoire, B., Zanella B́eguelin, S.: Formal certification of code-based cryptographic proofs. In: Proceedings of the 36th ACM Symposium on Principles of Programming Languages. ACM Press, New York (2009)
2. Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270-299 (1984)
3. Stern, J.: Why provable security matters? In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.2656. Springer, Heidelberg (2003)
4. Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.4004, pp. 409-426. Springer, Heidelberg (2006) (Pubitemid 44072253)
5. Halevi, S.: A plausible approach to computer-aided cryptographic proofs. Cryptology ePrint Archive, Report 2005/181 (2005)
6. Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332 (2004)
7. The Coq development team: The Coq Proof Assistant Reference Manual v8.2 (2008), http://coq.inria.fr
8. Sabelfeld, A., Sands, D.: A per model of secure information flow in sequential programs. Higher-Order and Symbolic Computation 14(1), 59-91 (2001) (Pubitemid 32366274)
9. Audebaud, P., Paulin-Mohring, C.: Proofs of randomized algorithms in Coq. Science of Computer Programming (2008)
10. Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Proceedings of the 31th ACM Symposium on Principles of Programming Languages, pp. 14-25. ACM Press, New York (2004)
11. Jonsson, B., Larsen, K.G., Yi, W.: Probabilistic extensions of process algebras. In: Handbook of Process Algebra, pp. 685-711. Elsevier, Amsterdam (2001)
12. Nowak, D.: A framework for game-based security proofs. In: Qing, S., Imai, H., Wang, G. (eds.) ICICS 2007. LNCS, vol.4861, pp. 319-333. Springer, Heidelberg (2007)
13. Barthe, G., Cederquist, J., Tarento, S.: A machine-checked formalization of the generic model and the random oracle model. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS, vol.3097, pp. 385-399. Springer, Heidelberg (2004) (Pubitemid 38939987)
14. 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) (Pubitemid 44113252)