首页> 外文会议>Information Assurance Workshop, 2005. IAW '05. Proceedings from the Sixth Annual IEEE SMC >Replication attack on random key pre-distribution schemes for wireless sensor networks
【24h】

Replication attack on random key pre-distribution schemes for wireless sensor networks

机译:无线传感器网络随机密钥预分配方案的复制攻击

获取原文

摘要

When setting up a sensor network, one of the first requirements is to establish cryptographic keys for later use. However, the traditional key establishment techniques cannot be directly applied due to the inherent properties of sensor networks. Recently, a promising methodology, random key pre-distribution schemes based on symmetric cryptography, has been proposed. In this paper, the authors studied the problem of replication attack on random key pre-distribution schemes. Using a combination of modeling, analysis, and experiments, the relationship among the replicated hostile nodes, the sensor networks, and the resiliency of various random key pre-distribution schemes were analyzed, characterized, and discussed against replication attack. Example findings include: (1) the sensor networks with random key pre-distribution schemes, even with one replicated sensor, start to become almost 100% insecure when the adversary captures and stores the key information equivalent to those carried by one good sensor node; and (2) among the proposed schemes, the q-composite scheme with larger q is most resilient against replication attack while the basic scheme is least resilient and the Blom-based scheme lies in between the above two schemes when the replicated node has less memory to store key information than the original node. Interestingly, it is the other way round when the replicated node has more memory to store key information than the original node. Moreover, as a transition, the resilience against replication attack is the same for all the random schemes when the replicated and original nodes have the same memory to store key information. This study does not only provide practical insights into the design of more secure and efficient key establishment schemes allowing simple key establishment for large-scale sensor networks but can also be used to accurately predict the payoff that an adversary can gain after injecting a certain number of nodes into the sensor networks.
机译:设置传感器网络时,首要要求之一是建立加密密钥以备后用。然而,由于传感器网络的固有特性,传统的密钥建立技术不能直接应用。最近,已经提出了一种有前途的方法,即基于对称密码的随机密钥预分配方案。在本文中,作者研究了随机密钥预分配方案的复制攻击问题。结合建模,分析和实验,对复制的敌对节点,传感器网络之间的关系以及各种随机密钥预分配方案的弹性进行了分析,表征和讨论,以防复制攻击。示例发现包括:(1)即使对手使用了一个预先复制的传感器网络,即使有一个复制的传感器,当对手捕获并存储与一个好传感器节点所携带的信息相同的密钥信息时,它们也开始几乎100%不安全; (2)在建议的方案中,当复制节点的内存较少时,q较大的q组合方案对复制攻击的抵抗力最大,而基本方案的抵抗力最差,并且基于Blom的方案位于上述两种方案之间比原始节点存储密钥信息。有趣的是,当复制的节点比原始节点有更多的内存来存储密钥信息时,这是另一回事。此外,作为过渡,当复制节点和原始节点具有相同的存储器来存储密钥信息时,所有随机方案的复制攻击抵抗力都是相同的。这项研究不仅可以为更安全,更高效的密钥建立方案的设计提供实践见解,从而可以为大型传感器网络建立简单的密钥,而且还可以用于准确预测对手注入一定数量的密钥后可以获得的收益。节点进入传感器网络。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号