保护隐私的无线传感器网络跳距计算协议
首发时间:2011-01-26
摘要:如何保护节点的位置隐私是无线传感器网络安全研究的一个关键问题,具有重要的研究意义。本文介绍了一个数据层的位置隐私保护问题--保护隐私的无线传感器网络跳距计算问题,即攻击者将自己伪装为合法的节点,通过参与计算网络的平均跳距来窃取其它节点的位置信息。已有的工作主要集中于路由层的位置隐私保护问题,因而其无法解决数据层的位置隐私保护问题。本文则提出了一个保护隐私的跳距计算(PPHC)协议来解决这一问题。该协议利用安全多方计算领域中的数据伪装技术来保护每个节点的位置隐私信息。而且我们还严格地证明了协议的正确性和安全性。该协议的主要优点在于它不要求额外的可信第三方,也不需要复杂的加密操作,因而相对于传统的基于可信第三方和加密操作的解决方案来说具有更好的性能。性能分析表明,该协议的计算复杂性为O(1),而通信复杂度也仅为两轮的数据传输。
For information in English, please click here
Privacy Preserving Hop-distance Computation in Wireless Sensor Networks
Abstract:How to protect the location privacy is an important security issue in wireless sensor network. In this paper, we introduce a data-level location privacy problem, i.e., the privacy preserving hop-distance computation problem. In this problem, the attackers pretend themselves as legal nodes, and try to eavesdrop the location of other nodes during the process of computing the average hop-distance of the network. Previous works mainly focus on the routing-level location privacy problems so they cannot cope with such a data-level location privacy problem. In this paper, we propose a privacy preserving hop-distance computation (PPHC) protocol to solve this problem. In this protocol, we successfully apply the data disguise techniques in the secure multi-party computation field to protect the location privacy of each participant. Moreover, we rigorously prove the correctness and security of this protocol. The most advantage of this protocol is that it does not require any trusted third-party or encryption operations, and thus has a much better performance than the traditional solution generally based on a trusted third-party and encryption operations. The performance analysis shows that the computational overhead of this protocol is only O(1), and the communication overhead is dominated by two rounds of message delivery.
Keywords: Wireless Sensor Networks Location Privacy Secure Multi-party Computation Data Disguise
论文图表:
引用
No.4407683199822129****
同行评议
勘误表
保护隐私的无线传感器网络跳距计算协议
评论
全部评论0/1000