Sciweavers

CANS
2007
Springer

Forward-Secure Key Evolution in Wireless Sensor Networks

13 years 11 months ago
Forward-Secure Key Evolution in Wireless Sensor Networks
We consider a key distribution scheme for securing node-to-node communication in sensor networks. While most schemes in use are based on random predistribution, we consider a system of dynamic pairwise keys based on design due to Ren, Tanmoy and Zhou. We design and analyze a variation of this scheme, in which capturing a node does not lead to security threats for the past communication. Instead of bit-flipping, we use a cryptographic one-way function. While this immediately guarantees forward-security, it is not clear whether the pseudorandom transformation of the keys does not lead to subtle security risks due to a specific distribution of reachable keys, such as existence of small attractor subspaces. (This problem does not occur for the design of Ren, Tanmoy and Zhou.) We show, in a rigid mathematical way, that this is not the case: after a small number of steps probability distribution of keys leaves no room for potential attacks.
Marek Klonowski, Miroslaw Kutylowski, Michal Ren,
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CANS
Authors Marek Klonowski, Miroslaw Kutylowski, Michal Ren, Katarzyna Rybarczyk
Comments (0)