Authors: Chunying Wu; Shundong Li; Yiying Zhang
Addresses: School of Computer Science, Shaanxi Normal University, Xi'an, Shanxi, 710062, China; School of Computer, Qinghai Normal University, Xining, Qinghai, 810008, China ' School of Computer Science, Shaanxi Normal University, Xi'an, Shanxi, 710062, China ' State Grid Information & Telecommunication Branch, Beijing, 100761, China
Abstract: Wireless sensor networks (WSNs) easily suffer various attacks because of its vulnerable environment, limited recourse and open communication channel. So the security of the key distribution and management in wireless sensor networks is the key challenge for its wide applications, we propose a key management based on secret sharing (KMSS) scheme. KMSS is based on logarithm discrete assumption in elliptic curve and secret sharing, which cannot only efficiently protect the whole network security but also extend survivability. Compared to previous works, the KMSS distribution keys cannot only resist a certain amount of compromised node attack but also keep elasticity of the nodes in one cluster. The KMSS provides different levels of various session keys for communication. The KMSS dynamically generates different keys based on different polynomials from BS which can reduce the high probability of the common keys. The security analysis shows the KMSS can prevent collusion attacks effectively and reduce the energy consumption.
Keywords: WSNs; wireless sensor networks; key management; secret sharing; cluster head; sensor nodes; RSA; ECDL; hierarchical clustering; network security; elliptic curve cryptography; ECC; network survivability; node elasticity; collusion attacks; energy consumption.
International Journal of Information and Communication Technology, 2015 Vol.7 No.2/3, pp.126 - 140
Received: 04 Sep 2013
Accepted: 19 Oct 2013
Published online: 25 Feb 2015 *