计算机科学
差别隐私
数据发布
弹道
可扩展性
树(集合论)
跳跃式监视
序列(生物学)
噪音(视频)
出版
数据挖掘
计算机安全
算法
数据库
人工智能
数学
生物
图像(数学)
物理
遗传学
数学分析
法学
政治学
天文
作者
Xiaodong Zhao,Yulan Dong,Dechang Pi
标识
DOI:10.1016/j.eswa.2019.07.008
摘要
The existing location-based services have collected a large amount of user trajectory data, and if these data are directly released without any processing, the user's personal privacy will be leaked. At present, differential privacy protection technology is favored by many scholars, but how to apply it reasonably to location-based services is also a challenge for us. Trajectory is spatiotemporal continuous, but most existing methods only consider the single location of moving objects at a certain time without considering the entire trajectory, which may destroy the spatiotemporal integrity of the trajectory. In this paper, we address this problem and firstly propose a Sequence R (SR)-tree structure that satisfies the differential privacy based on the R-tree, and we construct the SR-Tree by using the trajectory sequence instead of the minimum bounding rectangle of the R-tree. Then we put forward an attack model called non-location sensitive information attack, in order to resist this attack, we add noise into the location data and non-location sensitive data using differential privacy techniques. Finally, the Algorithm can be consistently dealt with the problem of data inconsistency after adding noise. Experimental results show that our Algorithm not only has high data availability, operational efficiency, but also has good scalability.
科研通智能强力驱动
Strongly Powered by AbleSci AI