A Byzantine resilient multi-path key establishment scheme and its robustness analysis for sensor networks

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Random key predistribution and pairwise key establishment schemes have been proposed for key management in large-scale sensor networks. In these schemes, after being deployed, sensors set up pairwise keys via preinstalled keys. The key establishment schemes are vulnerable to Byzantine attacks, i.e., packet dropping or altering. To counter these attacks, we propose a Byzantine resilient multi-path key establishment scheme that uses the Reed-Solomon error-correct coding scheme to improve resilience to Byzantine attacks. Our proposed scheme can tolerate at most t faulty key paths, where t - (n - k)/2 when (n,k) Reed-Solomon error-correct coding scheme is used. In addition, by using the Reed-Solomon coding scheme, sensors can identify the faulty paths with minimal communication overhead.

[1]  Roberto Di Pietro,et al.  Efficient and resilient key discovery based on pseudo-random key pre-deployment , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[2]  Donggang Liu,et al.  Location-based pairwise key establishments for static sensor networks , 2003, SASN '03.

[3]  Zygmunt J. Haas,et al.  Analysis of multipath Routing-Part I: the effect on the packet delivery ratio , 2004, IEEE Transactions on Wireless Communications.

[4]  Dilip V. Sarwate.  On the complexity of decoding Goppa codes (Corresp.) , 1977, IEEE Trans. Inf. Theory.

[5]  Dijiang Huang,et al.  RINK-RKP: a scheme for key predistribution and shared-key discovery in sensor networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

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

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

[8]  Ramesh Bhandari.  Survivable Networks: Algorithms for Diverse Routing , 1998 .

[9]  Xuemin Chen,et al.  Error-Control Coding for Data Networks , 1999 .

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

[11]  Deep Medhi,et al.  Modeling Pairwise Key Establishment for Random Key Predistribution in Large-Scale Sensor Networks , 2007, IEEE/ACM Transactions on Networking.

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

[13]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

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

[15]  Dilip V. Sarwate,et al.  On the complexity of decoding goppa codes , 1977 .

[16]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[17]  Deep Medhi,et al.  Location-aware key management scheme for wireless sensor networks , 2004, SASN '04.

[18]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[19]  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..

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