Abstract
Through building the neighbor list, we propose effective pairwise key storage and update methods. The structure of the neighbor list is simple and can save the storage space for the node. By using the pseudo random function and the elliptic curve digital signature algorithm, we establish the pairwise keys decentralized completely and solve the new node joining problem. Analysis shows that neighbor-list based pairwise key management scheme is energy efficient.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wang, Y., Attebury, G., Ramamurthy, B.: A Survey of Security Issues in Wireless Sensor Networks. IEEE Communications Surveys & Tutorials 8(2), 2–22 (2006)
Zhou, Y., Fang, Y., Zhang, Y.: Securing Wireless Sensor Networks: A Survey. IEEE Communications Surveys & Tutorials 10(3), 6–28 (2008)
Goldreich, O., Goldwasser, S., Micali, S.: How to Construct Random Functions. Journal of the ACM 33(4), 210–217 (1986)
Zhu, S., Setia, S., Jajodia, S.: LEAP: Efficient Security Mechanism for Large-Scale Distributed Sensor Networks. In: Proc. 10th ACM Conf. Computer and Commun. Security (CCS 2003), Washington, DC (October 2003)
Vanstone, S.: Responses to NIST’s Proposal. Communications of the ACM 35(July), 50–52 (1992)
Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, X., He, J., Wei, Q. (2009). Neighbor-List Based Pairwise Key Management Scheme in Wireless Sensor Networks. In: Liu, J., Wu, J., Yao, Y., Nishida, T. (eds) Active Media Technology. AMT 2009. Lecture Notes in Computer Science, vol 5820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04875-3_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-04875-3_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04874-6
Online ISBN: 978-3-642-04875-3
eBook Packages: Computer ScienceComputer Science (R0)