Key Pre-distribution and Key Revocation in Wireless Sensor Networks

Sensor networks are composed of resource constrained tiny sensor devices. They have less computational power and memory. Communication in sensor network is done in multi-hop, and for secure communication, neighboring sensor nodes must possess a secret common key among them. Symmetric and public key cryptography require more processing and memory space. Hence, they are not suitable for sensor network. In this book we proposed a deterministic key pre-distribution scheme using BCH codes. We mapped the BCH code to key identifier and the keys corresponding to each key identifier are installed into the sensor nodes before deployment. We compared our proposed scheme with existing one and found that it has a better resiliency. Our proposed scheme is scalable and requires the same or less number of keys for a given number of nodes than the existing well known schemes. We have also proposed an efficient key revocation technique using a novel distributed voting mechanism in which neighboring nodes of a sensor can vote against it if they suspect the node to be a compromised one. In the proposed key revocation scheme compromised nodes as well as the compromised keys are completely removed.

Autorentext

Subhankar Chattopadhyay has done his M. Tech in Information Security from NIT Rourkela, India. His research interest includes Sensor Network, Cryptography etc. Ashok Kumar Turuk has done his phd from IIT Kharagpur. His research interest includes Sensor Network, Ad-hoc Network etc. He is currently working as an associate professor in NIT Rourkela.