The Fréchet/Manhattan Distance and the Trajectory Anonymisation Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

The Fréchet/Manhattan Distance and the Trajectory Anonymisation Problem

(1) , (1, 2)


Mobile communication has grown quickly in the last two decades. Connections can be wirelessly established from almost any habitable place in the earth, leading to a plethora of connection-based tracking mechanisms, such as GPS, GSM, RFID, etc. Trajectories representing the movement of people are consequently being gathered and analysed in a daily basis. However, a trajectory may contain sensitive and private information, which raises the problem of whether spatio-temporal data can be published in a private manner.In this article, we introduce a novel distance measure for trajectories that captures both aspect of the microaggregation process, namely clustering and obfuscation. Based on this distance measure we propose a trajectory anonymisation heuristic method ensuring that each trajectory is indistinguishable from $$k-1$$ other trajectories. The proposed distance measure is loosely based on the Fréchet distance, yet it can be computed efficiently in quadratic time complexity. Empirical studies on synthetic trajectories show that our anonymisation approach improves previous work in terms of utility without sacrificing privacy.
Fichier principal
Vignette du fichier
428203_1_En_2_Chapter.pdf (368.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01633679 , version 1 (13-11-2017)


Attribution - CC BY 4.0



Christof Ferreira Torres, Rolando Trujillo-Rasua. The Fréchet/Manhattan Distance and the Trajectory Anonymisation Problem. 30th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec), Jul 2016, Trento, Italy. pp.19-34, ⟨10.1007/978-3-319-41483-6_2⟩. ⟨hal-01633679⟩
174 View
128 Download



Gmail Facebook Twitter LinkedIn More