Tripartite key exchange in the canetti-krawczyk proof model

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

Volumn 3348, Issue , 2004, Pages 17-32

  Hitchcock, Yvonne ^a   Boyd, Colin ^a   Nieto, Juan Manuel Gonzalez ^a  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION MECHANISMS; KEY AGREEMENT PROTOCOL; KEY-EXCHANGE; PROPERTY; PROTOCOL CANS; PROVABLY SECURE; SECURE PROTOCOLS; KEY EXCHANGE;

NETWORK SECURITY; CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 34548783058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30556-9_3     Document Type: Article

References (20)

1. Sattam S. Al-Riyami and Kenneth G. Paterson. Tripartite authenticated key agreement protocols from pairings. In Cryptography and Coding, volume 2898 of Lecture Notes in Computer Science, pages 332-359. Springer-Verlag, 2003.
2. Paulo S. L. M. Barreto, Hae Y. Kirn, Ben Lynn, and Michael Scott. Efficient algorithms for pairing-based cryptosystems. In Advances in CryptologyCRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 354-368. Springer-Verlag, 2002.
3. Mihir Bellare, Ran Canetti, and Hugo Krawczyk. A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract). In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC '98), pages 419-428, New York, May 1998. ACM Press. [Pull paper online] http://www-cse.ucsd. edu/users/mihir/papers/nodular.ps.gz.
4. Mihir Bellare, Anand Desai, David Pointcheval, and Phil Rogaway. Relations among notions of security for public-key encryption schemes (extended abstract). In Advances in Cryptology-CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 26-45. Springer-Verlag, 1998. [Pull paper online] http://www-cse.ucsd.edu/users/mihir/papers/relations.pdf.
5. Dan Boneh and Matthew Franklin. Identity-based encryption from the Weil pairing. In Advances in Cryptology-CRYPTO 2001, volume 2139 of Lecture Notes in Computer Science, pages 213-229. Springer-Verlag, 2001. [Full paper online] http://crypto.Stanford.edu/"dabo/abstracts/ibe.html.
6. Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the Weil pairing. In Advances in Cryptology-ASIACRYPT 2001, volume 2139 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, 2001. [Full paper online] http://crypto.stanford.edu/~dabo/abstracts/weilsigs.html.
7. Colin Boyd and Anish Mathuria. Protocols for Authentication and Key Establishment. Springer-Verlag, Berlin, 2003.
8. E. Bresson, O. Chevassut, D. Pointcheval, and J.-J. Quisquater. Provably authenticated group Diffie-Hellman key exchange. In P. Samarati, editor, Proc. of ACM-CCS 01, pages 255-264, Philadelphia, Pennsylvania, USA, November 2001. ACM, ACM Press.
9. Ran Canetti and Hugo Krawczyk. Analysis of key-exchange protocols and their use for building secure channels. In Advances in Cryptology-EUROCRYPT 2001, volume 2045 of Lecture Notes in Computer Science, pages 451-472. Springer-Verlag, 2001. [Full paper online] http://eprint.iacr.org/2001/040.ps. gz.
10. Jae Choon Cha and Jung Hee Cheon. An identity-based signature from gap DiffieHellman groups. In Practice and Theory in Public Key Cryptography-PKC 2003, volume 2567 of Lecture Notes in Computer Science, pages 18-30. Springer-Verlag, 2003.
11. Jung Hee Cheon and Dong Hoon Lee. Diffie-Hellman problems and bilinear maps. Cryptology ePrint Archive, Report 2002/117, 2002. [Online] http://eprint.iacr.org/ [accessed 11/07/2003].
12. Florian Hess. Efficient identity based signature schemes based on pairings. In Selected Areas in Cryptography-SAC 2002, volume 2595 of Lecture Notes in Computer Science, pages 310-324. Springer-Verlag, 2002.
13. Antoine Joux. A one round protocol for tripartite Diffie-Hellman. In Algorithmic Number Theory: Fourth International Symposium-ANTS-IV 2000, Proceedings, volume 1838 of Lecture Notes in Computer Science, pages 385-393. SpringerVerlag, 2000.
14. Benoit Libert and Jean-Jacques Quisquater. New identity based signcryption schemes from pairings. Cryptology ePrint Archive, Report 2003/023, 2003. [Online] http://eprint.iacr.org/ [accessed 11/07/2003].
15. Ben Lynn. Authenticated identity-based encryption. Cryptology ePrint Archive, Report 2002/072, 2002. [Online] http://eprint.iacr.org/ [accessed 11/07/2003].
16. John Malone-Lee. Identity-based signcryption. Cryptology ePrint Archive, Report 2002/098, 2002. [Online] http://eprint.iacr.org/ [accessed 11/07/2003].
17. Alfred J. Mcnczes, Paul G. van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
18. Divya Nalla and K.C. Reddy. Signcryption scheme for identity-based cryptosystems. Cryptology ePrint Archive, Report 2003/066, 2003. [Online] http://eprint.iacr.org/ [accessed 11/07/2003].
19. K.G. Paterson. Cryptography from pairings: a snapshot of current research. Information Security Technical Report, 7(3):41-54, 2002.
20. Yiu Shing Terry Tin, Colin Boyd, and Juan Manuel Gonzalez Nieto. Provably secure mobile key exchange: Applying the Canetti-Krawczyk approach. In Information Security and Privacy-ACISP 2003, volume 2727 of Lecture Notes in Computer Science, pages 166-179. Springer-Verlag, 2003.