On Safety of Pseudonym-Based Location Data in the Context of Constraint Satisfation Problems

Abstract : Pseudonymization is a promising technique for publishing a trajectory location data set in a privacy-preserving way. However, it is not trivial to determine whether a given data set is safely publishable against an adversary with partial knowledge about users’ movements. We therefore formulate this safety decision problem based on the framework of constraint satisfaction problems (CSPs) and evaluate its performance with a real location data set. We show that our approach with an existing CSP solver outperforms a polynomial-time verification algorithm, which is designed particularly for this safety problem.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01397343
Contributor : Hal Ifip <>
Submitted on : Tuesday, November 15, 2016 - 4:54:51 PM
Last modification on : Tuesday, November 15, 2016 - 5:04:53 PM
Long-term archiving on : Thursday, March 16, 2017 - 6:06:36 PM

File

978-3-642-55032-4_52_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Tomoya Tanjo, Kazuhiro Minami, Ken Mano, Hiroshi Maruyama. On Safety of Pseudonym-Based Location Data in the Context of Constraint Satisfation Problems. 2nd Information and Communication Technology - EurAsia Conference (ICT-EurAsia), Apr 2014, Bali, Indonesia. pp.511-520, ⟨10.1007/978-3-642-55032-4_52⟩. ⟨hal-01397343⟩

Share

Metrics

Record views

190

Files downloads

89