两层传感器网络中面向隐私保护的安全Top-k查询技术研究

项目名称： 两层传感器网络中面向隐私保护的安全Top-k查询技术研究

项目编号： No.61300240

项目类型： 青年科学基金项目

立项/批准年度： 2014

项目学科： 自动化技术、计算机技术

项目作者： 戴华

作者单位： 南京邮电大学

项目金额： 23万元

中文摘要： 随着传感器网络技术的发展，隐私保护已成为该领域具有普遍性要求的热点问题。两层传感器网络是一种结构简单、易扩展的新型网络，是传感器网络的一个重要发展方向。Top-k查询是传感器网络进行事件监测和数据分析重要手段之一。数据的秘密比较是实现面向隐私保护的安全Top-k查询必需解决的首要难题，而适用于两层传感器网络的秘密比较机制尚处于研究空白，导致现有安全Top-k查询技术无法解决数据的隐私保护问题。基于此，本课题首先研究基于0-1编码的两层传感器网络秘密比较机制，并在此基础上，研究基于秘密比较的隐私保护Top-k查询方法和基于密文约束链的查询结果一致性验证技术，以解决数据隐私泄露和数据篡改、伪造等攻击造成的查询结果不一致的可验证性问题；为提高网络生命周期，研究基于Bloom过滤器和0-1编码随机选择的Top-k查询优化方法，为传感器网络安全数据查询领域的发展和应用提供理论基础与技术支撑。

中文关键词： 两层传感器网络；查询处理；隐私保护；一致性验证；查询优化

英文摘要： With the development of wireless sensor networks, privacy-preserving has become the hot issues in the field of universal requirement. The two-tiered wireless sensor networks is a new kind of sensor networks with the advantages of simple structure, easy to expand et al, and it is becoming an important direction of the wireless sensor networks. Top-k query is one of the important operations of events monitoring and data analysis in wireless sensor networks. Secret comparison is the key problem to achieve the privacy-preserving oriented secure top-k query in two-tiered wireless sensor networks, the research of which is still in its infancy. Therefore, the existing work of such secure top-k query can not protect the privacy from attackers. Aiming at the two-tiered sensor networks environments, this project mainly focuses on systematic solutions of privacy-reserving oriented secure top-k query processing. Several methods will be investigated, such as 0-1 encoding base secret comparison, privacy-preserving top-k query, query result integrity verification, and Bloom filter and 0-1 encode random selection based top-k query optimization methods for prolonging the lifetime of networks. The research of this project would provide a theoretical basis and technical support for the development and application of secure data qu

英文关键词： Two-tired wireless sensor network；Query processing；Privacy preserving；Integrity verification；Query optimization