Abstract
We propose a reliable and ubiquitous group key distribution scheme that is suitable for ad hoc networks. The scheme has self-initialisation and self-securing features. The former feature allows a cooperation of an arbitrary number of nodes to initialise the system, and it also allows node admission to be performed in a decentralised fashion. The latter feature allows a group member to determine the group key remotely while maintaining the system security.
We also consider a decentralised solution of establishing secure point-to-point communication. The solution allows a new node to establish a secure channel with every existing node if it has pre-existing secure channels with a threshold number of the existing nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ateniese, G., Steiner, M., Tsudik, G.: Authenticated group key agreement and friends. In: Proceedings of ACM CCS 1998, pp. 17–26 (1998)
Blom, R.: An optimal class of symmetric key generation systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)
Burmester, M., Desmedt, Y.: A secure and efficient conference key distribution system. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275–286. Springer, Heidelberg (1995)
Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Issues in multicast security: a taxonomy and efficient constructions. In: Proceedings of INFOCOM 1999, pp. 708–716 (1999)
Chiang, T.C., Huang, Y.M.: Group keys and the multicast security in ad hoc networks. In: First International Workshop on Wireless Security and Privacy (WiSPr 2003) (2003)
Halevy, D., Shamir, A.: The LSD broadcast encryption scheme. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 47–60. Springer, Heidelberg (2002)
Ingemarsson, I., Tang, D., Wong, C.: A conference key distribution scheme. IEEE Transactions on Information Theory IT-28(5), 714–720 (1982)
Khalili, A., Katz, J., Arbaugh, W.A.: Toward secure key distribution in truly adhoc networks. In: Symposium on Applications and the Internet Workshops (SAINT 2003 Workshops), pp. 342–346 (2003)
Kong, J., Luo, H., Xu, K., Gu, D.L., Gerla, M., Lu, S.: Adaptive security for multilayer ad-hoc networks. John Wiley InterScience Press Journal: Special Issue of Wireless Communications and Mobile Computing (2002)
Kong, J., Zerfos, P., Luo, H., Lu, S., Zhang, L.: Providing robust and ubiquitous security support for mobile ad-hoc networks. In: IEEE Ninth International Conference on Network Protocols (ICNP 2001), pp. 251–260 (2001); Efficient revocation schemes for secure multicast. pages
Luo, H., Kong, J., Zerfos, P., Lu, S., Zhang, L.: Self-securing ad hoc wireless networks. In: IEEE Symposium on Computers and Communications (ISCC 2002) (2002)
Mitchell, C.J., Piper, F.C.: Key storage in secure networks. Discrete Applied Mathematics 21, 215–228 (1988)
Naor, D., Naor, M., Lotspiech, J.: Revocation and tracing schemes for stateless receivers. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 41–62. Springer, Heidelberg (2001)
Obraczka, K., Tsudik, G.: Multicast routing issues in ad hoc networks. In: IEEE International Conference on Universal Personal Communication (ICUPC 1998) (1998)
Ruszinkó, M.: On the upper bound of the size of the r-cover-free families. Journal of Combinatorial Theory A 66, 302–310 (1994)
Steiner, M., Tsudik, G., Waidner, M.: Diffie-Hellman key distribution extended to group communication. In: Proceedings of ACM CCS 1996, pp. 31–37 (1996)
Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems 11(8), 769–780 (2000)
Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J. Statist. Plan. Infer. 86, 595–617 (2000)
Stinson, D.S., Wei, R., Zhu, L.: Some new bounds for cover-free families. Journal of Combinatorial Theory A 90, 224–234 (2000)
Wallner, D.M., Harder, E.C., Agee, R.C.: Key management for multicast: issues and architectures, Internet Draft (1998), ftp://ftp.ietf.org/internet-drafts/draft-wallnerkey-arch-01.txt
Wong, C.K., Gouda, M., Lam, S.S.: Secure group communications using key graphs. In: Proceedings of SIGCOMM 1998, pp. 68–79 (2000)
Zhou, L., Haas, Z.: Securing ad hoc networks. IEEE Network 13(6), 24–30 (1999); A revocation scheme with minimal storage at receivers, pp. 433–450 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurnio, H., Wang, H., Pieprzyk, J., Gaj, K. (2004). Securing Multicast Groups in Ad Hoc Networks. In: Chi, CH., Lam, KY. (eds) Content Computing. AWCC 2004. Lecture Notes in Computer Science, vol 3309. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30483-8_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30483-8_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23898-0
Online ISBN: 978-3-540-30483-8
eBook Packages: Springer Book Archive