Personalized Privacy-Preserving Publication of Trajectory Data by Generalization and Distortion of Moving Points

2021 ◽  
Vol 30 (1) ◽  
Author(s):  
Samaneh Mahdavifar ◽  
Fatemeh Deldar ◽  
Hassan Mahdikhani
Keyword(s):  
Privacy Preserving ◽  
Trajectory Data ◽  
Moving Points

Personalized Privacy-Preserving Trajectory Data Publishing

2017 ◽  
Vol 26 (2) ◽  
pp. 285-291 ◽  
Author(s):  
Qiwei Lu ◽  
Caimei Wang ◽  
Yan Xiong ◽  
Huihua Xia ◽  
Wenchao Huang ◽  
...  
Keyword(s):  
Privacy Preserving ◽  
Data Publishing ◽  
Trajectory Data

scholarly journals Trajectory Clustering and k-NN for Robust Privacy Preserving Spatiotemporal Databases

Algorithms ◽  
2018 ◽  
Vol 11 (12) ◽  
pp. 207 ◽  
Author(s):  
Elias Dritsas ◽  
Maria Trigka ◽  
Panagiotis Gerolymatos ◽  
Spyros Sioutas 
Keyword(s):  
Nearest Neighbor ◽  
Dimensional Space ◽  
Motion Vector ◽  
Research Work ◽  
Privacy Preserving ◽  
Mobile Users ◽  
Trajectory Clustering ◽  
K Nearest Neighbor ◽  
Trajectory Data ◽  
Spatiotemporal Databases

In the context of this research work, we studied the problem of privacy preserving on spatiotemporal databases. In particular, we investigated the k-anonymity of mobile users based on real trajectory data. The k-anonymity set consists of the k nearest neighbors. We constructed a motion vector of the form (x,y,g,v) where x and y are the spatial coordinates, g is the angle direction, and v is the velocity of mobile users, and studied the problem in four-dimensional space. We followed two approaches. The former applied only k-Nearest Neighbor (k-NN) algorithm on the whole dataset, while the latter combined trajectory clustering, based on K-means, with k-NN. Actually, it applied k-NN inside a cluster of mobile users with similar motion pattern (g,v). We defined a metric, called vulnerability, that measures the rate at which k-NNs are varying. This metric varies from 1 k (high robustness) to 1 (low robustness) and represents the probability the real identity of a mobile user being discovered from a potential attacker. The aim of this work was to prove that, with high probability, the above rate tends to a number very close to 1 k in clustering method, which means that the k-anonymity is highly preserved. Through experiments on real spatial datasets, we evaluated the anonymity robustness, the so-called vulnerability, of the proposed method.

scholarly journals An Analysis of Differential Privacy Research in Location and Trajectory Data

2020 ◽  
Author(s):  
Fatima Zahra Errounda ◽  
Yan Liu
Keyword(s):  
Location Privacy ◽  
Differential Privacy ◽  
State Of The Art ◽  
Original Data ◽  
Privacy Preserving ◽  
The State ◽  
Trajectory Data ◽  
Powerful Technique ◽  
Location Data ◽  
Single User

Abstract Location and trajectory data are routinely collected to generate valuable knowledge about users' pattern behavior. However, releasing location data may jeopardize the privacy of the involved individuals. Differential privacy is a powerful technique that prevents an adversary from inferring the presence or absence of an individual in the original data solely based on the observed data. The first challenge in applying differential privacy in location is that a it usually involves a single user. This shifts the adversary's target to the user's locations instead of presence or absence in the original data. The second challenge is that the inherent correlation between location data, due to people's movement regularity and predictability, gives the adversary an advantage in inferring information about individuals. In this paper, we review the differentially private approaches to tackle these challenges. Our goal is to help newcomers to the field to better understand the state-of-the art by providing a research map that highlights the different challenges in designing differentially private frameworks that tackle the characteristics of location data. We find that in protecting an individual's location privacy, the attention of differential privacy mechanisms shifts to preventing the adversary from inferring the original location based on the observed one. Moreover, we find that the privacy-preserving mechanisms make use of the predictability and regularity of users' movements to design and protect the users' privacy in trajectory data. Finally, we explore how well the presented frameworks succeed in protecting users' locations and trajectories against well-known privacy attacks.

