Abstract
Common group key agreement protocols are not applicable in ad hoc networks because the dynamic and multi-hop nature. Clustering is a method by which nodes are hierarchically organized based on their relative proximity to one another. Driven by this insight, a hierarchical key agreement protocol is proposed to weaken the 1-hop assumption in common group key agreement protocols. We employ Joux’s tripartite protocol and a generalized Diffie-Hellman protocol as the basic building block for group key agreement. The protocol can handle efficiently the dynamic events in ad hoc networks. Moreover, in order to authenticate the messages, a provable ID-based signature scheme is presented. The analysis results indicate that the proposed protocol is secure in withstanding many common attacks and is extremely efficient and feasible to ad hoc networks with large size.
This work is supported by the National Natural Science Foundation of China under Grant No.60473030, No.60473090, No.60573129, the Key Projects Foundation of Ministry of Education of China and the Foundation of Science & Technology Agency of Sichuan Province under Grant No.05JY029-131.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Albert, R., Barabsi, A.L.: Statistical mechanics of complex networks. Reviews of modern physics 74(1), 47–100 (2002)
Al-Riyami, S., Paterson, K.: Tripartite authenticated key agreement protocols from pairings. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 332–359. Springer, Heidelberg (2003)
Amir, Y., Kim, Y., Nita-Rotaru, C., Tsudik, G.: On the Performance of Group Key Agreement Protocols. ACM Transactions on Information and System Security 7(3), 457–488 (2004)
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, pp. 354–368. Springer, Heidelberg (2002)
Belding-Royer, E.M.: Hierarchical Routing in Ad hoc Mobile Networks. Wireless Communication & Mobile Computing 2(5), 515–532 (2002)
Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–219. Springer, Heidelberg (2001)
Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transaction on Information Theory 22(6), 644–654 (1976)
Hess, F.: Efficient identity-based signature schemes based on pairings. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol. 2595, pp. 310–324. Springer, Heidelberg (2003)
Joux, A.: A One Round Protocol for Tripartite DiffieCHellman. Journal of Cryptology 17(4), 263–276 (2004)
Kim, Y., Perrig, A., Tsudik, G.: Simple and Fault-Tolerant Key Agreement For Dynamic Collaborative Groups. In: The 7th ACM Conference on Computer and Communications Security, vol. 7(1), pp. 235–244 (2000)
Kim, Y., Perrig, A., Tsudik, G.: Communication-Efficient Group Key Agreement. In: Proceedings of the 16th International Conference on Information Security 2001, pp. 229–244 (2001)
Lee, S., Kim, Y., Kim, K., Ryu, D.H.: An Efficient Tree-based Group Key Agreement using Bilinear Map. In: Zhou, J., Yung, M., Han, Y. (eds.) ACNS 2003. LNCS, vol. 2846, pp. 357–371. Springer, Heidelberg (2003)
Li, X., Wang, Y., Frieder, O.: Efficient Hybrid Key Agreement Protocol for Wireless Ad Hoc Networks. In: IEEE International Conference on Computer Communications and Networks, pp. 404–409 (2002)
Liu, S.L., Zhang, F.G., Chen, K.F.: Authenticating Tripartite Key Agreement Protocol with Pairings. Journal of Computer Science and Technology 19(2), 169–176 (2004)
Pei, G., Gerla, M., Hong, X., Chiang, C.C.: A wireless hierarchical routing protocol with group mobility. In: Proceedings of IEEE WCNC 1999, pp. 1538–1542 (1999)
Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology 13(3), 361–396 (2000)
Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985)
Steiner, M., Tsudik, G., Waidner, M.: Key Agreement in Dynamic Peer Groups. IEEE Transactions on Parallel and Distributed Systems 11(8), 769–780 (2000)
Sucec, J., Marsic, I.: Clustering Overhead for Hierarchical Routing in Mobile Adhoc Networks. In: Proceedings of IEEE Infocom 2002, pp. 1698–1706 (2002)
Yao, G., Ren, K., Bao, F., et al.: Making the Key Agreement Protocol in Mobile Ad Hoc Network More Efficient. In: Zhou, J., Yung, M., Han, Y. (eds.) ACNS 2003. LNCS, vol. 2846, pp. 343–356. Springer, Heidelberg (2003)
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
Shi, H., He, M., Qin, Z. (2006). Authenticated and Communication Efficient Group Key Agreement for Clustered Ad Hoc Networks. In: Pointcheval, D., Mu, Y., Chen, K. (eds) Cryptology and Network Security. CANS 2006. Lecture Notes in Computer Science, vol 4301. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11935070_5
Download citation
DOI: https://doi.org/10.1007/11935070_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49462-1
Online ISBN: 978-3-540-49463-8
eBook Packages: Computer ScienceComputer Science (R0)