A high performance and intrinsically secure key establishment protocol for wireless sensor networks

被引:18
作者
Fanian, Ali [1 ]
Berenjkoub, Mehdi [1 ,3 ]
Saidi, Hossein [1 ]
Gulliver, T. Aaron [2 ]
机构
[1] IUT, Dept Elect & Comp Engn, Esfahan, Iran
[2] Univ Victoria, Dept Elect & Comp Engn, Victoria, BC, Canada
[3] IUT, Res Grp Secur Networks & Syst, Esfahan, Iran
关键词
Wireless sensor networks; Key management; Network security; Random key pre-distribution; Symmetric polynomials; Deployment knowledge; SCHEME;
D O I
10.1016/j.comnet.2011.01.016
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Key establishment among neighboring sensors is the most challenging issue for security services such as authentication and confidentiality in wireless sensor networks (WSNs). Many key establishment schemes have recently been proposed, but most have security or performance issues. In this paper, we propose a novel key establishment protocol which is suitable for low resource sensor nodes. In this protocol, each sensor has a secret key and some common keys with other sensors. A common key between two sensors is generated using the secret of one sensor and the identity of the other. This key is stored in one of the sensors, and the other sensor generates it when a secure connection is required. We develop the proposed protocol for different key distribution models. These models use pre-deployment knowledge to distribute the common keys among sensors. The proposed scheme is analyzed based on connectivity, scalability, memory consumption and resistance against attacks. In comparison with previous approaches, the proposed protocol is the most resilient against compromised node attacks. In addition, it has low memory requirements and low computational overhead. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:1849 / 1863
页数:15
相关论文
共 32 条
  • [1] A survey on sensor networks
    Akyildiz, IF
    Su, WL
    Sankarasubramaniam, Y
    Cayirci, E
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (08) : 102 - 114
  • [2] [Anonymous], 1995, Grad. Texts in Math.
  • [3] [Anonymous], P ACM INT C MOB COMP
  • [4] [Anonymous], 2004, P 2 ACM WORKSH SEC A, DOI [10.1145/1029102.1029111, DOI 10.1145/1029102.1029111]
  • [5] [Anonymous], 2003, Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, DOI [10.1145/986858.986869, DOI 10.1145/986858.986869]
  • [6] BLOM R, 1985, LECT NOTES COMPUT SC, V209, P335
  • [7] Distributed target classification and tracking in sensor networks
    Brooks, RR
    Ramanathan, P
    Sayeed, AM
    [J]. PROCEEDINGS OF THE IEEE, 2003, 91 (08) : 1163 - 1171
  • [8] Bunimov V., 2004, EMBEDDED CRYPTOGRAPH
  • [9] Chan HW, 2005, IEEE INFOCOM SER, P524
  • [10] Random key predistribution schemes for sensor networks
    Chan, HW
    Perrig, A
    Song, D
    [J]. 2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, : 197 - 213