Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs

We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys between nodes in a WSN. A BIBD(v; b; r; k; λ) (or t - (v; b; r; k; λ)) design can be mapped to a sensor network, where v represents the size of the key pool, b represents the maximum number of nodes that the network can support, k represents the size of the key chain. Any pair (or t-subset) of keys occurs together uniquely in exactly λ nodes. λ = 2 and λ = 3 are used to establish unique pairwise or triple keys. Our pairwise key distribution is the first one that is fully secure (none of the links among uncompromised nodes is affected) and applicable for mobile sensor networks (as key distribution is independent on the connectivity graph), while preserving low storage, computation and communication requirements. We also use combinatorial trades to establish pairwise keys. This is the first time that trades are being applied to key management. We describe a new construction of Strong Steiner Trades. We introduce a novel concept of triple key distribution, in which a common key is established between three nodes. This allows secure passive monitoring of forwarding progress in routing tasks. We present a polynomial-based approach and a combinatorial approach (using trades) for triple key distribution.

[1]  Thomas F. La Porta,et al.  Establishing Pair-Wise Keys in Heterogeneous Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[3]  Sotiris Nikoletseas,et al.  Theoretical Aspects of Distributed Computing in Sensor Networks , 2011, Monographs in Theoretical Computer Science. An EATCS Series.

[4]  Colva M. Roney-Dougal,et al.  Trades and t-designs , 2009 .

[5]  Douglas R. Stinson.  Cryptography: Theory and Practice, Third Edition , 2005 .

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

[7]  Adrian Perrig,et al.  PIKE: peer intermediaries for key establishment in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Elizabeth J. Billington.  Combinatorial trades: a survey of recent results , 2003 .

[9]  Nicholas Hamilton,et al.  On minimum possible volumes of strong Steiner trades , 1999, Australas. J Comb..

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

[11]  Ivan Stojmenovic,et al.  Key Predistribution in Wireless Sensor Networks When Sensors Are Within Communication Range , 2011, Theoretical Aspects of Distributed Computing in Sensor Networks.

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

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

[14]  Peng Ning,et al.  2008 International Conference on Information Processing in Sensor Networks TinyECC: A Configurable Library for Elliptic Curve Cryptography in Wireless Sensor Networks ∗ , 2022 .

[15]  Antoine Joux,et al.  A One Round Protocol for Tripartite Diffie–Hellman , 2000, Journal of Cryptology.

[16]  Omar Cheikhrouhou,et al.  Establishing Pairwise Keys in Heterogeneous Two-Tiered Wireless Sensor Networks , 2009, 2009 Third International Conference on Sensor Technologies and Applications.

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

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

[19]  Deep Medhi,et al.  Secure pairwise key establishment in large-scale sensor networks: An area partitioning and multigroup key predistribution approach , 2007, TOSN.

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

[21]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[22]  A. Khodkar,et al.  On the minimal possible volumes of strong Steiner trades , 1999 .

[23]  Shouhuai Xu,et al.  Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

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