TY - JOUR
T1 - Privacy Preservation for Trajectory Publication Based on Differential Privacy
AU - Yao, Lin
AU - Chen, Zhenyu
AU - Hu, Haibo
AU - Wu, Guowei
AU - Wu, Bin
N1 - Funding Information:
This work is supported by the National Key R&D Program of China (Grant No. 2017YFC0704200). This research is also sponsored by the National Natural Science Foundation of China (Grant Nos. 61872053, 61572413, and U1636205) and Research Grants Council, Hong Kong SAR, China (Grant Nos. 15238116, 15222118, 15218919, and C1008-16G), the Open Project of the State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences (Grant No. 2020-ZD-04), the Key-Area Research and Development Program of Guangdong Province (Grant No. 2019B010136001); and the Science and Technology Planning Project of Guangdong Province (Grant No. LZC0023). Authors’ addresses: L. Yao, DUT-RU International School of Information Science & Engineering, Dalian University of Technology, Tuqiang Street 321, Dalian, Liaoning, China, 116621, Peng Cheng Laboratory, Cyberspace Security Research Center, Xingke First Street 2, Shenzhen, Guangdong, China, 518057; email: [email protected]; Z. Chen and G. Wu, School of Software, Dalian University of Technology, Tuqiang Street 321, Dalian, Liaoning, China, 116621; emails: [email protected], [email protected]; H. Hu, Department of Electronic and Information Engineering, The Hong Kong Polytechnic University, Yucai Road 11, Hong Kong, Hong Kong, China, 999077; email: [email protected]; B. Wu, State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Minzhuang Road 89, Beijing, Beijing, China, 100093; email: [email protected]. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. © 2022 Association for Computing Machinery. 2157-6904/2022/04-ART42 $15.00 https://doi.org/10.1145/3474839
Publisher Copyright:
© 2022 Association for Computing Machinery.
PY - 2022/6
Y1 - 2022/6
N2 - With the proliferation of location-aware devices, trajectory data have been used widely in real-life applications. However, trajectory data are often associated with sensitive labels, such as users' purchase transactions and planned activities. As such, inappropriate sharing or publishing of these data could threaten users' privacy, especially when an adversary has sufficient background knowledge about a trajectory through other data sources, such as social media (check-in tags). Though differential privacy has been used to address the privacy of trajectory data, no existing method can protect the privacy of both trajectory data and sensitive labels. In this article, we propose a comprehensive trajectory publishing algorithm with three effective procedures. First, we apply density-based clustering to determine hotspots and outliers and then blur their locations by generalization. Second, we propose a graph-based model to efficiently capture the relationship among sensitive labels and trajectory points in all records and leverage Laplace noise to achieve differential privacy. Finally, we generate and publish trajectories by traversing and updating this graph until we travel all vertexes. Our experiments on synthetic and real-life datasets demonstrate that our algorithm effectively protects the privacy of both sensitive labels and location data in trajectory publication. Compared with existing works on trajectory publishing, our algorithm can also achieve higher data utility.
AB - With the proliferation of location-aware devices, trajectory data have been used widely in real-life applications. However, trajectory data are often associated with sensitive labels, such as users' purchase transactions and planned activities. As such, inappropriate sharing or publishing of these data could threaten users' privacy, especially when an adversary has sufficient background knowledge about a trajectory through other data sources, such as social media (check-in tags). Though differential privacy has been used to address the privacy of trajectory data, no existing method can protect the privacy of both trajectory data and sensitive labels. In this article, we propose a comprehensive trajectory publishing algorithm with three effective procedures. First, we apply density-based clustering to determine hotspots and outliers and then blur their locations by generalization. Second, we propose a graph-based model to efficiently capture the relationship among sensitive labels and trajectory points in all records and leverage Laplace noise to achieve differential privacy. Finally, we generate and publish trajectories by traversing and updating this graph until we travel all vertexes. Our experiments on synthetic and real-life datasets demonstrate that our algorithm effectively protects the privacy of both sensitive labels and location data in trajectory publication. Compared with existing works on trajectory publishing, our algorithm can also achieve higher data utility.
KW - differential privacy
KW - privacy preservation
KW - Trajectory publishing
UR - http://www.scopus.com/inward/record.url?scp=85130228664&partnerID=8YFLogxK
U2 - 10.1145/3474839
DO - 10.1145/3474839
M3 - Journal article
AN - SCOPUS:85130228664
SN - 2157-6904
VL - 13
SP - 1
EP - 21
JO - ACM Transactions on Intelligent Systems and Technology
JF - ACM Transactions on Intelligent Systems and Technology
IS - 3
M1 - 42
ER -