Key Infection, Secrecy Transfer, and Key Evolution for Sensor Networks

被引:8
作者
Liu, Zhihong [1 ]
Ma, Jianfeng [1 ]
Pei, Qingqi [1 ]
Pang, Liaojun [2 ]
Park, YoungHo [3 ]
机构
[1] Xidian Univ, Minist Educ, Key Lab Comp Networks & Informat Secur, Xian, Peoples R China
[2] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China
[3] Kyungpook Natl Univ, Sch Elect Engn, Seoul, South Korea
基金
国家高技术研究发展计划(863计划); 中国国家自然科学基金;
关键词
Key evolution; key infection; secrecy transfer; sensor network; SECURITY; PREDISTRIBUTION; SCHEMES;
D O I
10.1109/TWC.2010.061410.100084
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys are required to be established between them. Considering the strict resource constraints of sensors, key infection has been proposed by Anderson, Chan, and Perrig. However, because the communication keys are broadcasted in plaintext in key infection, some of them may be eavesdropped by an adversary. To address this security issue, secrecy transfer is presented, which utilizes pre-loaded secret keying material to enhance the security performance of key infection. To thwart ongoing cryptanalytic attacks, a key evolution scheme is proposed to continuously refresh shared keys. Key evolution forces the adversary to keep monitoring traffic all the time after compromising a key; even if the adversary has compromised a key, it cannot catch up with the key evolution process, and may lose control of the compromised key quickly in a noisy communication environment. Analysis results show that key infection, secrecy transfer, and key evolution present viable trade-offs between security and resource consumption for smart dust sensor networks.
引用
收藏
页码:2643 / 2653
页数:11
相关论文
共 23 条
[1]  
ANDERSON R, 2004, P ICNP 04 BERL GERM, P24
[2]  
[Anonymous], 2002, P 9 ACM C COMPUT COM, DOI DOI 10.1145/586110.586117
[3]  
[Anonymous], 2003, Proceedings of the 10th ACM conference on Computer and communications security
[4]  
[Anonymous], 2001, RANDOM GRAPHS
[5]  
Blackburn SR, 2008, LECT NOTES COMPUT SC, V5155, P156
[6]   Random key predistribution schemes for sensor networks [J].
Chan, HW ;
Perrig, A ;
Song, D .
2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, :197-213
[7]   Sensor Network Security: A Survey [J].
Chen, Xiangqian ;
Makki, Kia ;
Yen, Kang ;
Pissinou, Niki .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2009, 11 (02) :52-73
[8]  
CROFTON MW, 1855, ENCYCLPADIA BRITANNI, V19, P769
[9]   Smart Dust Security - Key Infection Revisited [J].
Cvrcek, Daniel ;
Svenda, Petr .
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 157 (03) :11-25
[10]  
Du WL, 2004, IEEE INFOCOM SER, P586