On Safety of Pseudonym-Based Location Data in the Context of Constraint Satisfation Problems - Information and Communication Technology Access content directly
Conference Papers Year : 2014

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

Tomoya Tanjo
  • Function : Author
  • PersonId : 993538
Kazuhiro Minami
  • Function : Author
  • PersonId : 993539
Ken Mano
  • Function : Author
  • PersonId : 993540
Hiroshi Maruyama
  • Function : Author
  • PersonId : 993541

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.
Fichier principal
Vignette du fichier
978-3-642-55032-4_52_Chapter.pdf (738.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01397343 , version 1 (15-11-2016)

Licence

Attribution

Identifiers

Cite

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⟩
91 View
41 Download

Altmetric

Share

Gmail Facebook X LinkedIn More