Novel distributed key revocation scheme for wireless sensor networks

Abstract

Key revocation plays an essential role in ensuring the confidentiality of wireless sensor networks following the compromise of one or more of the network nodes. The distributed key revocation protocol presented by Chan et al. has a rapid reaction time and avoids the single‐point failure problem inherent in centralized schemes. However, the scheme is computationally complex, requires a large storage space, and incurs high communication overheads. Accordingly, this paper proposes a novel distributed, scalable, and cost‐effective key revocation scheme based on Blom's t‐secure property. In the proposed approach, any node identified as having a malicious behavior by t or more sensor nodes is categorized as a compromised node, and its keys are immediately revoked from the entire network. The proposed scheme not only satisfies the rigorous definition of a distributed key revocation protocol but also yields a significant improvement over Chan's revocation scheme in terms of a lower storage space requirement, a reduced communication overhead, and a lower computational cost. Copyright © 2013 John Wiley & Sons, Ltd.

Key revocation in wireless sensor networks: a survey on a less-addressed yet vital issue

“…Further propositions (Chuanget al, 2010;Chao et al, 2013) regarding distributed node revocation in sensor networks demonstrate the usefulness and viability of the CGPM scheme, since many of them build their solutions upon this framework and employ with the basic properties defined in (Chan et al, 2005) to prove their correctness.…”

“…To further improve the CGPM scheme (Chan et al, 2005) in terms of storage space requirement, computational and communication overhead, Chao et al (2013) propose a new distributed revocation scheme based on Blom's ‫-ݐ‬secure property (Blom, 1985).…”

“…By using contrapositive property, a node must be revoked in every part of the network if it is revoked in one part of the network at any time prior to the last ∆ . (Chan et al, 2005) and (Chao et al, 2013) prove that if a node is not revoked in any part of the network at any time prior to the last ∆ time period, it will not be revoked in any other part of the network either. As a result, they satisfy the unitary revocation property.…”

“…Now it is largely recognized that in the context of sensor networks, key revocation is as important as key distribution. To this effect, more and more schemes are being presented to highlight the related problems in WSNs and to give solutions (Dini and Savino, 2006;Kim et al, 2007;Wang et al, 2007;Wang et al, 2008;Jiang and Shi, 2007;Xue and Jürgensen, 2009;Park et al, 2010;Chuanget al, 2010;Chattopadhyay and Turuk, 2012;Chao et al, 2013).…”

Analysis of Key Management Schemes for Centralized and Distributed Key Revocation in Wireless Sensor Networks

“…The distributed revocation protocol proposed in (Chao et al, 2013) consists of four phases, that is, offline initialization, connection establishment, voting, and revocation completion.…”