Abstract
In a wireless sensor network, pre-distribution of secret keys is possibly the most practical approach to protect network communications. To meet the stringent resource constraints of the sensor nodes, such as limited storage capability, low computation capability, and limited battery life, key pre-distribution schemes should be highly efficient, namely requiring as little storage space as possible, and at the same time, maintain a strong security strength, i.e., high resilience against node capture. In this paper, a new approach for random key pre-distribution is proposed to achieve both efficiency and security goals. The novelty of this approach lies in that, instead of using a key pool consisting of random keys, a random key generation technique is carefully designed such that a large number of random keys can be represented by a small number of key generation keys. Then, instead of storing a big number of random keys, each sensor node stores a small number of key-generation keys while computes the shared secret key during the bootstrapping phase on-the-fly using efficient hash operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ren, K., Zeng, K., Lou, W.: On Efficient Key Pre Distribution in Large Scale Wireless Sensor Networks. In: Military Communications Conference, IEEE MILCOM, Atlantic City, NJ, October 17-20 (2005)
Perrig, A., Szewczyk, R., Wen, V., Culler, D., Tygar, J.: SPINS: Security Protocols for Sensor Networks. In: Proceedings of MOBICOM, Rome, Italy (July 2001)
Eschenauer, L., Gligor, V.: A Key-management Scheme for Distributed Sensor Networks. In: Proceedings of ACM CCS 2002, Washington, DC (2002)
Chan, H., Perrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: Proceedings of IEEE Symposium on Research in Security and Privacy (2003)
Liu, D., Ning, P.: Location-Based Pairwise Key Establishments for Relatively Static Sensor Networks. In: SASN 2003 (2003)
Liu, D., Ning, P.: Establishing Pairwise Keys in Distributed Sensor Networks. In: Proceedings of ACM CCS 2003 (2003)
Du, W., Deng, J., Han, Y., Varshney, P.: A Pairwise Key Predistribution Scheme for Wireless Sensor Networks. In: Proceedings of ACM CCS 2003 (2003)
Du, W., Deng, J., Han, Y., Chen, S., Varshney, P.: A Key Management Scheme for Wireless Sensor Networks Using Deployment Knowledge. In: IEEE INFOCOM 2004, Hongkong (2004)
Zhu, S., Xu, S., Setia, S., Jajodia, S.: Establishing Pair-wise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach. In: Proceedings of ICNP 2003 (2003)
Yuksel, K., Kaps, J., Sunar, B.: Universal Hash Functions for Emerging Ultra-Low-Power Networks. In: Proceedings of CNDS 2004 (2004)
Huang, D., Mehta, M., Medhi, D., Harn, L.: Location-aware Key Management Scheme for Wireless Sensor Networks. In: SASN 2004 (2004)
Erdos, Renyi: On Random Graphs. I. Publ. Math. Debrecen 6, 290–297 (1959)
Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-Hashing for Message Authentication. IETF INTERNET RFC 2104 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abraham, J., Nagasimha, M.P., Bhatt, M., Naik, C. (2011). A Light-Weight Protocol for Data Integrity and Authentication in Wireless Sensor Networks. In: Meghanathan, N., Kaushik, B.K., Nagamalai, D. (eds) Advances in Networks and Communications. CCSIT 2011. Communications in Computer and Information Science, vol 132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17878-8_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-17878-8_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17877-1
Online ISBN: 978-3-642-17878-8
eBook Packages: Computer ScienceComputer Science (R0)