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

障碍空间中保持位置隐私的最近邻查询方法
引用本文:朱怀杰 王佳英 王 斌 杨晓春. 障碍空间中保持位置隐私的最近邻查询方法[J]. 计算机研究与发展, 2014, 51(1): 115-125.
作者姓名:朱怀杰  王佳英  王斌  杨晓春
作者单位:1.(东北大学信息科学与工程学院 沈阳 110819) (zhj_nu_88@139.com)
基金项目:国家“九七三”重点基础研究发展计划基金项目(2012CB316201);国家自然科学基金项目(61173031,61272178);国家自然科学基金海外及港澳学者合作基金项目(61129002);高等学校博士学科点专项科研基金项目(20110042110028);中央高校基本科研业务费专项基金项目(N110404015,N120504001)
摘    要:基于位置服务的隐私保护是近年来空间数据库领域研究的热点.然而,现有的位置隐私保护方法只支持简单的最近邻查询,没有考虑障碍物的空间.但是障碍物的空间在实际中是普遍存在的,因此,研究障碍空间中保持位置隐私的最近邻查询问题是有意义的,也是一个难点.针对这个问题,提出了一种基于第三方可靠服务器的方法.该方法能够保证用户在享受基于位置服务所提供的实际准确答案的同时,其位置信息不被泄露.该方法首先针对用户查询的准确位置,利用第三方可靠服务器来构造一个匿名的区域并发送给位置服务器,进行匿名区域的查询处理.在查询处理过程中,提供了两种查询处理方法:1)基于线段的最大障碍距离的查询处理方法(基本方法),即利用线段的最大障碍距离来扩展匿名区域,返回扩展后的区域内的结果;2)优化查询处理方法,即在基本方法的基础上,进行迭代优化,进一步缩小扩展区域.然后把匿名区域的查询处理的结果返回给第三可信方.最后,第三方可靠服务器根据用户的准确位置,把实际准确结果返回给用户.实验结果和理论表明了这两种查询处理方法的有效性和正确性.

关 键 词:障碍空间  最近邻查询  位置隐私  匿名区域  障碍距离

Location Privacy Preserving Obstructed Nearest Neighbor Queries
Zhu Huaijie, Wang Jiaying, Wang Bin, and Yang Xiaochun. Location Privacy Preserving Obstructed Nearest Neighbor Queries[J]. Journal of Computer Research and Development, 2014, 51(1): 115-125.
Authors:Zhu Huaijie  Wang Jiaying  Wang Bin  and Yang Xiaochun
Affiliation:1.(College of Information Science and Engineering, Northeastern University, Shenyang 110819)
Abstract:Location privacy has been a hot topic in recent years. However, the methods of existing location privacy preserving only support simple nearest neighbor queries, which do not consider the obstructed space. But in fact, the obstructed space is very popular in our life. Therefore, we study location privacy preserving obstructed nearest neighbor queries. Due to the effect of obstacles, this problem is also very hard. In this paper, we adopt a normal approach based on the third trusted party for privacy preserving obstructed nearest neighbor (ONN) queries. The approach can entertain the location-based service without leaking the user's exact location and obtain the exact answer. In our approach, firstly, the third trusted party constructs a cloaked region corresponding to the exact location and sends the cloaked region to the LBS. Then LBS processes the query region. In the process of query processing, we use two methods to return a set of candidate answers with respect to the cloaking region for the actual user location: 1)Basic approach of query processing, which uses the max obstructed distance of segment to expand the region and returning the results in the expanded region; 2)Improved approach of query processing, which further narrows the expanded region based on the basic approach. At last, the third trusted party returns the actual answer to the users corresponding to user's exact location .Finally, experimental results and proof theory show the effectiveness and correctness of our approach.
Keywords:obstructed space  nearest neighbor queries  location privacy  cloaked region  obstructed distance
本文献已被 CNKI 等数据库收录!
点击此处可从《计算机研究与发展》浏览原始摘要信息
点击此处可从《计算机研究与发展》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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