An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem

ABSTRACT

In this paper, we present a new ID-based two-party authenticated key exchange (AKE) protocol, which makes use of a new technique called twin Diffie-Hellman problem proposed by Cash, Kiltz and Shoup. We show that our scheme is secure under bilinear Diffie-Hellman (BDH) assumption in the enhanced Canetti-Krawczyk (eCK) model, which better supports the adversary's queries than previous AKE models. To the best of our knowledge, our scheme is the first ID-based AKE protocol provably secure in eCK model.

REFERENCES

• 1: M. Bellare, D. Pointcheval, and P. Rogaway. Authenticated key exchange secure against dictionary attacks. In EUROCRYPT, pages 139--155, 2000.
• 2: Mihir Bellare , Phillip Rogaway, Entity authentication and key distribution, Proceedings of the 13th annual international cryptology conference on Advances in cryptology, p.232-249, January 1994, Santa Barbara, California, United States
• 3: Mihir Bellare , Phillip Rogaway, Provably secure session key distribution: the three party case, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.57-66, May 29-June 01, 1995, Las Vegas, Nevada, United States [doi>10.1145/225058.225084]
• 4: Dan Boneh , Matthew K. Franklin, Identity-Based Encryption from the Weil Pairing, Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, p.213-229, August 19-23, 2001
• 5: Colin Boyd , Yvonne Cliff , Juan Gonzalez Nieto , Kenneth G. Paterson, Efficient One-Round Key Exchange in the Standard Model, Proceedings of the 13th Australasian conference on Information Security and Privacy, p.69-83, July 07-09, 2008, Wollongong, Australia [doi>10.1007/978-3-540-70500-0_6]
• 6: Ran Canetti , Hugo Krawczyk, Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels, Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, p.453-474, May 06-10, 2001
• 7: D. Cash, E. Kiltz, and V. Shoup. The twin diffie-hellman problem and applications. In N. P. Smart, editor, EUROCRYPT, volume 4965 of Lecture Notes in Computer Science, pages 127--145. Springer, 2008.
• 8: L. Chen , Z. Cheng , N. P. Smart, Identity-based key agreement protocols from pairings, International Journal of Information Security, v.6 n.4, p.213-241, June 2007 [doi>10.1007/s10207-006-0011-9]
• 9: L. Chen and C. Kudia. Identity based authenticated key agreement from pairings. In IEEE Computer Security Foundations Workshop, The modified version of this paper is available at Cryptology ePrint Archive, Report 2002/184, pages 219--233, 2003.
• 10: K.-K. R. Choo, C. Boyd, and Y. Hitchcock. Examining indistinguishability-based proof models for key establishment protocols. In B. K. Roy, editor, ASIACRYPT, volume 3788 of Lecture Notes in Computer Science, pages 585--604. Springer, 2005.
• 11: K.-K. R. Choo, C. Boyd, and Y. Hitchcock. On session key construction in provably-secure key establishment protocols. In E. Dawson and S. Vaudenay, editors, Mycrypt, volume 3715 of Lecture Notes in Computer Science, pages 116--131. Springer, 2005.
• 12: S. S. M. Chow and K.-K. R. Choo. Strongly-secure identity-based key agreement and anonymous extension. In J. A. Garay, A. K. Lenstra, M. Mambo, and R. Peralta, editors, ISC, volume 4779 of Lecture Notes in Computer Science, pages 203--220. Springer, 2007.
• 13: H. Krawczyk. Hmqv: A high-performance secure diffie-hellman protocol. In V. Shoup, editor, CRYPTO, volume 3621 of Lecture Notes in Computer Science, pages 546--566. Springer, 2005.
• 14: C. Kudla and K. G. Paterson. Modular security proofs for key agreement protocols. In B. K. Roy, editor, ASIACRYPT, volume 3788 of Lecture Notes in Computer Science, pages 549--565. Springer, 2005.
• 15: B. A. LaMacchia, K. Lauter, and A. Mityagin. Stronger security of authenticated key exchange. In W. Susilo, J. K. Liu, and Y. Mu, editors, ProvSec, volume 4784 of Lecture Notes in Computer Science, pages 1--16. Springer, 2007.
• 16: N. McCullagh and P. S. L. M. Barreto. A new two-party identity-based authenticated key agreement. In A. Menezes, editor, CT-RSA, volume 3376 of Lecture Notes in Computer Science, pages 262--274. Springer, 2005.
• 17: Tatsuaki Okamoto , David Pointcheval, The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes, Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography, p.104-118, February 13-15, 2001
• 18: N. Smart. An identity based authenticated key agreement protocol based on the weil pairing. Electronics Letters, 38:630--632, 2002.
• 19: Y. Wang. Efficient identity-based and authenticated key agreement protocol, cryptology eprint archive, report 2005/108, 2005.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.0 General
          Subjects: Security and protection (e.g., firewalls)

General Terms:
Security

Keywords:
BDH problem, ID-based, authenticated key exchange, twin Diffie-Hellman