Location-aware key management scheme for wireless sensor networks

Dijiang Huang, M. Mehta, D. Medhi, L. Harn
{"title":"Location-aware key management scheme for wireless sensor networks","authors":"Dijiang Huang, M. Mehta, D. Medhi, L. Harn","doi":"10.1145/1029102.1029110","DOIUrl":null,"url":null,"abstract":"Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several pairwise key schemes have been proposed for large distributed sensor networks. These schemes randomly select a set of keys from a key pool and install the keys in the memory of each sensor. After deployment, the sensors can set up keys by using the preinstalled keys. Due to lack of tamper-resistant hardware, the sensor networks are vulnerable to node capture attacks. The information gained from captured nodes can be used to compromise communication among uncompromised sensors. Du et al. [1], Liu and Ning [2] proposed to use the known deployment information to reduce the memory requirements and mitigate the consequences of node capture attack. Our analysis shows that the assumption of random capture of sensors is too <i>weak</i>. An <i>intelligent</i> attacker can selectively capture sensors to get more information with less efforts. In addition to selective node capture attack, all recent proposals are vulnerable to node fabrication attack, in which an attacker can fabricate new sensors by manipulating the compromised secret keys and then deploy the fabricated sensors into the sensor system. To counter these attacks, we propose a grid-group scheme which uses known deployment information. Unlike the pairwise key scheme using deployment information proposed by Du et al., we uniformly deploy sensors in a large area; instead of randomly distributing keys from a large key pool to each sensor, we systematically distribute secret keys to each sensor from a structured key pool. Our performance analysis shows that our scheme requires less number of keys preinstalled for each sensor and is resilient to selective node capture attack and node fabrication attack.","PeriodicalId":380051,"journal":{"name":"ACM Workshop on Security of ad hoc and Sensor Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"260","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Workshop on Security of ad hoc and Sensor Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1029102.1029110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 260

Abstract

Sensor networks are composed of a large number of low power sensor devices. For secure communication among sensors, secret keys must be established between them. Recently, several pairwise key schemes have been proposed for large distributed sensor networks. These schemes randomly select a set of keys from a key pool and install the keys in the memory of each sensor. After deployment, the sensors can set up keys by using the preinstalled keys. Due to lack of tamper-resistant hardware, the sensor networks are vulnerable to node capture attacks. The information gained from captured nodes can be used to compromise communication among uncompromised sensors. Du et al. [1], Liu and Ning [2] proposed to use the known deployment information to reduce the memory requirements and mitigate the consequences of node capture attack. Our analysis shows that the assumption of random capture of sensors is too weak. An intelligent attacker can selectively capture sensors to get more information with less efforts. In addition to selective node capture attack, all recent proposals are vulnerable to node fabrication attack, in which an attacker can fabricate new sensors by manipulating the compromised secret keys and then deploy the fabricated sensors into the sensor system. To counter these attacks, we propose a grid-group scheme which uses known deployment information. Unlike the pairwise key scheme using deployment information proposed by Du et al., we uniformly deploy sensors in a large area; instead of randomly distributing keys from a large key pool to each sensor, we systematically distribute secret keys to each sensor from a structured key pool. Our performance analysis shows that our scheme requires less number of keys preinstalled for each sensor and is resilient to selective node capture attack and node fabrication attack.
无线传感器网络的位置感知密钥管理方案
传感器网络是由大量的低功耗传感器器件组成的。为了保证传感器之间的安全通信,必须在传感器之间建立密钥。近年来,针对大型分布式传感器网络,提出了几种配对密钥方案。这些方案从密钥池中随机选择一组密钥,并将密钥安装在每个传感器的存储器中。部署完成后,传感器可以使用预安装的密钥设置密钥。由于缺乏防篡改硬件,传感器网络容易受到节点捕获攻击。从捕获节点获得的信息可用于破坏未受破坏的传感器之间的通信。Du et al. [1], Liu and Ning[2]提出利用已知的部署信息来降低内存需求,减轻节点捕获攻击的后果。我们的分析表明,传感器随机捕获的假设太弱。一个聪明的攻击者可以选择性地捕获传感器,以更少的努力获得更多的信息。除了选择性节点捕获攻击外,最近的所有提案都容易受到节点制造攻击,攻击者可以通过操纵泄露的密钥来制造新的传感器,然后将制造的传感器部署到传感器系统中。为了对抗这些攻击,我们提出了一个使用已知部署信息的网格组方案。与Du等人提出的使用部署信息的成对密钥方案不同,我们在大面积内均匀部署传感器;我们不是从一个大的密钥池中随机分配密钥给每个传感器,而是从一个结构化的密钥池中系统地分配密钥给每个传感器。我们的性能分析表明,我们的方案需要为每个传感器预安装较少数量的密钥,并且能够抵御选择性节点捕获攻击和节点制造攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信