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

满足本地化差分隐私的众包位置数据采集
引用本文:霍峥,张坤,贺萍,武彦斌. 满足本地化差分隐私的众包位置数据采集[J]. 计算机应用, 2019, 39(3): 763-768. DOI: 10.11772/j.issn.1001-9081.2018071541
作者姓名:霍峥  张坤  贺萍  武彦斌
作者单位:河北经贸大学 信息技术学院,石家庄,050061;河北科技大学 信息科学与工程学院,石家庄,050081;河北经贸大学 管理科学与工程学院,石家庄,050061
基金项目:国家自然科学基金资助项目(61502279);河北省自然科学基金资助项目(F2018210109);河北省高等学校科学研究项目(ZD2018205,QN2018116)。
摘    要:针对位置数据众包采集中个人位置隐私泄露的问题,提出了一种满足本地化差分隐私的位置数据众包采集方法。首先,使用逐点插入法构造维诺图,对路网空间进行分割;然后,采用满足本地化差分隐私的随机扰动的方式对每个维诺格中的位置数据进行扰动;再次,设计了一种在扰动数据集上进行空间范围查询的方法,获得对真实结果的无偏估计;最后,在空间范围查询下进行了实验验证,并与保护隐私的轨迹数据采集(PTDC)算法进行了对比,算法查询误差率最坏不超过40%,最好情况在20%以下,运行时间在8 s以内,在隐私保护度高于PTDC算法的前提下,上述参数优于PTDC算法。

关 键 词:本地化差分隐私  道路网络  维诺格  位置数据  移动对象
收稿时间:2018-07-23
修稿时间:2018-09-11

Crowdsourcing location data collection for local differential privacy
HUO Zheng,ZHANG Kun,HE Ping,WU Yanbin. Crowdsourcing location data collection for local differential privacy[J]. Journal of Computer Applications, 2019, 39(3): 763-768. DOI: 10.11772/j.issn.1001-9081.2018071541
Authors:HUO Zheng  ZHANG Kun  HE Ping  WU Yanbin
Affiliation:1. School of Information Technology, Hebei University of Economics and Business, Shijiazhuang Hebei 050061, China;2. School of Information Science and Engineering, Hebei University of Science and Technology, Shijiazhuang Hebei 050081, China;3. School of Management Science and Engineering, Hebei University of Economics and Business, Shijiazhuang Hebei 050061, China
Abstract:To solve the problem of privacy leakage in crowdsourced location data collection, a locally differentially private location data collection method with crowdsourcing was proposed. Firstly, a Voronoi diagram constructed by point-by-point insertion method was used to partition the road network space. Secondly, a random disturbance satisfying local differential privacy was used to disturb the original location data in each Voronoi grid. Thirdly, a designed spatial range query method was applied to noisy datasets to get the unbiased estimation of the actual result. Finally, experiments were carried out on spatial range queries to compare the proposed algorithm with PTDC (Privacy-preserving Trajectory Data Collection) algorithm. The results show that the query error rate is no more than 40%, and less than 20%in the best situation, and the running time is less than 8 seconds, which are better than those of PTDC algorithm while the proposed method has a higher degree of privacy preserving.
Keywords:local differential privacy   road network   Voronoi grid   location data   moving object
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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