The Rise and Fall and Rise of Combinatorial Key Predistribution

There are many applications of symmetric cryptography where the only realistic option is to predistribute key material in advance of deployment, rather than provide online key distribution. The problem of how most effectively to predistribute keys is inherently combinatorial. We revisit some early combinatorial key predistribution shemes and discuss their limitations. We then explain why this problem is back "in fashion" after a period of limited attention by the research community. We consider the appropriateness of combinatorial techniques for key distribution and identify potential areas of further research.

[1]  Patel,et al.  Information Security: Theory and Practice , 2008 .

[2]  Chris J. Mitchell,et al.  Key storage in secure networks , 1988, Discret. Appl. Math..

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

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

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

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

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

[8]  Bülent Yener,et al.  Key distribution mechanisms for wireless sensor networks : a survey , 2005 .

[9]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[10]  Aggelos Kiayias,et al.  BiTR: Built-in Tamper Resilience , 2011, IACR Cryptol. ePrint Arch..

[11]  Keith M. Martin,et al.  Ultra-Lightweight Key Predistribution in Wireless Sensor Networks for Monitoring Linear Infrastructure , 2009, WISTP.

[12]  Keith M. Martin,et al.  An Application-Oriented Framework for Wireless Sensor Network Key Establishment , 2008, Electron. Notes Theor. Comput. Sci..

[13]  Ernest F. Brickell,et al.  Advances in Cryptology — CRYPTO’ 92 , 2001, Lecture Notes in Computer Science.

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

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

[16]  Yeow Meng Chee,et al.  Coding and Cryptology, Second International Workshop, IWCC 2009, Zhangjiajie, China, June 1-5, 2009. Proceedings , 2009, IWCC.

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

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