Please use this identifier to cite or link to this item:
|Title:||Publishing trajectory with differential privacy: A priori vs. a posteriori sampling mechanisms|
|Citation:||Shao, D.,Jiang, K.,Kister, T.,Bressan, S.,Tan, K.-L. (2013). Publishing trajectory with differential privacy: A priori vs. a posteriori sampling mechanisms. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8055 LNCS (PART 1) : 357-365. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-40285-2_31|
|Abstract:||It is now possible to collect and share trajectory data for any ship in the world by various means such as satellite and VHF systems. However, the publication of such data also creates new risks for privacy breach with consequences on the security and liability of the stakeholders. Thus, there is an urgent need to develop methods for preserving the privacy of published trajectory data. In this paper, we propose and comparatively investigate two mechanisms for the publication of the trajectory of individual ships under differential privacy guarantees. Traditionally, privacy and differential privacy is achieved by perturbation of the result or the data according to the sensitivity of the query. Our approach, instead, combines sampling and interpolation. We present and compare two techniques in which we sample and interpolate (a priori) and interpolate and sample (a posteriori), respectively. We show that both techniques achieve a (0, δ) form of differential privacy. We analytically and empirically, with real ship trajectories, study the privacy guarantee and utility of the methods. © 2013 Springer-Verlag.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 15, 2018
checked on Oct 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.