On the Rekeying Load in Group Key Distributions Using Cover-Free Families

Key distributions based on cover-free families have been recently proposed for secure rekeying in group communication systems after multiple simultaneous user ejections. Existing literature has not quantified how difficult this rekeying operation might be. This study provides upper bounds on the number messages necessary to rekey a key distribution based on symmetric combinatorial designs after one or two simultaneous user ejections. Connections are made to results from finite geometry to show that these bounds are tight for certain key distributions. It is shown that in general determining the minimal number of messages necessary to rekey a group communication system based on a cover-free family is NP-hard.

[1]  E. Sperner.  Ein Satz über Untermengen einer endlichen Menge , 1928 .

[2]  Josef Pieprzyk,et al.  Broadcast anti-jamming systems , 2001, Comput. Networks.

[3]  Bülent Yener,et al.  Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks , 2004, IEEE/ACM Transactions on Networking.

[4]  P. Erdös,et al.  Families of finite sets in which no set is covered by the union ofr others , 1985 .

[5]  Lie Zhu,et al.  Some New Bounds for Cover-Free Families , 2000, J. Comb. Theory, Ser. A.

[6]  Ruizhong Wei,et al.  On a Bound of Cover-Free Families , 2004, Des. Codes Cryptogr..

[7]  Mohamed Eltoweissy,et al.  Combinatorial Optimization of Group Key Management , 2003, Journal of Network and Systems Management.

[8]  Amit Sahai,et al.  Coding Constructions for Blacklisting Problems without Computational Assumptions , 1999, CRYPTO.

[9]  Mohamed G. Gouda,et al.  Secure group communications using key graphs , 1998, SIGCOMM '98.

[10]  Cover-Free Family based Efficient Group Key Management Strategy in Wireless Sensor Network , 2008, J. Commun..

[11]  Subhamoy Maitra,et al.  A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design , 2005, International Journal of Information Security.

[12]  Alexander Schrijver,et al.  The Blocking Number of an Affine Space , 1978, J. Comb. Theory, Ser. A.

[13]  Richard C. Singleton,et al.  Nonrandom binary superimposed codes , 1964, IEEE Trans. Inf. Theory.

[14]  Douglas R. Stinson,et al.  Generalized cover-free families , 2004, Discret. Math..

[15]  J. Singer.  A theorem in finite projective geometry and some applications to number theory , 1938 .

[16]  Douglas R. Stinson,et al.  On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs , 2008, TSEC.

[17]  Douglas R. Stinson,et al.  A combinatorial approach to key predistribution for distributed sensor networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[18]  Martin E. Dyer,et al.  On key storage in secure networks , 1995, Journal of Cryptology.

[19]  Jessica Staddon,et al.  Combinatorial properties of frameproof and traceability codes , 2001, IEEE Trans. Inf. Theory.

[20]  Charles J. Colbourn,et al.  Cover-Free Families and Topology-Transparent Scheduling for MANETs , 2004, Des. Codes Cryptogr..

[21]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.