z-logo
open-access-imgOpen Access
Trajectory Data Privacy Protection based on Differential Privacy Mechanism
Author(s) -
Ke Gu,
Lihao Yang,
Yongzhi Liu,
Bo Yin
Publication year - 2018
Publication title -
informatica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 34
eISSN - 1854-3871
pISSN - 0350-5596
DOI - 10.31449/inf.v42i3.1638
Subject(s) - differential privacy , computer science , data publishing , trajectory , polygon (computer graphics) , centroid , privacy protection , scheme (mathematics) , usability , information privacy , data mining , information sensitivity , point (geometry) , computer security , mathematics , artificial intelligence , computer network , publishing , mathematical analysis , physics , geometry , astronomy , frame (networking) , human–computer interaction , political science , law
Now many applications of location data have facilitated people’s daily life. However, publishing location data may divulge individual sensitive information so as to influence people’s normal life. On the other hand, if we cannot mine and share location data information, location data will lose its value to serve our society. Currently, as the records about trajectory data may be discrete in database, some existing privacy protection schemes are difficult to protect trajectory data. In this paper, we propose a trajectory data privacy protection scheme based on differential privacy mechanism. In the proposed scheme, the algorithm first selects the protected points from the user’s trajectory data; secondly, the algorithm forms the polygon according to the protected points and the adjacent and high frequent accessed points that are selected from the accessing point database, then the algorithm calculates the polygon centroids; finally, the noises are added to the polygon centroids by the differential privacy method, and the polygon centroids replace the protected points, and then the algorithm constructs and issues the new trajectory data. The experiments show that the running time of the proposed algorithms is fast, the privacy protection of the scheme is effective and the data usability of the scheme is higher.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom