Using MDS Codes for the Key Establishment of Wireless Sensor Networks

Key pre-distribution techniques for security provision of Wireless Sensor Networks (WSNs) have attracted significant interests recently. In these schemes, a relatively small number of keys are randomly chosen from a large key pool and loaded on the sensors prior to deployment. After being deployed, each sensor tries to find a common key shared by itself and each of its neighbors to establish a link key to protect the wireless communication between themselves. One intrinsic disadvantage of such techniques is that some neighboring sensors do not share any common key. In order to establish a link key among such neighbors, a multi-hop secure path may be used to deliver the secret. Unfortunately, the possibility of sensors being compromised on the path may render such establishment process insecure. In this work, we propose and analyze an Incremental Redundancy Transmission (IRT) scheme that uses the powerful Maximum Distance Separable (MDS) codes to address the problem. In the IRT scheme, the encoded secret link key is transmitted through multiple multi-hop paths. To reduce the total information that needs to be transmitted, the redundant symbols of the MDS codes are transmitted only if the destination fails to decode the secret. One salient feature of the IRT scheme is the flexibility of trading transmission for lower information disclosure. Theoretical and simulation results are presented to support our claim.

[1]  Michael B. Pursley,et al.  Incremental-Redundancv Transmission for Meteor -Burst , 1991 .

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

[3]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[4]  Yunghsiang Sam Han,et al.  A key management scheme for wireless sensor networks using deployment knowledge , 2004, IEEE INFOCOM 2004.

[5]  Panagiotis Papadimitratos,et al.  Secure message transmission in mobile ad hoc networks , 2003, Ad Hoc Networks.

[6]  Yunghsiang Sam Han,et al.  A pairwise key pre-distribution scheme for wireless sensor networks , 2003, CCS '03.

[7]  Yuguang Fang,et al.  A multipath routing approach for secure data delivery , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

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

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

[10]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[11]  Zygmunt J. Haas,et al.  Multipath routing in the presence of frequent topological changes , 2001, IEEE Commun. Mag..

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

[13]  Stephen B. Wicker,et al.  Type-II hybrid-ARQ protocols using punctured MDS codes , 1994, IEEE Trans. Commun..

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

[15]  Dieter Gollmann,et al.  Computer Security – ESORICS 2004 , 2004, Lecture Notes in Computer Science.

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