Computationally sound, automated proofs for security protocols

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 157-171

  Cortier, Véronique ^a   Warinschi, Bogdan ^b  

^a LORIA   (France)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY;

ASYMMETRIC ENCRYPTION; AUTOMATED PROOFS; POLYNOMIAL-TIME ATTACKS; SECURITY PROTOCOLS;

SECURITY OF DATA;

EID: 24644437051     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_12     Document Type: Conference Paper

References (22)

1. M. Abadi. Taming the adversary. In Proc. of Crypto'00, 2000.
2. M. Abadi and A. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proc. of the 4th Conf. on Computer and Communications Security, pages 36-47. ACM Press, 1997.
3. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2): 103-127, 2002.
4. M. Backes. Personal communication.
5. M. Backes, B. Pfitzmann, and M. Waidner. A composable cryptographic library with nested operations (extended abstract). In Proc. of 10th ACM Conference on Computer and Communications Security (CCS'05), pages 220 - 230, 2003.
6. M. Bellare, A. Boldyreva, and S. Micali. Public-key encryption in a multi-user setting: Security proofs and improvements. In Proc. of Eurocrypt'00, volume 1807 of LNCS, pages 259-274, 2000.
7. B. Blanchet. An efficient cryptographic protocol verifier based on prolog rules. In Proc. of the 14th CSFW, June 2001.
8. L. Bozga, Y. Lakhnech, and M. Perin. An automatic tool for the verification of secrecy in security protocols. In 15th Int. Conference on Computer Aided Verification (CAV 2003), volume 2725 of LNCS, pages 219-222. Springer, July 2003.
9. Y. Chevalier and L. Vigneron. A tool for lazy verification of security protocols. In Proc. of the 16th Conf. on Automated Software Engineering (ASE-2001). IEEE CS Press, 2001.
10. V. Cortier. A guide for Securify. RNTL EVA project, Report n. 13, December 2003.
11. V. Cortier and B. Warinschi. Computationally sound, automated proofs for security protocols. Research Report RR-5341, INRIA, October 2004.
12. D.H.Phan and D. Pointcheval. Une comparaison entre deux méthodes de preuve de sécurité. In Proc. of RIVF, pages 105-110, 2003. In French.
13. S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing, 17(2):281-308, April 1988.
14. P. Laud. Symmetric encryption in automatic analyses for confidentiality against active adversaries. In Proc. of 2004 IEEE Symposium on Security and Privacy, pages 71-85, 2004.
15. G. Lowe. Breaking and fixing the Needham-Schroeder public-key protocol using FDR. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), volume 1055 of LNCS, pages 147-166. Springer-Verlag, March 1996.
16. G. Lowe. Casper: A compiler for the analysis of security protocols. In Proc. of 10th CSFW'97. IEEE Computer Society Press, 1997.
17. D. Micciancio and B. Warinschi. Soundness of formal encryption in the presence of active adversaries. In Theory of Cryptography Conference (TCC 2004), pages 133-151, Cambridge, MA, USA, February 2004. Springer-Verlag.
18. J. Mitchell, A. Ramanathan, A. Scedrov, and V. Teague. A probabilistic polynomial-time calculus for analysis of cryptographic protocols. Electronic Notes in Theoretical Computer Science, 45, 2001.
19. L. Paulson. Mechanized proofs for a recursive authentication protocol. In Proc. of the 10th CSFW'97, pages 84-95. IEEE Computer Society Press, 1997.
20. C. Rackoff and D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In CRYPTO'91, pages 433-444, 1992.
21. M. Rusinowitch and M. Turuani. Protocol insecurity with finite number of sessions is NP-complete. In Proc. of the 14th CSFW'01, pages 174-190. IEEE Computer Society Press, 2001.
22. S. Yamaguchi, K. Okayama, and H. Miyahara. The design and implementation of an authentication system for the wide area distributed environment. IEICE Transactions on Information and Systems, November 1991.