Efficient hybrid key agreement protocol for wireless ad hoc networks

Secure and efficient communication among a set of mobile nodes is one of the most important aspects in ad-hoc wireless networks. To ensure the security, several cryptography protocols must be implemented. Due to the resource scarcity in wireless networks, the protocols must be communication efficient and need as less computational power as possible. To secure the group broadcasting in wireless networks, often a group key is needed so that efficient conventional encryption, such as DES and AES, can be used. Several group key management protocols have been proposed. However, not all of them are communication efficient when applied to wireless ad-hoc networks. In this paper, we propose a key agreement protocol that is communication efficient by using connected dominating set concept to set up subgroups among all wireless nodes. We also show how to manage the group efficiently in a mobile environment.

[1]  Amos Fiat,et al.  Broadcast Encryption , 1993, CRYPTO.

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

[3]  Ralph C. Merkle,et al.  Secrecy, authentication, and public key systems , 1979 .

[4]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[5]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[6]  Eric J. Harder,et al.  Key Management for Multicast: Issues and Architectures , 1999, RFC.

[7]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

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

[9]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[10]  Gene Tsudik,et al.  CLIQUES: a new approach to group key agreement , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[11]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[12]  Alan T. Sherman,et al.  Key Establishment in Large Dynamic Groups Using One-Way Function Trees , 2003, IEEE Trans. Software Eng..

[13]  Yvo Desmedt,et al.  Towards practical “proven secure” authenticated key distribution , 1993, CCS '93.

[14]  Mike Burmester,et al.  On the Risk of Opening Distributed Keys , 1994, CRYPTO.

[15]  Gene Tsudik,et al.  Authenticated group key agreement and friends , 1998, CCS '98.

[16]  N. Asokan,et al.  Key agreement in ad hoc networks , 2000, Comput. Commun..

[17]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[18]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  Gene Tsudik,et al.  Tree-based group key agreement , 2004, TSEC.