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.

Keywords: hash function collision, key management, random key predistribution, security, wireless sensor network

@inproceedings{Kur12_securecomm,
  title={Two Improvements of Random Key Predistribution for Wireless Sensor Networks},
  author={Kur, J. and Maty{\'a}{\v{s}}, V. and \v{S}}venda, P.},
  booktitle={Proceedings of the 8th International Conference on Security and Privacy in Communication Networks, SecureComm 2012, LNICST (to appear)},
  year={2012},
  organization={Springer}
} 

We have used our S3 Sensor Security Simulator v2.0.0.26 for simulations. The simulator and its source codes can be downloaded from link below. Feel free to contact us for further information about experiment settings.