Universally composable notions of key exchange and secure channels

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

Volumn 2332, Issue , 2002, Pages 337-351

  Canetti, Ran ^a   Krawczyk, Hugo ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Composition of protocols; Cryptographic protocols; Key exchange; Proofs of security

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPOSITION OF PROTOCOL; CRYPTOGRAPHIC PROTOCOLS; KEY EXCHANGE; KEY EXCHANGE PROTOCOLS; KEY-EXCHANGE PROTOCOL; PROOFS OF SECURITY; UNIVERSALLY COMPOSABLE; UNIVERSALLY COMPOSABLE SECURITY;

CRYPTOGRAPHY;

EID: 84947232363     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_22     Document Type: Conference Paper

References (24)

1. D. Beaver, “Secure Multi-party Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority”, J. Cryptology (1991) 4: 75–122.
2. M. Bellare, R. Canetti and H. Krawczyk, “A modular approach to the design and analysis of authentication and key-exchange protocols”, 30th STOC, 1998.
3. M. Bellare and P. Rogaway, “Entity authentication and key distribution”, Advances in Cryptology, – CRYPTO’93, Lecture Notes in Computer Science Vol. 773, D. Stinson ed, Springer-Verlag, 1994, pp. 232–249.
4. M. Bellare and P. Rogaway, “Provably secure session key distribution – the three party case,” Annual Symposium on the Theory of Computing (STOC), 1995.
5. R. Bird, I. Gopal, A. Herzberg, P. Janson, S. Kutten, R. Molva and M. Yung, “Systematic design of two-party authentication protocols,” IEEE Journal on Selected Areas in Communications (special issue on Secure Communications), 11(5):679–693, June 1993. (Preliminary version: Crypto’91.)
6. S. Blake-Wilson, D. Johnson and A. Menezes, “Key exchange protocols and their security analysis,” Proceedings of the sixth IMA International Conference on Cryptography and Coding, 1997.
7. R. Canetti, “Security and Composition of Multiparty Cryptographic Protocols”, Journal of Cryptology, Winter 2000. On-line version at http://philby.ucsd.edu/cryptolib/1998/98-18.html.
8. R. Canetti, “Universally Composable Security: A New paradigm for Cryptographic Protocols”, 42nd FOCS, 2001. Full version available at http://eprint.iacr.org/2000/067.
9. R. Canetti and H. Krawczyk, “Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels”, Eurocrypt 01, 2001. Full version at http://eprint.iacr.org/2001.
10. R. Canetti and H. Krawczyk, “Universally Composable Notions of Key Exchange and Secure Channels”, IACR’s Eprint archive, http://eprint.iacr.org/2002.
11. R. Canetti and T. Rabin, “Universal Composition with Join State”, available on the Eprint archive, eprint.iacr.org/2002, 2002.
12. W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Trans. Info. Theory IT-22, November 1976, pp. 644–654.
13. W. Diffie, P. van Oorschot and M. Wiener, “Authentication and authenticated key exchanges”, Designs, Codes and Cryptography, 2, 1992, pp. 107–125.
14. Y. Dodis and S. Micali, “Secure Computation”, CRYPTO ’00, 2000.
15. U. Feige and A. Shamir. Witness Indistinguishability and Witness Hiding Protocols. In 22nd STOC, pages 416–426, 1990.
16. O. Goldreich, “Foundations of Cryptography”, Cambridge University Press, 2001. Prelim. version available at http://philby.ucsd.edu/cryptolib.html
17. S. Goldwasser, and L. Levin, “Fair Computation of General Functions in Presence of Immoral Majority”, CRYPTO ’90, LNCS 537, Springer-Verlag, 1990.
18. S. Goldwasser and S. Micali, Probabilistic encryption, JCSS, Vol. 28, No 2, April 1984, pp. 270–299.
19. S. Goldwasser, S. Micali and C. Rackoff, “The Knowledge Complexity of Interactive Proof Systems”, SIAM Journal on Comput., Vol. 18, No. 1, 1989, pp. 186–208.
20. S. Goldwasser, S. Micali, and R.L. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput., April 1988, pages 281–308.
21. A. Menezes, P. Van Oorschot and S. Vanstone, “Handbook of Applied Cryptography,” CRC Press, 1996.
22. S. Micali and P. Rogaway, “Secure Computation”, unpublished manuscript, 1992. Preliminary version in CRYPTO 91.
23. B. Pfitzmann, M. Schunter and M. Waidner, “Provably Secure Certified Mail”,IBM Research Report RZ 3207 (#93253), IBM Research, Zurich, August 2000.
24. V. Shoup, “On Formal Models for Secure Key Exchange” Theory of Cryptography Library, 1999. Available at: http://philby.ucsd.edu/cryptolib/1999/99-12.html.