Protecting location privacy with k-confusing paths based on dynamic pseudonyms

Mano, Ken; Minami, Kazuhiro; Maruyama, Hiroshi

doi:10.1109/percomw.2013.6529496

Search citation statements

Order By: Relevance

Paper Sections

Select...

Results1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2020

Publication Types

Select...

Book1

Other1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We randomly define security requirements of up to five to randomly chosen users. We compare results with our safety verification program using the CSP solver with those using our previously developed polynomial-time algorithm [10]. Although the time complexity of the CSP solver is exponential at the worst case, our safety versifier outperforms our previously algorithm.…”

Section: Resultsmentioning

confidence: 99%

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

Tanjo

Minami

Mano

et al. 2014

Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Resultsmentioning

confidence: 99%