• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Probabilistic Key Predistribution in Mobile Networks Resilient to Node-Capture Attacks
【24h】

Probabilistic Key Predistribution in Mobile Networks Resilient to Node-Capture Attacks

机译：具有抗节点捕获攻击能力的移动网络中的概率密钥预分配

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We present a comprehensive analysis on connectivity and resilience of secure sensor networks under the widely studied q-composite key predistribution scheme. For network connectivity, which ensures that any two sensors can find a path in between for secure communication, we derive the conditions to guarantee connectivity in consideration of: 1) node-capture attacks, where the adversary may capture a set of sensors and compromise keys in their memory; 2) sensor mobility, meaning that sensors can move around so that the network topology may change over time; 3) physical transmission constraints, under which two sensors have to be within each other's transmission range for communication; 4) the boundary effect of network fields; and 5) link unreliability, meaning that links are allowed to be unreliable. In contrast, many prior connectivity analyses of secure sensor networks often ignore the above issues. For resilience, although limited studies have presented formal analysis, it is often assumed that the adversary captures a random set of sensors, whereas this paper allows the adversary to capture an arbitrary set of sensors. We present conditions to ensure unassailability and unsplittability in secure sensor networks under the q-composite scheme. Unassailability ensures that an adversary capturing any set consisting of a negligible fraction of sensors can compromise only a negligible fraction of communication links although the adversary may compromise communications between non-captured nodes, which happen to use keys that are shared by captured nodes. Unsplittability means that when a negligible fraction of sensors are captured, almost all of the remaining nodes are still securely connected. Based on the results of connectivity, unassailability, and unsplittability, we provide useful guidelines for the design of secure sensor networks.
机译：我们在广泛研究的q-复合密钥预分配方案下，对安全传感器网络的连通性和弹性进行全面分析。对于确保任何两个传感器都能在两者之间找到路径进行安全通信的网络连接性，我们考虑以下因素来得出保证连接性的条件：1）节点捕获攻击，其中攻击者可能捕获一组传感器并破坏密钥在他们的记忆中； 2）传感器移动性，意味着传感器可以移动，因此网络拓扑可能随时间变化； 3）物理传输约束，在这种约束下，两个传感器必须在彼此的传输范围内才能进行通信； 4）网络领域的边界效应； 5）链接不可靠，这意味着允许链接不可靠。相反，许多先前对安全传感器网络的连接性分析经常忽略上述问题。对于复原力，尽管有限的研究提供了形式分析，但通常假定对手捕获了随机的一组传感器，而本文允许对手捕获任意的一组传感器。我们提出了条件，以确保在q组合方案下安全传感器网络中的无懈可击和不可分裂性。无敌能力确保捕获任何由微不足道的传感器组成的集合的对手只会损害通信链路的微不足道的部分，尽管对手可能会损害未捕获节点之间的通信，而后者恰好使用了捕获节点共享的密钥。不可分割性意味着，当捕获到一小部分传感器时，几乎所有剩余的节点仍然牢固连接。基于连通性，无懈可击和不可分割的结果，我们为安全传感器网络的设计提供了有用的指导。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号