Initiator-resilient universally composable key exchange

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

Volumn 2808, Issue , 2003, Pages 61-84

  Hofheinz, Dennis ^a   Müller Quade, Jörn ^a   Steinwandt, Rainer ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Cryptographic protocols; Formal cryptography; Key exchange; Universal composition

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ADAPTIVE ADVERSARY; CONDITION; CRYPTOGRAPHIC PROTOCOLS; FORMAL CRYPTOGRAPHY; KEY EXCHANGE PROTOCOLS; KEY-EXCHANGE; UNIVERSAL COMPOSABILITY; UNIVERSAL COMPOSITION; UNIVERSALLY COMPOSABLE;

CRYPTOGRAPHY;

EID: 0142188056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39650-5_4     Document Type: Conference Paper

References (22)

1. William Aiello, Steven M. Bellovin, Matt Blaze, Ran Canetti, John Ioannidis, Angelos D. Keromytis, and Omer Reingold. Efficient, DoS-Resistant, Secure Key Exchange for Internet Protocols. In Proceedings of the 9th ACM Conference on Computer and Communications Security, pages 48–58. ACM Press, 2002.
2. Michael Backes, Birgit Pfitzmann, and Michael Waidner. A Universally Composable Cryptographic Library. Cryptology ePrint Archive, Report 2003/015, January 2003. http://eprint.iacr.org/2003/015/.
3. Mihir Bellare, Ran Canetti, and Hugo Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pages 419–428. ACM Press, 1998. Full version at http://eprint.iacr.org/1998/009.
4. Mihir Bellare and Phillip Rogaway. Provably Secure Session Key Distribution: the Three Party Case. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, pages 57–66. ACM Press, 1995.
5. Dan Boneh. The Decision Diffie-Hellman Problem. In Joe P. Buhler, editor, Proceedings of the Third Algorithmic Number Theory Symposium, volume 1423 of Lecture Notes in Computer Science, pages 48–63. Springer, 1998.
6. Ran Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proceedings of 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, pages 136–145. IEEE Computer Society, 2001. Full version at http://eprint.iacr.org/2000/067.
7. Ran Canetti and Marc Fischlin. Universally Composable Commitments. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Proceedings, volume 2139 of Lecture Notes in Computer Science, pages 19–40. Springer, 2001. Full version at http://eprint.iacr.org/2001/055.
8. Ran Canetti and Hugo Krawczyk. Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels. In Birgit Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, International Conference on the Theory and Application of Cryptographic Techniques, Proceedings, volume 2045 of Lecture Notes in Computer Science. Springer, 2001. Full version at http://eprint.iacr.org/2002/047.
9. Ran Canetti and Hugo Krawczyk. Universally Composable Notions of Key Exchange and Secure Channels. In Lars R. Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, volume 2332 of Lecture Notes in Computer Science. Springer, 2002. All citations refer to the full version at http://eprint.iacr.org/2002/059.
10. Ran Canetti, Eyal Kushilevitz, and Yehuda Lindell. On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. In Proceedings of EUROCRYPT 2003, Lecture Notes in Computer Science. Springer, 2003. To appear.
11. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally Composable Two-Party and Multi-party Secure Computation. In Proceedings on Thirty-Fourth Annual ACM Symposium on Theory of Computing, STOC 2002, pages 494–503. ACM Press, 2002.
12. Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, and Amit Sahai. Universally Composable Two-Party and Multi-party Secure Computation, July 2003.Full (and revised) version of [11], available at http://eprint.iacr.org/2002/140.
13. Ivan B. Damgård. Presentation of [14] at CRYPTO 2002, 2002.
14. Ivan B. Damgård and Jesper B. Nielsen. Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Proceedings, volume 2442 of Lecture Notes in Computer Science, pages 581–596. Springer, 2002. Full version at http://eprint.iacr.org/2001/091.
15. Danny Dolev and Andrew C. Yao. On the Security of Public Key Protocols. IEEE Transactions on Information Theory, 29(2):198–208, March 1983.
16. Shafi Goldwasser and Silvio Micali. Probabilistic Encryption. Journal of Computer and System Science, 28, 1984.
17. Dennis Hofheinz, Jörn Müller-Quade, and Rainer Steinwandt. On Modeling INDCCA Security in Cryptographic Protocols. Cryptology ePrint Archive, Report 2003/024, February 2003. http://eprint.iacr.org/2003/024.
18. Internet Key Exchange (IKEv2) Protocol. Charlie Kaufman, editor. IPSEC Working Group INTERNET-DRAFT draft-ietf-ipsec-ikev2-06.txt, March 2003. Available at http://www.ietf.org/internet-drafts/draft-ietf-ipsec-ikev2-06.txt.
19. Michael Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. Princeton University Press, 1996.
20. Birgit Pfitzmann and Michael Waidner. A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In IEEE Symposium on Research in Security and Privacy, pages 184–200. IEEE Computer Society Press, 2001. Full version at http://eprint.iacr.org/2000/066.
21. Victor Shoup. On Formal Models for Secure Key Exchange. Cryptology ePrint Archive, Report 1999/012, 1999. http://eprint.iacr.org/1999/012.
22. Michael Steiner. Secure Group Key Agreement. PhD thesis, Universität des Saarlandes, 2002.Online available at http://www.semper.org/sirene/publ/Stei 02.thesis-final.pdf.