位置:成果数据库 > 期刊 > 期刊详情页
面向双层传感网的隐私保护k-NN查询处理协议
  • ISSN号:0254-4164
  • 期刊名称:《计算机学报》
  • 时间:0
  • 分类:TP301[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]中国人民大学数据工程与知识工程教育部重点实验室,北京100872, [2]中国人民大学信息学院,北京100872
  • 相关基金:国家“九七三”重点基础研究发展规划项目基金(2014CB340402,2012CB316205)、国家“八六三”高技术研究发展计划项目基金(2014AA015204)、国家自然科学基金(61532021,61272137,61202114)资助.
中文摘要:

无线传感器网络作为物联网感知层的核心组成部分,具有广阔的应用前景.然而,隐私泄露问题严重阻碍了传感器网络的发展.目前,传感器网络隐私保护技术已成为研究热点,其中隐私保护κ-NN(κ-Nearest Neighbor)查询协议是富有挑战性的问题.文中提出了面向双层传感器网络的高效的隐私保护κ-NN查询协议.首先,为提升查询效率,基于定向存储策略给出了适用于双层传感网的κ-NN查询架构.其次,针对管理节点俘获攻击,提出了一种新颖的隐私保护数据编码机制,通过为真实数据附加编码的方式,保证在不泄露数据隐私的同时精确地完成查询处理.再次,针对节点共谋攻击,设计了基于代理节点的单向数据隐藏机制,通过破坏普通节点与管理节点间数据的关联性实现抵御共谋攻击的目标.理论分析和仿真实验验证了协议的安全性和有效性.

英文摘要:

As an important part of Internet of Things (IoTs ), Wireless Sensor Networks (WSNs)can be widely deployed in many physical environments for data collection and monitoring,such as oceans,volcanoes,animal habitats and battlefields.In these applications of WSNs,k Nearest Neighbors (k-NN)query which returns the nearest k objects of the given query location or value is very important for users to get the required information of monitoring areas.In consideration of the built-in resource limitation problems of single tier sensor networks,k-NN query can be more efficient in two tiered WSNs which contain a large number of resource constrained sensor nodes and fewer resource rich management nodes.However,relying on management nodes for data storage and query processing raises significant security concerns.Frequently,the deployment environments of WSNs are hostile and unpredictable,which threaten the data security and privacy.What is worse,the open nature of wireless communication makes it easy for adversaries to eavesdrop data packets or compromise nodes of sensor networks.Management nodes are more vulnerable to be compromised as they store massive data and serve as an important role for responding queries. The compromised management nodes bring serious security risks to the network and significantly restrict the development of two tiered WSNs.Therefore,in recent years,privacy preservation in two tiered WSNs has attracted more and more attention.Accurately answer k-NN query while preserving data privacy is a challenging problem.This paper presents an efficient privacy-preserving k-NN query protocol for two tiered WSNs.To the best of our knowledge,this paper is the first to consider collusion attacks for a value-based k-NN query in two tiered WSNs while fulfilling the preservation of privacy.To improve query efficiency,the architecture of k-NN query is proposed based on the directional storage strategy for two tiered WSNs.To resist management nodes compromising attacks,this paper proposes a novel privacy-preserv

同期刊论文项目
同项目期刊论文
期刊信息
  • 《计算机学报》
  • 北大核心期刊(2011版)
  • 主管单位:中国科学院
  • 主办单位:中国计算机学会 中国科学院计算技术研究所
  • 主编:孙凝晖
  • 地址:北京中关村科学院南路6号
  • 邮编:100190
  • 邮箱:cjc@ict.ac.cn
  • 电话:010-62620695
  • 国际标准刊号:ISSN:0254-4164
  • 国内统一刊号:ISSN:11-1826/TP
  • 邮发代号:2-833
  • 获奖情况:
  • 中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 美国数学评论(网络版),荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:48433