A new group rekeying scheme based on t-packing designs for ad hoc networks

Authors

Jianwei Chen, Fujian Normal University
Li Xu, Fujian Normal University
Yi Mu, University of WollongongFollow

RIS ID

22761

Publication Details

Chen, J., Xu, L. & Susilo, W. (2007). A New Group Rekeying Scheme based on t-Packing Designs for Ad Hoc Networks. The Second International Conference on Scalable Information Systems (INFOSCALE 2007) USA: ACM Press.

Abstract

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