Two Improvements of Random Key Predistribution for Wireless Sensor Networks - Revised Version

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

KŮR Jiří MATYÁŠ Václav ŠVENDA Petr

Year of publication 2012
Type Article in Periodical
Magazine / Source Infocommunications Journal
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords Hash function collision; Key management; Random key predistribution; Security; Wireless sensor network
Description Key distribution is of a critical importance to security of wireless sensor networks (WSNs). Random key predistribution is an acknowledged approach to the key distribution problem. In this paper, we propose and analyze two novel improvements that enhance security provided by the random key predistribution schemes. The first improvement exploits limited length collisions in secure hash functions to increase the probability of two nodes sharing a key. The second improvement introduces hash chains into the key pool construction to directly increase the resilience against a node capture attack. Both improvements can be further combined to bring the best performance. We evaluate the improvements both analytically and computationally on a network simulator. The concepts used are not limited to the random key predistribution.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.