Skip to Main Content
A distributed reliable key revocation scheme is proposed in this paper according to randomness of the deployment of sensor nodes. This scheme derives the concept of appealing members who are responsible for userspsila revocation operations as the topology varies by using secret sharing techniques and modified Blompsilas symmetric key establishment mechanism. Besides, a novel seed member alternation mechanism is also proposed in this paper, which can efficiently resist of node capture attacks. It also leaves the resources much more balanced among the sensor nodes and helps to prolong the lifetime of WSNs. By comparison, the performance of this scheme is considerably refined in terms of network security, key connectivity, complexity of storage as well as communication.