2nd International ICST Conference on Scalable Information Systems

Research Article

A New Group Rekeying Scheme based on t-Packing Designs for Ad Hoc Networks

Download540 downloads
  • @INPROCEEDINGS{10.4108/infoscale.2007.929,
        author={Jianwei Chen and Li Xu and Yi Mu},
        title={A New Group Rekeying Scheme based on t-Packing Designs for Ad Hoc Networks},
        proceedings={2nd International ICST Conference on Scalable Information Systems},
        proceedings_a={INFOSCALE},
        year={2010},
        month={5},
        keywords={Ad Hoc network group rekeying Packing Design Cover-Free Family},
        doi={10.4108/infoscale.2007.929}
    }
    
  • Jianwei Chen
    Li Xu
    Yi Mu
    Year: 2010
    A New Group Rekeying Scheme based on t-Packing Designs for Ad Hoc Networks
    INFOSCALE
    ICST
    DOI: 10.4108/infoscale.2007.929
Jianwei Chen1,*, Li Xu1,*, Yi Mu2,*
  • 1: Key Lab of Network Security and Cryptology, Fujian Normal University, Fuzhou, 350007, China.
  • 2: School of Computer Science and Software Engineering, University of Wollongong, Wollongong, NSW 2522, Australia.
*Contact email: cjwxin_1@fjnu.edu.cn, xuli@fjnu.edu.cn, ymu@uow.edu.au

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