A unified approach to combinatorial key predistribution schemes for sensor networks

There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes. Many of these schemes have very similar properties and are analysed in a similar manner. We seek to provide a unified framework to study these kinds of schemes. To do so, we define a new, general class of designs, termed “partially balanced t-designs”, that is sufficiently general that it encompasses almost all of the designs that have been proposed for combinatorial key predistribution schemes. However, this new class of designs still has sufficient structure that we are able to derive general formulas for the metrics of the resulting key predistribution schemes. These metrics can be evaluated for a particular scheme simply by substituting appropriate parameters of the underlying combinatorial structure into our general formulas. We also compare various classes of schemes based on different designs, and point out that some existing proposed schemes are in fact identical, even though their descriptions may seem different. We believe that our general framework should facilitate the analysis of proposals for combinatorial key predistribution schemes and their comparison with existing schemes, and also allow researchers to easily evaluate which scheme or schemes present the best combination of performance metrics for a given application scenario.

[1]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

[2]  Douglas R. Stinson,et al.  Combinatorial designs: constructions and analysis , 2003, SIGA.

[3]  Subhamoy Maitra,et al.  A Key Pre-distribution Scheme for Wireless Sensor Networks: Merging Blocks in Combinatorial Design , 2005, ISC.

[4]  Amrita Saha,et al.  SECURITY ENHANCED KEY PREDISTRIBUTION SCHEME USING TRANSVERSAL DESIGNS AND REED MULLER CODES FOR WIRELESS SENSOR NETWORKS , 2011 .

[5]  Keith M. Martin.  The Rise and Fall and Rise of Combinatorial Key Predistribution , 2010, Selected Areas in Cryptography.

[6]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

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

[8]  Sushmita Ruj,et al.  Key predistribution using combinatorial designs for grid-group deployment scheme in wireless sensor networks , 2009, TOSN.

[9]  Aritra Dhar,et al.  Full Communication in a Wireless Sensor Network by Merging Blocks of a Key Predistribution using Reed Solomon Code , 2011 .

[10]  Charles J. Colbourn,et al.  Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications) , 2006 .

[11]  K. A. Bush.  Orthogonal Arrays of Index Unity , 1952 .

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

[13]  Richard M. Wilson,et al.  A Course in Combinatorics: Preface to the second edition , 2001 .

[14]  Tuvi Etzion,et al.  Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks , 2008, IEEE Transactions on Information Theory.

[15]  Dingyi Pei,et al.  A Class of Key Predistribution Schemes Based on Orthogonal Arrays , 2008, Journal of Computer Science and Technology.

[16]  Subhamoy Maitra,et al.  A Hybrid Design of Key Pre-distribution Scheme for Wireless Sensor Networks , 2005, ICISS.

[17]  Haim Hanani,et al.  A Class of Three-Designs , 1979, J. Comb. Theory, Ser. A.

[18]  Amrita Saha,et al.  Highly Resilient Key Predistribution Scheme Using Transversal Designs and Reed Muller Codes For Wireless Sensor Network , 2011 .

[19]  Keith M. Martin,et al.  On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks , 2009, IWCC.

[20]  Moti Yung,et al.  Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[21]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[22]  Sushmita Ruj,et al.  Key Predistribution Using Partially Balanced Designs in Wireless Sensor Networks , 2007, ISPA.

[23]  Rolf Blom,et al.  An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.

[24]  J. Thas,et al.  Finite Generalized Quadrangles , 2009 .

[25]  Tuvi Etzion,et al.  Efficient Key Predistribution for Grid-Based Wireless Sensor Networks , 2008, ICITS.

[26]  J. H. van Lint,et al.  A Course in Combinatorics: Trees , 2001 .

[27]  John L. Blanchard,et al.  A construction for orthorgonal arrays with strength t>=3 , 1995, Discret. Math..

[28]  Dingyi Pei,et al.  Authentication codes and combinatorial designs , 2005 .

[29]  Moti Yung,et al.  Perfectly Secure Key Distribution for Dynamic Conferences , 1998, Inf. Comput..

[30]  Douglas R. Stinson,et al.  Deterministic Key Predistribution Schemes for Distributed Sensor Networks , 2004, Selected Areas in Cryptography.

[31]  Aritra Dhar,et al.  ASSURED FULL COMMUNICATION BY M ERGING BLOCKS RANDOMLY IN W IRELESS SENSOR N ETWORKS USING REED SOLOMON CODE FOR KEY PREDISTRIBUTION , 2011 .

[32]  Douglas R. Stinson,et al.  Common intersection designs , 2006 .

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

[34]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[35]  Jennifer Seberry,et al.  Key Predistribution Schemes Using Block Designs in Wireless Sensor Networks , 2009, 2009 International Conference on Computational Science and Engineering.

[36]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[37]  Jennifer Seberry,et al.  Combinatorial Structures for Design of Wireless Sensor Networks , 2006, ACNS.

[38]  Sarbari Mitra,et al.  A Hierarchical Deterministic Key Pre-distribution for WSN Using Projective Planes , 2011, ADHOCNETS.

[39]  Xueli Wang,et al.  A Key Predistribution Scheme Based on 3-Designs , 2007, Inscrypt.

[40]  Aloke Dey,et al.  Key predistribution schemes for distributed sensor networks via block designs , 2013, Des. Codes Cryptogr..

[41]  Chunming Rong,et al.  A novel key pre-distribution scheme for wireless distributed sensor networks , 2010, Science China Information Sciences.

[42]  Douglas R. Stinson,et al.  Key predistribution for homogeneous wireless sensor networks with group deployment of nodes , 2010, TOSN.

[43]  Charles J. Colbourn,et al.  Combinatorial Designs , 1999, Handbook of Discrete and Combinatorial Mathematics.

[44]  Sushmita Ruj,et al.  Key Predistribution Schemes Using Codes in Wireless Sensor Networks , 2009, Inscrypt.

[45]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[46]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

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

[48]  Sushmita Ruj,et al.  Revisiting Key Predistribution Using Transversal Designs for a Grid-Based Deployment Scheme , 2009, Int. J. Distributed Sens. Networks.

[49]  Jiang Wu,et al.  Product Construction of Key Distribution Schemes for Sensor Networks , 2004, Selected Areas in Cryptography.

[50]  Ken Martin.  Discrete Structures in the Theory of Secret Sharing , 1991 .