A t-Packing Designs Based Group Rekeying Scheme in Ad hoc Networks

Wagner D. Cryptanalysis of an Algebraic PrivacyHomomorphism. in ISC2003, Lecture Notes in Comput. Sci.,Vol. 2851, Springer-Verlag, Berlin, 2003: 234-239.[2]Li P C, van Rees G H J, and Wei R. Constructions of2-cover-free families and related separating hash families. J.of Combinatorial Designs, Published Online, 2006, 14:423-440.[3]Yang Z X. Construction of Orthogonal Arrays. Jinan:Shandong People Press, 1978: 110-128.[4]Chan A C-F. Distributed symmetric key management formobile ad hoc networks[J].IEEE INFOCOM.2004, 4:2414-2424[5]Chan H, Perrig A, and Song D. Random key pre-distributionschemes for sensor networks. IEEE Symposium on Securityand Privacy, Berkeley, 2003: 197-213.Du W, Deng J, Han Y S, and Varshney P K. A pairwise keypre-distribution scheme for wireless sensor networks. Proc. ofthe 10th ACM conf. on Computer and communicationsSecurity, Washington, ACM Press, 2003: 42-51.[6]Sung Jin Choi and Hee Yong Youn. An efficient keypre-distribution scheme for secure distributed sensornetworks. EUC 2005 workshops, LNCS 3823, Berlin,Springer-Verlag, 2005: 1088-1097.[7]Zhu S, Setia S, Xu S, and Jajodia S. GKMPAN: An efficientgroup rekeying scheme for secure multicast in Ad-hocnetworks. In Proc. of International Conference on Mobile andUbiquitous Systems: Networking and Services, Boston, 2004:42-51.[8]Erdos P and Renyi A. On Random Graphs I. Publicationsmathematicae, Debrecen, 1959: 290-297.