An Efficient Group Key Agreement Scheme for Mobile Ad Hoc Networks

An Efficient Group Key Agreement Scheme for
Mobile Ad-Hoc Networks

Yang Yang1, 2, Yupu Hu2, Chunhui Sun2, Chao Lv2, Leyou Zhang3
1College of Mathematics and Computer Science, Fuzhou University, China
2 Department of Telecommunication, Xidian University, China
3Department of Science, Xidian University, China
   
 

Abstract:
Mobile Ad-hoc Networks (MANETs) are considered as the most promising terminal networks in future wireless communications and characterized by flexibility, fast and easy deployment, which make them an interesting technology for various applications. Group communication is one of the main concerns in MANETs. To provide the secure group communication in wireless networks, a group key is required so that efficient symmetric encryption can be performed. In this paper, we propose a constant-round group key agreement scheme to enable secure group communications, which adopts the Identity Based Broadcast Encryption (IBBE) methodology. When a new Ad-hoc network is constructed, the suggested scheme requires no message exchange to establish a group key if the receivers’ identities are known to the broadcaster, which is an advantage that outperforms most of the existing key agreement schemes. The proposed scheme can build a new group and establish a new group key with ease when member joins or leaves. In addition, our scheme is efficient in computation and only one bilinear pair computation is required for group members to obtain his/her session key. A highlight property of the scheme is that communication cost remains unchanged as group size grows. Furthermore, we show that the new scheme is proved secure without random oracle. Thus, the scheme can not only meet security demands of larger mobile Ad-hoc networks but also improve executing performance.


Keywords: Group key agreement scheme, identity based, broadcast encryption, data security, public key cryptography, standard model.

 
Received October 6, 2010; accepted March 1, 2011

Read 3083 times Last modified on Monday, 07 January 2013 04:22
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…