Key predistribution schemes for distributed sensor networks via block designs

Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and this makes the method quite flexible. We also obtain explicit algebraic expressions for the metrics for local connectivity and resiliency. These schemes are quite efficient with regard to connectivity and resiliency and at the same time they allow a straightforward shared-key discovery.

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

[2]  Douglas R. Stinson,et al.  A unified approach to combinatorial key predistribution schemes for sensor networks , 2014, IACR Cryptol. ePrint Arch..

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

[4]  Peter Kruus,et al.  CONSTRAINTS AND APPROACHES FOR DISTRIBUTED SENSOR NETWORK SECURITY , 2000 .

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

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

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

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

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

[10]  Rodrigo Roman,et al.  On the Security of Wireless Sensor Networks , 2005, ICCSA.

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

[12]  Prince Camille de Polignac.  On a Problem in Combinations , 1866 .

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

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

[15]  Saurabh Singh,et al.  Security For Wireless Sensor Network , 2011 .

[16]  A. Street,et al.  Combinatorics of experimental design , 1987 .

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

[18]  Nam-Ky Nguyen,et al.  Incomplete Block Designs , 2011, International Encyclopedia of Statistical Science.

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

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

[21]  Bülent Yener,et al.  Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks , 2004, ESORICS.

[22]  Mohamed F. Younis,et al.  Location-Aware Combinatorial Key Management Scheme for Clustered Sensor Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[23]  Bülent Yener,et al.  Combinatorial design of key distribution mechanisms for wireless sensor networks , 2007, TNET.

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