Abstract
Security schemes of pairwise key establishment, which enable sensors to communicate with each other securely, play a fundamental role in research on security issue in wireless sensor networks. A general framework for key predistribution is presented, based on the idea of Key Distribution Center and polynomial pool schemes. By utilizing nice properties of Hierarchical Hypercube model, a new security mechanism for key predistribution based on such model is also proposed. Theoretic analysis and experimental figures show that the new algorithm has better performance and provides higher possibilities for sensors to establish pairwise key, compared with previous related works.
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
Pottie, G., Kaiser, W.: Wireless Sensor Networks. Communications of the ACM 43, 51–58 (2000)
Estrin, D., Govindan, R., Heideman, J., Kumar, S.: Next century challenges: Scalable Coordination in Sensor Networks. In: Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, pp. 263–270 (1999)
Lin, Y., Wang, L.: A Distributed Data-Centric Hierarchical Routing Algorithm based on Location Information for Sensor Networks. Acta Electronica Sinica 32, 1801–1805 (2004)
Liu, D., Ning, P.: Efficient Distribution of Key Chain Commitments for Broadcast Authentication in Distributed Sensor Networks. In: Proceedings of the 10th Annual Network and Distributed System Security Symposium, pp. 263–276 (2003)
Perrig, A., Szewczyk, R., et al.: SPINS: Security Protocols for Sensor Networks. In: Proceedings of the 7th Annual International Conference on Mobile Computing and Networks (2001)
Karlof, C., Wangner, D.: Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures. In: Proceedings of 1st IEEE International Workshop on Sensor Networks Protocols and Application (2003)
Pietro, R.D., Mancini, L.V., Mei, A.: Random Key Assignment for Secure Wireless Sensor Networks. In: 2003 ACM Workshop on Security in Ad Hoc and Sensor Networks (2003)
Du, W., Deng, J., Han, Y.S., et al.: A Pairwise Key Predistribution Scheme for Wireless Sensor Networks. In: Proceedings of 10th ACM Conference on Computer and Communication Security, pp. 42–51 (2003)
Eeschnaure, L., Gligor, V.D.: A Key-management Scheme for Distributed Sensor Networks. In: Proceedings of the 9th ACM Coference on Computer and Communication Security, pp. 41–47 (2002)
Chan, H., Oerrig, A., Song, D.: Random Key Predistribution Schemes for Sensor Networks. In: IEEE Syposium on Research in Security and Privacy, pp. 197–213 (2003)
Liu, D., Ning, P., Li, R.: Establishing Pairwise Keys in Distributed Sensor Networks. ACM Journal Name 20, 1–35 (2004)
Blundo, C., Desantis, A., Kutten, S., et al.: Perfectly Secure Key Distribution for Dynamic Conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)
Wang, L., Lin, Y.: Maximum Safety-Path Matrices based Fault-Tolerant Routing for Hypercube Multi-Computers. Journal of Software 15, 994–1004 (2004)
Wang, L., Lin, Y.: A Fault-Tolerant Routing Strategy Based on Maximum Safety-Path Vectors for Hypercube Multi-Computers. Journal of China Institute of Communications 16, 130–137 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lei, W., Li, J., Yang, J.M., Lin, Y., Sun, J. (2006). Hierarchical Hypercube-Based Pairwise Key Establishment Schemes for Sensor Networks. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds) Advanced Web and Network Technologies, and Applications. APWeb 2006. Lecture Notes in Computer Science, vol 3842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11610496_24
Download citation
DOI: https://doi.org/10.1007/11610496_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31158-4
Online ISBN: 978-3-540-32435-5
eBook Packages: Computer ScienceComputer Science (R0)