Protecting sensitive place visits in privacy-preserving trajectory publishing

被引:15
作者
Wang, Nana [1 ]
Kankanhalli, Mohan S. [2 ]
机构
[1] Jiangsu Normal Univ, Sch Comp Sci & Technol, 101 Shanghai Rd, Xuzhou 221116, Jiangsu, Peoples R China
[2] Natl Univ Singapore, Sch Comp, 13 Comp Dr, Singapore 117417, Singapore
基金
新加坡国家研究基金会; 中国国家自然科学基金;
关键词
Privacy-preserving data publishing; Sensitive place; Sensitive zone; Differential privacy; Trajectory data; ANONYMITY;
D O I
10.1016/j.cose.2020.101949
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The rise of mobile computing has generated huge amount of trajectory data. Since these data are valuable for many people, publishing them while providing adequate individual privacy protection has been a challenging task. In this paper, we present an algorithm for protecting sensitive place visits in privacy preserving trajectory publishing. By generalizing sensitive places using sensitive zones, and distorting the sub-trajectories within the sensitive zones based on differential privacy, our method not only prevents leakage of sensitive place visits, but also preserves individual movement information. It contains two critical components. First, we generate sensitive zones around sensitive places based on human mobility patterns and the mobility model. The sensitive zones are formed in such a way that the adversary background knowledge does not increase the adversary's belief in whether the trajectory has stopped at a sensitive place or not. Second, to prevent excessive individual movement information loss and sensitive place visit leakage within the sensitive zones, we select reliable segments from the sub-trajectories therein, model the reliable segments as an exploration tree, and synthesize the e- differentially-private sub-trajectories. Our experiments on a real-world dataset show that our method provides good utility, and our sub-trajectory synthesis method preserves detailed information of individual movements. (c) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:17
相关论文
共 59 条
[1]   Anonymization of moving objects databases by clustering and perturbation [J].
Abul, Osman ;
Bonchi, Francesco ;
Nanni, Mirco .
INFORMATION SYSTEMS, 2010, 35 (08) :884-910
[2]   Never Walk Alone:: Uncertainty for anonymity in moving objects databases [J].
Abul, Osman ;
Bonchi, Francesco ;
Nanni, Mirco .
2008 IEEE 24TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, VOLS 1-3, 2008, :376-+
[3]   SafePath: Differentially-private publishing of passenger trajectories in transportation systems [J].
Al-Hussaeni, Khalil ;
Fung, Benjamin C. M. ;
Iqbal, Farkhund ;
Dagher, Gaby G. ;
Park, Eun G. .
COMPUTER NETWORKS, 2018, 143 :126-139
[4]  
Andres M. E., 2013, ACM CCS, P901
[5]  
[Anonymous], 2010, IEEE Data Eng. Bull.
[6]   Inferring Road Maps from Global Positioning System Traces Survey and Comparative Evaluation [J].
Biagioni, James ;
Eriksson, Jakob .
TRANSPORTATION RESEARCH RECORD, 2012, (2291) :61-71
[7]   Plausible Deniability for Privacy-Preserving Data Synthesis [J].
Bindschaedler, Vincent ;
Shokri, Reza ;
Gunter, Carl A. .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2017, 10 (05) :481-492
[8]   A Two-Phase Algorithm for Mining Sequential Patterns with Differential Privacy [J].
Bonomi, Luca ;
Xiong, Li .
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, :269-278
[9]   Revealing Privacy Vulnerabilities of Anonymous Trajectories [J].
Chang, Shan ;
Li, Chao ;
Zhu, Hongzi ;
Lu, Ting ;
Li, Qiang .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (12) :12061-12071
[10]  
Chen R., 2012, P 18 ACM SIGKDD INT, P213, DOI DOI 10.1145/2339530.2339564