Secure group communications for wireless networks

• Published in: 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277) Vol. 1; pp. 113 - 117 vol.1
• Main Authors: DeCleene, B., Dondeti, L., Griffin, S., Hardjono, T., Kiwior, D., Kurose, J., Towsley, D., Vasudevan, S., Zhang, C.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2001
• Subjects: Analytical models; Command and control systems; Communication system security; Computational modeling; Delay effects; Environmental management; Prototypes; Testing; Throughput; Wireless networks
• ISBN: 9780780372252; 0780372255
• DOI: 10.1109/MILCOM.2001.985773

In this paper we consider the problem of key management in a highly-mobile wireless networking environment, such as a dynamic, distributed setting in which command and control nodes move along with individual users. In this scenario, data must be securely multicast from one source to many users, requiring that users be properly keyed. Furthermore, because users move in and out of the session (due to mobility, attrition, and reinforcement), in order to preserve confidentiality, it becomes necessary to rekey each time a user enters or leaves. We present a hierarchical framework and key distribution algorithms for such a dynamic environment, with a focus on how keys and trust relationships are transferred when users move between so-called "areas" in the hierarchy. We present several schemes including one that rekeys every time a member moves from area to area and one that delays rekeying so long as security is not compromised. Our preliminary analytical and simulation results indicate that it is possible to trade off communication throughput with computational and security overheads. We also briefly describe a prototype testbed in which we are implementing and experimenting with these algorithms.