2014年
On Safety of Pseudonym-Based Location Data in the Context of Constraint Satisfation Problems
INFORMATION AND COMMUNICATION TECHNOLOGY
- ,
- ,
- ,
- 巻
- 8407
- 号
- 開始ページ
- 511
- 終了ページ
- 520
- 記述言語
- 英語
- 掲載種別
- DOI
- 10.1007/978-3-642-55032-4-52
- 出版者・発行元
- SPRINGER-VERLAG BERLIN
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.
- リンク情報
-
- DOI
- https://doi.org/10.1007/978-3-642-55032-4-52
- DBLP
- https://dblp.uni-trier.de/rec/conf/ict-eurasia/TanjoMMM14
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000342740900054&DestApp=WOS_CPL
- URL
- http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=84900819046&origin=inward
- ID情報
-
- DOI : 10.1007/978-3-642-55032-4-52
- ISSN : 0302-9743
- ISBN : 9783642550317
- DBLP ID : conf/ict-eurasia/TanjoMMM14
- SCOPUS ID : 84900819046
- Web of Science ID : WOS:000342740900054