Storage-Optimal key sharing with authentication in sensor networks

Authors:
Jian Wang;Z. Y. Xia;Lein Harn;Guihai Chen
Affiliations:
Nanjing University of Aeronautics and Astronautics, China;Nanjing University of Aeronautics and Astronautics, China;University of Missouri, Kansas City;State Key Lab of Novel Software Technology, Nanjing University, China
Venue:
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 6
Cited 0

Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Smart Dust: Communicating with a Cubic-Millimeter Computer

Computer
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Combinatorial Optimization of Group Key Management

Journal of Network and Systems Management
Security in wireless sensor networks

Communications of the ACM - Wireless sensor networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

Wireless Sensor Networks are edging closer to widespread feasibility with recent research showing promising results in developing and adapting new mechanisms to suit their environment. Secure communication between these distributed wireless devices is a desired characteristic, especially in scenarios where these sensors will be exploited for military and other mission-critical operations. This paper highlights some of the research challenges for extending secure communications over these resource-constrained devices and points out why current protocols do not scale well in this unique application realm. Then, a storage-optimal key sharing scheme with authentication is proposed in this paper. This scheme requires each sensor node to hold one secret key and hash functions only, and is optimal in terms of memory consumption which is more rigorous constraint factor than computation and communication resources limit.