Robust Membership Management for Ad-hoc Groups

In ad-hoc networks, the network nodes or users often form peer groups. The members of a group may share an application, a physical location, or administrative tasks. Defining who is a member of the group is also the first step towards establishing a shared secret key for secure communications. Group membership management involves adding and removing nodes in the group, as well as a method for authenticating the group members. In this paper, we present a fully distributed, certificate-based system for group membership management. It is designed to suit highly dynamic ad-hoc networks where communications is sporadic and nodes often fail unexpectedly.

[1]  Markus Jakobsson,et al.  How to Forget a Secret , 1999, STACS.

[2]  Butler W. Lampson,et al.  Butler Lampson Microsoft , 1999 .

[3]  Gene Tsudik,et al.  New multiparty authentication services and key agreement protocols , 2000, IEEE Journal on Selected Areas in Communications.

[4]  Wenli Chen,et al.  ANMP: ad hoc network management protocol , 1999, IEEE J. Sel. Areas Commun..

[5]  Ronald L. Rivest,et al.  SDSI - A Simple Distributed Security Infrastructure , 1996 .

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

[7]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[8]  Joan Feigenbaum,et al.  The KeyNote Trust-Management System Version 2 , 1999, RFC.

[9]  Li Gong,et al.  Multicast security and its extension to a mobile environment , 1995, Wirel. Networks.

[10]  Michael K. Reiter,et al.  Integrating security in a group oriented distributed system , 1992, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy.

[11]  Butler W. Lampson,et al.  Simple Public Key Certificate , 1998 .