%0 Conference Proceedings
%T The Fréchet/Manhattan Distance and the Trajectory Anonymisation Problem
%+ University of Luxembourg [Luxembourg]
%+ Interdisciplinary Centre for Security, Reliability and Trust [Luxembourg] (SnT)
%A Torres, Christof, Ferreira
%A Trujillo-Rasua, Rolando
%Z Part 1: Mobile Security and Privacy
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 30th IFIP Annual Conference on Data and Applications Security and Privacy (DBSec)
%C Trento, Italy
%Y Silvio Ranise
%Y Vipin Swarup
%I Springer International Publishing
%3 Data and Applications Security and Privacy XXX
%V LNCS-9766
%P 19-34
%8 2016-07-18
%D 2016
%R 10.1007/978-3-319-41483-6_2
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01633679/document
%2 https://inria.hal.science/hal-01633679/file/428203_1_En_2_Chapter.pdf
%L hal-01633679
%U https://inria.hal.science/hal-01633679
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-3
%~ IFIP-DBSEC
%~ IFIP-LNCS-9766