A group key establishment scheme for ad hoc networks

Since the publication of 2-party Diffie-Hellman (DH) key exchange (1976), various solutions have been proposed to extend Diffie-Hellman key exchange to multiparty key distribution. For the special operational requirement of ad hoc networks, none of these protocols are suitable. This is mainly because they demand the network topology follow a predestined structure. In this paper we utilize the thought of CEDAR (Core-Extraction Distributed Ad hoc Routing) algorithm and integrate the two DH-based protocols, the octopus protocol and the BD protocol, then present a group key establishment system suitable for ad hoc networks.

[1]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE J. Sel. Areas Commun..

[2]  Gene Tsudik,et al.  Diffie-Hellman key distribution extended to group communication , 1996, CCS '96.

[3]  Vaduvur Bharghavan,et al.  CEDAR: a core-extraction distributed ad hoc routing algorithm , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[5]  Uta Wille,et al.  Communication complexity of group key distribution , 1998, CCS '98.

[6]  Bartosz Mielczarek,et al.  Scenario-based performance analysis of routing protocols for mobile ad-hoc networks , 1999, MobiCom.

[7]  Yvo Desmedt,et al.  A Secure and Efficient Conference Key Distribution System (Extended Abstract) , 1994, EUROCRYPT.