首页 | 本学科首页   官方微博 | 高级检索  
     

面向隐私保护的两层传感网Top-k查询处理方法
引用本文:戴 华, 杨 庚, 秦小麟, 刘 亮. 面向隐私保护的两层传感网Top-k查询处理方法[J]. 计算机研究与发展, 2013, 50(6): 1239-1252.
作者姓名:戴华  杨庚  秦小麟  刘亮
作者单位:1. 南京邮电大学计算机学院 南京210013;宽带无线通信与传感网技术教育部重点实验室(南京邮电大学) 南京 210013
2. 南京航空航天大学计算机科学与技术学院 南京 210016
基金项目:国家"九七三"重点基础研究发展计划基金项目,国家自然科学基金项目,江苏省高校自然科学研究重大项目,高等学校博士学科点专项科研基金项目,江苏高校优势学科建设工程资助项目,南京邮电大学引进人才科研启动基金项目
摘    要:无线传感器网络中的隐私保护技术已经成为研究热点,其中具有隐私保护能力的Top-k查询已经成为富有挑战性的研究问题.提出了一种基于前缀编码验证(PMV)机制的两层传感器网络隐私保护Top-k查询处理方法.通过引入PMV机制,并利用加密和Hash消息身份验证编码技术,使感知节点对采集到的数据进行加密和编码处理,并上传至存储节点;存储节点利用PMV机制实现在无需感知数据明文参与下的数值线性关系比较,进而计算包含查询结果的最小候选密文数据集,并发送给Sink节点;最终由Sink解密密文数据,完成Top-k查询结果计算.为了降低感知节点能耗,给出基于Hash技术的能量优化策略.理论分析和实验结果表明,该方法能够确保数据的隐私安全性,且性能表现优于现有工作.

关 键 词:两层传感器网络  隐私保护  Top-k查询  前缀编码验证  对称加密  Hash消息身份验证编码

Privacy-Preserving Top-k Query Processing in Two-Tiered Wireless Sensor Networks
Dai Hua, Yang Geng, Qin Xiaolin, Liu Liang. Privacy-Preserving Top-k Query Processing in Two-Tiered Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2013, 50(6): 1239-1252.
Authors:Dai Hua    Yang Geng    Qin Xiaolin    Liu Liang
Affiliation:1(College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210013) 2(Key Laboratory of Broadband Wireless Communication & Sensor Network Technology (Nanjing University of Posts and Telecommunications), Ministry of Education, Nanjing 210013) 3(College of Computer Science & Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016)
Abstract:Privacy preservation in wireless sensor networks has attracted more and more attentions recently. Computing top-k query result while preserving data privacy is a challenge in wireless sensor networks. This paper proposes a prefix membership verification (PMV) based privacy-preserving top-k query processing in two-tiered wireless sensor networks, which is denoted as PPTQ. In PPTQ, each sensor node in the query aera firstly converts its collected data into encoded ones by using prefix encoding and hashed message authentication encoding mechanism, and encrypts all the collected data items, then submits the encoded data and the ciphertext to the corresponding storage node. According to the numerical comparison theory of PMV, the minimum candidate ciphertext sets containing the query result will be generated by the covered storage nodes, without knowing the actual values of the collected data items. Then, the storage nodes send the candidate ciphertext to sink, and the final top-k result will be computed by sink after decryption. To reduce the power consumption of sensor nodes, an energy optimization method based on a Hash function is proposed. The theoretical analysis and experimental results show that the PPTQ can ensure the privacy of the collected data and the query result, and it has better performance than the current work in query processing.
Keywords:two-tiered wireless sensor networks  privacy-preserving  top-k query  prefix membership verification  symmetric encryption  Hashed message authentication code
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机研究与发展》浏览原始摘要信息
点击此处可从《计算机研究与发展》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号