Abstract
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challenges is to design secure and efficient group key management. While centralized management is often appropriate for key distribution in large multicast-style groups, many collaborative group settings require distributed key agreement. The communication and computation cost is one of important factors in the group key management for Dynamic Peer Group. In this paper, we extend TGDH (Tree-based Group Diffie-Hellman) protocol to improve the computational efficiency by utilizing pairing-based cryptography. The resulting protocol reduces computational cost of TGDH protocol without degrading the communication complexity.
Chapter PDF
Similar content being viewed by others
References
Al-Riyami, S., Paterson, K.: Authenticated three party key agreement protocols from pairings. Cryptology ePrint Archive, Report 2002/035, Available at http://eprint.iacr.org/2002/035/
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), http://www.crypto.stanford.edu/dabo/abstracts/ibe.html
Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient Algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, p. 354. Springer, Heidelberg (2002), Available at http://eprint.iacr.org/2002/008/
Wallner, D.M., Harder, E.J., Agee, R.C.: Key management for multicast: Issues and architectures. RFC 2627 (June 1999)
Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385–394. Springer, Heidelberg (2000)
Joux, A.: The Weil and Tate Pairings as building blocks for public key cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 20–32. Springer, Heidelberg (2002)
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)
Kim, Y., Perrig, A., Tsudik, G.: Communication-Efficient Group Key Agreement. In: IFIP SEC 2001 (June 2001)
Kim, Y., Perrig, A., Tsudik, G.: Tree-based Group Diffie-Hellman Protocol. ACMCCS 2000 (2000)
Perrig, A., Song, D., Tyger, J.D.: ELK, a New Protocol for Efficient Large Group Key Distribution. In: 2001 IEEE Symposium on Security and Privacy, Oakland, CA, USA (May 2001)
Smart, N.P.: An identity based authenticated key agreement protocol based on the weil pairing. Election. Lett. 38(13), 630–632 (2002)
Zhang, F., Liu, S., Kim, K.: ID-Based One Round Authenticated Tripartite Key Agreement Protocol with Pairings (2002), Available at http://eprint.iacr.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, S., Kim, Y., Kim, K., Ryu, DH. (2003). An Efficient Tree-Based Group Key Agreement Using Bilinear Map. In: Zhou, J., Yung, M., Han, Y. (eds) Applied Cryptography and Network Security. ACNS 2003. Lecture Notes in Computer Science, vol 2846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45203-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-45203-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20208-0
Online ISBN: 978-3-540-45203-4
eBook Packages: Springer Book Archive