scholarly journals Trajectory Clustering and k-NN for Robust Privacy Preserving k-NN Query Processing in GeoSpark

Algorithms ◽  
2020 ◽  
Vol 13 (8) ◽  
pp. 182
Author(s):  
Elias Dritsas ◽  
Andreas Kanavos ◽  
Maria Trigka ◽  
Gerasimos Vonitsanos ◽  
Spyros Sioutas ◽  
...  
Keyword(s):  
Big Data ◽  
Spatial Data ◽  
Privacy Preservation ◽  
Nearest Neighbor ◽  
Data Representation ◽  
Privacy Preserving ◽  
Temporal Data ◽  
K Nearest Neighbor ◽  
Trajectory Data ◽  
Spatio Temporal

Privacy Preserving and Anonymity have gained significant concern from the big data perspective. We have the view that the forthcoming frameworks and theories will establish several solutions for privacy protection. The k-anonymity is considered a key solution that has been widely employed to prevent data re-identifcation and concerns us in the context of this work. Data modeling has also gained significant attention from the big data perspective. It is believed that the advancing distributed environments will provide users with several solutions for efficient spatio-temporal data management. GeoSpark will be utilized in the current work as it is a key solution that has been widely employed for spatial data. Specifically, it works on the top of Apache Spark, the main framework leveraged from the research community and organizations for big data transformation, processing and visualization. To this end, we focused on trajectory data representation so as to be applicable to the GeoSpark environment, and a GeoSpark-based approach is designed for the efficient management of real spatio-temporal data. Th next step is to gain deeper understanding of the data through the application of k nearest neighbor (k-NN) queries either using indexing methods or otherwise. The k-anonymity set computation, which is the main component for privacy preservation evaluation and the main issue of our previous works, is evaluated in the GeoSpark environment. More to the point, the focus here is on the time cost of k-anonymity set computation along with vulnerability measurement. The extracted results are presented into tables and figures for visual inspection.

scholarly journals Privacy-Preserving Trajectory Data Publishing by Dynamic Anonymization with Bounded Distortion

2021 ◽  
Vol 10 (2) ◽  
pp. 78
Author(s):  
Songyuan Li ◽  
Hui Tian ◽  
Hong Shen ◽  
Yingpeng Sang
Keyword(s):  
Privacy Preservation ◽  
Privacy Preserving ◽  
Data Publishing ◽  
Published Data ◽  
Trajectory Data ◽  
Data Utilization ◽  
Data Set ◽  
Guangzhou City ◽  
Bounded Distortion ◽  
Privacy Breaches

Publication of trajectory data that contain rich information of vehicles in the dimensions of time and space (location) enables online monitoring and supervision of vehicles in motion and offline traffic analysis for various management tasks. However, it also provides security holes for privacy breaches as exposing individual’s privacy information to public may results in attacks threatening individual’s safety. Therefore, increased attention has been made recently on the privacy protection of trajectory data publishing. However, existing methods, such as generalization via anonymization and suppression via randomization, achieve protection by modifying the original trajectory to form a publishable trajectory, which results in significant data distortion and hence a low data utility. In this work, we propose a trajectory privacy-preserving method called dynamic anonymization with bounded distortion. In our method, individual trajectories in the original trajectory set are mixed in a localized manner to form synthetic trajectory data set with a bounded distortion for publishing, which can protect the privacy of location information associated with individuals in the trajectory data set and ensure a guaranteed utility of the published data both individually and collectively. Through experiments conducted on real trajectory data of Guangzhou City Taxi statistics, we evaluate the performance of our proposed method and compare it with the existing mainstream methods in terms of privacy preservation against attacks and trajectory data utilization. The results show that our proposed method achieves better performance on data utilization than the existing methods using globally static anonymization, without trading off the data security against attacks.

Sign in / Sign up

Export Citation Format

Share Document