Cover-Free Family based Efficient Group Key Management Strategy in Wireless Sensor Network

Secure group key distribution and efficient rekeying is one of the most challenging security issues in sensor networks at present. In this paper, Latin square is firstly used to construct orthogonal arrays in order to obtain t-packing designs quickly. Based on cover-free family properties, t-packing designs are adopted in key predistribution phase. Then based secure key-shared method, the pre-deployed keys are used for implementing secure channels between members for group key distribution. The efficient updating the pre-deployed keys scheme is used to deal with the variety of network. The new strategy improves the collusion-resilience of the networks using the cover-free family properties, and enhances the key-sharing connectivity of nodes with which makes key management more efficiently. This paper also presents in depth theory and data analysis of the new strategy in term of network security and connectivity

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

[2]  Huaxiong Wang,et al.  Cover-Free Families and Their Applications , 2007 .

[3]  Li Xu,et al.  Identity Based Private Matching , 2007, Third International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (SecPerU 2007).

[4]  John T. Kohl,et al.  The Kerberos Network Authentication Service (V5 , 2004 .

[5]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[6]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[7]  Yang Xiao,et al.  Security in distributed and networking systems , 2007 .

[8]  Yu-Kwong Kwok.  Key Management in Wireless Sensor Networks , 2007 .

[9]  Yunghsiang Sam Han,et al.  A pairwise key pre-distribution scheme for wireless sensor networks , 2003, CCS '03.

[10]  Ruizhong Wei,et al.  Comments on "Distributed symmetric key management for mobile ad hoc networks" , 2009, Inf. Process. Lett..

[11]  David A. Wagner,et al.  Cryptanalysis of an Algebraic Privacy Homomorphism , 2003, ISC.

[12]  Gene Tsudik,et al.  Communication-Efficient Group Key Agreement , 2001, SEC.

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

[14]  Paul Erdös,et al.  On random graphs, I , 1959 .

[15]  S. Zhu,et al.  GKMPAN: an efficient group rekeying scheme for secure multicast in ad-hoc networks , 2004, The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004..

[16]  Aldar C.-F. Chan,et al.  Distributed symmetric key management for mobile ad hoc networks , 2004, IEEE INFOCOM 2004.

[17]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[18]  Yan Zhang,et al.  Key Management in Wireless Sensor Networks , 2008 .

[19]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[20]  Douglas R. Stinson,et al.  Generalized cover-free families , 2004, Discret. Math..

[21]  Byoungcheon Lee,et al.  Secure Key Issuing in ID-based Cryptography , 2004, ACSW.