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

路网环境下基于双锚点的位置隐私保护方法
引用本文:周宇航,柳毅. 路网环境下基于双锚点的位置隐私保护方法[J]. 计算机应用研究, 2020, 37(11): 3392-3395,3400
作者姓名:周宇航  柳毅
作者单位:广东工业大学 计算机学院,广州510006;广东工业大学 计算机学院,广州510006
摘    要:针对SpaceTwice方案中查询结果分布不均衡的缺陷,通过结合路网环境提出一种基于双锚点的位置隐私保护方法。该方法采用分布式系统结构,摆脱了可信第三方的性能瓶颈,用户可根据自身的隐私需求构建匿名区,并以锚点作为查询点进行基于双锚点的增量近邻查询,使查询结果分布更均衡,提高查询准确率。通过在不同路网环境下对该方法进行大量实验结果表明,该方法在保证查询准确率的同时提高了查询效率。

关 键 词:k-匿名  锚点  路网环境  基于双锚点的增量近邻查询
收稿时间:2019-07-11
修稿时间:2020-09-26

Location privacy protection method based on double anchor point in road network environment
Zhou Yuhang and Liu Yi. Location privacy protection method based on double anchor point in road network environment[J]. Application Research of Computers, 2020, 37(11): 3392-3395,3400
Authors:Zhou Yuhang and Liu Yi
Affiliation:School of Computer Science and Technology,Guangdong University of Technology,
Abstract:Aiming at the disadvantage that the query result was unbalanced distributed in the SpaceTwice scheme, this paper proposed a location privacy protection method based on double anchor points in combination with the road network environment. The method used distributed system structure and got rid of the performance bottleneck of the trusted third party. The users could construct an anonymous area according to their privacy requirements, and used the anchor point as a query point to perform incremental neighbor query based on double anchor point, which could make the distribution of query results more balanced and improve query accuracy. Through a large number of experiments on this method under different road network environments, the experimental results show that this method can improve the query efficiency while improving the accuracy of the query.
Keywords:k-anonymous   anchor point   road network environment   incremental nearest neighbor query based on double anchor point
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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