A t-Packing Designs Based Group Rekeying Scheme in Ad hoc Networks
自组网中一种基于填充设计的组密钥更新策略

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, from which t-packing designs can be quickly obtained. Based on cover-free family properties, t-packing designs are adopted in key pre-distribution phase. 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 efficiency.