2D Hash Chain robust Random Key Distribution scheme

• A new Random Key Distribution Scheme for Wireless Sensor Networks is proposed.
• Our scheme is resistant against node capture attack.
• It has a lower Fail function in comparison with the most important RKD schemes.
• It needs no extra memory for sensors and doesn't introduce a significant overhead.
• It could be applied to any RKD scheme to improve its resilience.

Many Random Key Distribution (RKD) schemes have been proposed in the literature to enable security applications in Wireless Sensor Networks (WSNs). A main security aspect of RKD schemes is their resistance against node capture attacks, since compromising the sensors and capturing their keys is a common risk in such networks. We propose a new method, based on a 2-Dimensional Hash Chain (2DHC), that can be applied on any RKD scheme to improve their resilience. Our method maintains the flexibility and low cost features of RKD schemes and it doesn't require any special-purpose hardware or extra memory to store keys in the sensors. We demonstrate that our approach significantly increases the resilience of RKD schemes against node capture at the cost of a few additional computations, while maintaining network connectivity at the same level.