A computational analysis of the Needham-Schröeder-(Lowe) protocol

Proceedings of the Computer Security Foundations Workshop

Volumn 2003-January, Issue , 2003, Pages 248-262

  Warinschi, B ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Authentication; Computational modeling; Computer science; Context modeling; Cryptographic protocols; Drives; Engineering profession; History; Public key cryptography; Security

Indexed keywords

AUTHENTICATION; COMPUTATION THEORY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; DRIVES; HISTORY; PROFESSIONAL ASPECTS; PUBLIC KEY CRYPTOGRAPHY; SECURITY OF DATA; SECURITY SYSTEMS;

COMPUTATIONAL MODEL; CONTEXT MODELING; CRYPTOGRAPHIC PROTOCOLS; ENGINEERING PROFESSION; SECURITY;

CRYPTOGRAPHY;

EID: 84942255620     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2003.1212717     Document Type: Conference Paper

References (21)

1. M. Abadi and P. Rogaway. Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology, 15(2):103-127, 2002.
2. J. H. An, Y. Dodis, and T. Rabin. On the security of joint signature and encryption. In Theory and Application of Cryptographic Techniques, pages 83-107, 2002.
3. M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In Proc. of EUROCRYPT'00, LNCS, 2000.
4. M. Bellare and P. Rogaway. Introduction to modern cryptography-Lecutre notes. Available at: http://www.cs.ucsd.edu/users/mihir/cse207/classnotes.html.
5. M. Bellare and P. Rogaway. Entity authentication and key distribution. In Proceedings of CRYPTO'93, volume 773 of Lecture Notes in Computer Science, 1994.
6. M. Bellare and P. Rogaway. Provably secure session key distribution: the three party case. In Proc. of 27th Anual Symposium on the Theory of Computing. ACM, 1995.
7. D. Dolev and A. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, 29(2):198-208, March 1983.
8. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithm. IEEE Transactions on Information Theory, 31:469-472, 1985.
9. F. J. T. Fabrega, J. Hertzog, and J. Guttman. Strand spaces: Proving security protocols correct. Journal of Computer Security, 7(2/3):191-230, 1999.
10. O. Goldreich. Foundations of Cryptography. 2001.
11. S. Goldwasser and S. Micali. Probabilistic encryption. J. of Computer and System Sciences, 28:270-299, April 1984.
12. J. Guttman, F. J. T. Fabrega, and L. Zuck. The faithfulness of abstract protocol analysis: Message authentication. In Proceedings of the 8th ACM Conference on Computer and Communications Security, pages 186-195, 2001.
13. G. Lowe. An attack on the Needham-Schroeder public key authentication protocol. Information processing letters, 56(3):131-136, November 1995.
14. G. Lowe. Breaking and fixing the Needham-Schröeder algorithm. In Proc. of TACAS'96, pages 147-166. Springer-Verlag, 1996.
15. F. S. E. Ltd. Failures divergence refinement - user manual and tutorial, 1993. Version 1.3.
16. C. Meadows. The NRL protocol analyzer: An overview. Journal of Logic Programming, 26(2):113-131, 1996.
17. R. Needham and M. Schroeder. Using encryption for authentication in large networks of computers. Communications of ACM, December 1978.
18. B. Pfitzmann and M. Waidner. A model for asynchronous reactive sysmtes and its applications to secure message transmission. In Proceedings of the 22nd IEEE Symposium on Security and Privacy, pages 184-200, 2001.
19. C. Rackoff and D. Simon. Noninteractive zero-knowledge proofs of knowledfe and chosen ciphertext attack. In Advances in Cryptology- CRYPTO'91, pages 433-444, 1991.
20. V. Shoup. A proposal for an ISO standard for public key encryption (version 2.1). Manuscript, Dec. 20, 2001.
21. D. Song. An automatic checker for security protocol analysis. In Proceedings of the 12th IEEE Computer Security Foundations Workshop, June 1999.