Machine-checked security proofs of cryptographic signature schemes

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

Volumn 3679 LNCS, Issue , 2005, Pages 140-158

  Tarento, Sabrina ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; KNOWLEDGE ACQUISITION; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RANDOM PROCESSES; SECURITY OF DATA;

CRYPTOGRAPHIC PROTOCOLS; ELGAMAL CRYPTOSYSTEM; RANDOM ORACLE MODEL;

CRYPTOGRAPHY;

EID: 33646027052     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11555827_9     Document Type: Conference Paper

References (24)

1. M. Abadi and R. M. Needham. Prudent engineering practice for cryptographic protocols. Transactions on Software Engineering, 22(1):6-15, January 1996.
2. Martin Abadi and Phillip Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). In IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Sendai, Japan, 2000. Springer-Verlag, Berlin Germany.
3. M. Backes, B. Pfitzmann, and M. Waidner. A universally composable cryptographic library, 2003.
4. H. Barendregt and H. Geuvers. Proof assistants using dependent type systems. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume II, chapter 18, pages 1149-1238. Elsevier Publishing, 2001.
5. G. Barthe, J. Cederquist, and S. Tarento. A Machine-Checked Formalization of the Generic Model and the Random Oracle Model. In D. Basin and M. Rusinowitch, editors, Proceedings of IJCAR'04, volume 3097 of Lecture Notes in Computer Science, pages 385-399, 2004.
6. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In Proceedings of the 1st ACM Conference on Computer and Communications Security, pages 62-73. ACM Press, November 1993.
7. D. Brown. Generic Groups, Collision Resistance, and ECDSA, 2002. Available from http://eprint.iacr.org/2002/026/.
8. Coq Development Team. The Coq Proof Assistant User's Guide. Version 8.0, January 2004.
9. Whitfield Diffe and Martin E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22(6):644-654, 1976.
10. A. Fiat and A. Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Proc. CRYPTO'86, volume 286 of Lecture Notes in Computer Science, pages 186-194. Springer-Verlag, 1986.
11. formalization of probability. http://www-sop.inria.fr/everest/personnel/ Sabrina.Tarento/usefuLfiles.html.
12. R. Impagliazzo and B. Kapron. Logics for reasoning about cryptographic constructions, 2003.
13. S. Lang. Algebra. Addison Wesley, 1983.
14. P. Lincoln, J. Mitchell, M. Mitchell, and A. Scedrov. Probabilistic polynomial-time equivalence and security analysis. In J. M. Wing, J. Woodcock, and J. Davies, editors, Proceedings of FM'99 - Volume I, volume 1708 of Lecture Notes in Computer Science, pages 776-793. Springer-Verlag, 1999.
15. C. Meadows. Open issues in formal methods for cryptographic protocol analysis. In V.I. Gorodetski, V.A. Skormin, and L.J. Popyack, editors, Proceedings of MMMACNS, volume 2052 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
16. J. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report). In S. Brookes and M. Mislove, editors, 17-th Annual Conference on the Mathematical Foundations of Programming Semantics, number 45, Aarhus, Denmark, 2001.
17. John C. Mitchell, Mark Mitchell, and Andre Scedrov. A linguistic characterization of bounded oracle computation and probabilistic polynomial time. In IEEE Symposium on Foundations of Computer Science, pages 725-733, 1998.
18. V. I. Nechaev. Complexity of a determinate algorithm for the discrete logarithm. Mathematical Notes, 55(2):165-172, 1994.
19. B. Pfitzmann and M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proceedings of SOSP'01, pages 184-201. IEEE Press, 2001.
20. C.-P. Schnorr. Security of Blind Discrete Log Signatures against Interactive Attacks. In S. Qing, T. Okamoto, and J. Zhou, editors, Proceedings of ICICS'01, volume 2229 of Lecture Notes in Computer Science, pages 1-12. Springer-Verlag, 2001.
21. C.-P. Schnorr and M. Jakobsson. Security of Signed ElGamal Encryption. In T. Okamoto, editor, Proceedings of ASIACRYPT'00, volume 1976 of Lecture Notes in Computer Science, pages 73-89. Springer-Verlag, 2000.
22. V. Shoup. Lower bounds for discrete logarithms and related problems. In W. Fumy, editor, Proceedings of EUROCRYPT'97, volume 1233 of Lecture Notes in Computer Science, pages 256-266. Springer-Verlag, 1997.
23. N. Smart. The Exact Security of ECIES in the Generic Group Model. In B. Honary, editor, Cryptography and Coding, pages 73-84. Springer-Verlag, 2001.
24. J. Stern. Why provable security matters? In E. Biham, editor, Proceedings of EUROCRYPT'03, volume 2656 of Lecture Notes in Computer Science, pages 449-461. Springer-Verlag, 2003.