P.-J. Chuang and T.-H. Chao (Taiwan)
Wireless sensor networks, security, node revocation, key predistribution, voting, threshold secret sharing, space complexity.
Node revocation schemes are used in a wireless sensor network to prevent data from being snatched by system attackers. When a sensor node verifies by the mechanism of a node revocation scheme that another node in the network has been compromised by an attacker, it will cut off the link to that node to avoid information leakage. To carry out instant reaction, a node revocation scheme should work in distributed way without the assistance of base station. A node revocation scheme conducted in a distributed way is effective in reducing the damage caused by compromised nodes, but its operation tends to consume large-scale memory space of the sensor nodes. For improvement, this paper presents a new node revocation scheme. Based on random key predistribution, the proposed scheme adopts the distributed voting way to revoke a compromised node and the concept of Threshold Secret Sharing to reduce the demand for storing devices. Complexity analysis shows that the operation of our scheme requires significantly less memory space than that of previous schemes.
Important Links:
Go Back
