How to construct random functions
Journal of the ACM (JACM)
Communication-efficient group key agreement
Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Secure key issuing in ID-based cryptography
ACSW Frontiers '04 Proceedings of the second workshop on Australasian information security, Data Mining and Web Intelligence, and Software Internationalisation - Volume 32
New multiparty authentication services and key agreement protocols
IEEE Journal on Selected Areas in Communications
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
| Hi-index | 0.00 |
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.