Abstract
The nature of mobile ad-hoc networks does not permit a member of the group or a central authority to determine a single key to be used among the group members. Group key agreement offers a solution to this problem by allowing the group members to collaboratively determine the common key for the group. Additionally, authenticated group key agreement (AGKA) is an important issue in many modern collaborative and distributed applications. During the last few years, a number of authenticated group key agreement protocols have been proposed in the literature. In this paper, we present a secure ID-based AGKA protocol which only requires one round by using pairing-based cryptography. We prove that the scheme is secure against an active adversary under the decisional bilinear Diffie-Hellman assumption in the Random Oracle Model. We then extend our scheme to a two-round AGKA protocol which is more efficient in communication costs, and this scheme outperforms any existing AGKA protocols in the literature.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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)
Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514–532. Springer, Heidelberg (2001)
Bohli, J., Glas, B., Steinwandt, R.: Towards Provably Secure Group Key Agreement Building on Group Theory. In: Cryptology ePrint Archive, Report 2006/079 (2006)
Choi, K.Y., Hwang, J.Y., Lee, D.-H.: Efficient ID-based Group Key Agreement with Bilinear Maps. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 130–144. Springer, Heidelberg (2004)
Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.: Provably Authenticated Group Diffie-Hellman Key Exchange. In: Proc. 8th ACM Conference on Computer and Communication Secuirty (CCS) (2001)
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)
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)
Katz, J., Yung, M.: Scalable Protocols for Authenticated Group Key Exchange. Full version
Diffie, W., Hellman, M.: New Directions In Cryptography. IEEE Transactions on Information Theory IT-22(6), 644–654 (1976)
Ingemarsson, I., Tang, D.T., Wong, C.K.: A Conference Key Distribution System. IEEE Transactions on Information Theory 28(5), 714–720 (1982)
Dutta, R., Barua, R.: Constant Round Dynamic Group Key Agreement. Cryptology ePrint Archive, Report 2005/221 (2005)
Cheng, Z., Vasiu, L., Comley, R.: Pairing-based one-round tripartite key agreement protocols. Cryptology ePrint Archive, Report 2004/079 (2004)
Zhang, F., Liu, S., Kim, K.: ID-Based One Round Authenticated Tripartite Key Agreement Protocol with Pairings. Cryptology ePrint Archive, Report 2002/122 (2002)
Du, X., Wang, Y., Ge, J., Wang, Y.: An Improved ID-based Authenticated Group Key Agreement Scheme. Cryptology ePrint Archive, Report 2003/260 (2003)
Shi, Y., Chen, G., Li, J.: ID-Based One Round Authenticated Group Key Agreement Protocol with Bilinear Pairings. In: International Conference on Information Technology: Coding and Computing (ITCC 2005), vol. 1, pp. 757–761 (2005)
Joux, A.: An one round protocol for tripartite Diffie-Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385–394. Springer, Heidelberg (2000)
Du, X., Wang, Y., Ge, J., Wang, Y.: ID-Based Authenticated Two Round Multi-Party Key Agreement. Cryptology ePrint Archive, Report 2003/247 (2003)
Zhou, L., Susilo, W., Mu, Y.: Efficient ID-based Authenticated Group Key Agreement from Bilinear Pairings (full version) (manuscript 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, L., Susilo, W., Mu, Y. (2006). Efficient ID-Based Authenticated Group Key Agreement from Bilinear Pairings. In: Cao, J., Stojmenovic, I., Jia, X., Das, S.K. (eds) Mobile Ad-hoc and Sensor Networks. MSN 2006. Lecture Notes in Computer Science, vol 4325. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11943952_44
Download citation
DOI: https://doi.org/10.1007/11943952_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49932-9
Online ISBN: 978-3-540-49933-6
eBook Packages: Computer ScienceComputer Science (R0)