Efficient ID-based Group Key Agreement with Bilinear Maps

  • Kyu Young Choi
  • Jung Yeon Hwang
  • Dong Hoon Lee
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2947)

Abstract

In modern collaborative and distributed applications, authenticated group key agreement (GKA) is one of important issues. Recently identity (ID)-based authenticated GKA has been increasingly researched because of the simplicity of a public key management. In this paper, we present a formal treatment on ID-based authenticated GKA, which extends the standard GKA model. We present two GKA protocols which use a bilinear-based cryptography: one is a bilinear variant of Burmester and Desmedt protocol [13] and the other is ID-based authenticated protocol based on the former protocol. Our protocols are scalable and 2-round protocols with forward secrecy. In particular, the ID-based authenticated GKA protocol provides a batch verification technique, which verifies the validity of transcripts from other group players simultaneously and improves computational efficiency. We then prove their securities under the decisional bilinear DH and computational DH assumptions.

References

  1. 1.
    Al-Riyami, S., Paterson, K.G.: Tripartite Authenticated Key Agreement Protocols from Pairings. Cryptology ePrint Archive, Report 2002/035 (2002), http://eprint.iacr.org/
  2. 2.
    Barua, R., Dutta, R., Sarker, P.: Extending Joux’s Protocol to Multi Party Key Agreement. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol. 2904, pp. 205–217. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Bellare, M., Garay, J.A., Rabin, T.: Fast Batch Verification for modular Exponentiation and Digital Signatures. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 236–250. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  4. 4.
    Bellare, M., Pointcheaval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 139–155. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 232–249. Springer, Heidelberg (1994)Google Scholar
  6. 6.
    Bellare, M., Rogaway, P.: Provably-Secure Session Key Distribution: The Three Party Case. In: Proc. of STOC 1995, pp. 57–66 (1995)Google Scholar
  7. 7.
    Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Boyd, C., Nieto, J.M.G.: Round-Optimal Contributory Conference Key Agreement. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 161–174. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Boyd, C., Pavlovski, C.: Attacking and Repairing Batch Verification Schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 58–71. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Bresson, E., Chevassut, O., Pointcheval, D.: Provably Authenticated Group Diffie- Hellman Key Exchange-The Dynamic Case. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 290–309. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Bresson, E., Chevassut, O., Pointcheval, D.: Dynamic Group Diffie-Hellman Key Exchange under Standard Assumption (Full version). In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 321–336. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.-J.: Provably Authenticated Group Diffie-Hellman Key Exchange. In: Proc. of 8th ACM CCCS, pp. 255–264 (2001)Google Scholar
  13. 13.
    Burmester, M., Desmedt, Y.: A Secure and Efficient Conference Key Distribution System. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 267–275. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  14. 14.
    Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Joux, A.: One round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385–394. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  16. 16.
    Katz, J., Yung, M.: Scalable Protocols for Authenticated Group Key Exchange. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 110–125. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  17. 17.
    Katz, J., Yung, M.: Scalable Protocols for Authenticated Group Key Exchange (full version)Google Scholar
  18. 18.
    Nalla, D., Reddy, K.C.: Identity Based Authenticated Group Key Agreement Protocol. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 215–233. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  19. 19.
    Nalla, D., Reddy, K.C.: ID-based tripartite Authenticated Key Agreement Protocols from pairings. Cryptology ePrint Archive, Report 2003/004, http://eprint.iacr.org/2003/004/
  20. 20.
    Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. J. of Cryptology 13, 361–396 (2000)MATHCrossRefGoogle Scholar
  21. 21.
    Shoup, V.: On formal models for secure key exchange. In: ACM Security (1999)Google Scholar
  22. 22.
    Smart, N.P.: An Identity based authenticated Key Agreement protocol based on the Weil pairing. Cryptology ePrint Archive, Report 2001/111 (2001), http://eprint.iacr.org/
  23. 23.
    Steiner, M., Tsudik, G., Waidner, M.: Key Agreement in Dynamic Peer Groups. IEEE Trans. on Parallel and Distributed Systems 11(8), 769–780 (2000)CrossRefGoogle Scholar
  24. 24.
    Zhang, F., Liu, S., Kim, K.: ID-based One Round Authenticated Tripartite Key Agreement Protocols with Pairings. Cryptology ePrint Archive (2002), http://eprint.iacr.org/

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Kyu Young Choi
    • 1
  • Jung Yeon Hwang
    • 1
  • Dong Hoon Lee
    • 1
  1. 1.Center for Information Security Technologies (CIST)Korea UniversitySeoulKorea

Personalised recommendations