Research Article
Two Improvements of Random Key Predistribution for Wireless Sensor Networks
@INPROCEEDINGS{10.1007/978-3-642-36883-7_5, author={Jiř\^{\i} Kůr and Vashek Maty\^{a}š and Petr Švenda}, title={Two Improvements of Random Key Predistribution for Wireless Sensor Networks}, proceedings={Security and Privacy in Communication Networks. 8th International ICST Conference, SecureComm 2012, Padua, Italy, September 3-5, 2012. Revised Selected Papers}, proceedings_a={SECURECOMM}, year={2013}, month={2}, keywords={hash function collision key management random key predistribution security wireless sensor network}, doi={10.1007/978-3-642-36883-7_5} }- Jiří Kůr
Vashek Matyáš
Petr Švenda
Year: 2013
Two Improvements of Random Key Predistribution for Wireless Sensor Networks
SECURECOMM
Springer
DOI: 10.1007/978-3-642-36883-7_5
Abstract
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.