Uncertainty for Privacy and 2-Dimensional Range Query Distortion

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width 2A , where A defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors’ ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, θ) plane, where u and θ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, θ) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface’s boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one. Category: Smart and intelligent computing

[1]  Christian S. Jensen,et al.  Indexing the positions of continuously moving objects , 2000, SIGMOD '00.

[2]  Greg Hamerly,et al.  Learning the k in k-means , 2003, NIPS.

[3]  Yannis Manolopoulos,et al.  Advanced Database Indexing , 1999, Advances in Database Systems.

[4]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[5]  Beng Chin Ooi,et al.  Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.

[6]  Christian S. Jensen,et al.  Indexing of moving objects for location-based services , 2002, Proceedings 18th International Conference on Data Engineering.

[7]  Roger Clarke,et al.  Person location and person tracking - Technologies, risks and policy implications , 2001, Inf. Technol. People.

[8]  Lars Kulik,et al.  Location privacy and location-aware computing , 2006 .

[9]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[10]  Francesco Bonchi,et al.  Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[11]  Christos Makris,et al.  ISB-tree: A new indexing scheme with efficient expected behaviour , 2005, J. Discrete Algorithms.

[12]  Andrew W. Moore,et al.  X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.

[13]  Marco Gruteser,et al.  USENIX Association , 1992 .

[14]  Gabriel Ghinita Private Queries and Trajectory Anonymization: a Dual Perspective on Location Privacy , 2009, Trans. Data Priv..

[15]  Oliver Günther,et al.  Multidimensional access methods , 1998, CSUR.

[16]  Panayiotis Bozanis,et al.  A network aware privacy model for online requests in trajectory data , 2009, Data Knowl. Eng..

[17]  Carmen C. Y. Poon,et al.  Wearable Intelligent Systems for E-Health , 2011, J. Comput. Sci. Eng..

[18]  Jimeng Sun,et al.  The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries , 2003, VLDB.

[19]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[20]  Marco Gruteser,et al.  Protecting privacy, in continuous location-tracking applications , 2004, IEEE Security & Privacy Magazine.

[21]  Hui Xiong,et al.  Preserving privacy in gps traces via uncertainty-aware path cloaking , 2007, CCS '07.

[22]  Vandana Bhattacherjee,et al.  CTVN: Clustering Technique Using Voronoi Diagram , 2009 .

[23]  Pierangela Samarati,et al.  Protecting Respondents' Identities in Microdata Release , 2001, IEEE Trans. Knowl. Data Eng..

[24]  Margaret H. Dunham,et al.  Data Mining: Introductory and Advanced Topics , 2002 .

[25]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[26]  Matthias Kabatnik,et al.  Towards Privacy Support in a Global Location Service , 2001 .

[27]  서정연,et al.  Journal of Computing Science and Engineering(JCSE)의 국제화 작업 , 2010 .

[28]  Jeffrey Scott Vitter,et al.  Efficient searching with linear constraints , 1998, J. Comput. Syst. Sci..

[29]  Yannis Manolopoulos,et al.  A new approach on indexing mobile objects on the plane , 2008, Data Knowl. Eng..

[30]  Jonathan Goldstein,et al.  Processing queries by linear constraints , 1997, PODS '97.

[31]  Jignesh M. Patel,et al.  STRIPES: an efficient index for predicted trajectories , 2004, SIGMOD '04.

[32]  T D'Roza,et al.  An Overview of Location-Based Services , 2003 .

[33]  Dharma P. Agrawal,et al.  GPS: Location-Tracking Technology , 2002, Computer.

[34]  Vassilis J. Tsotras,et al.  Comparison of access methods for time-evolving data , 1999, CSUR.

[35]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[36]  Tapio Elomaa,et al.  A Voronoi Diagram Approach to Autonomous Clustering , 2006, Discovery Science.

[37]  Sabrina De Capitani di Vimercati,et al.  Access Control in Location-Based Services , 2009, Privacy in Location-Based Applications.

[38]  Lars Kulik Privacy for real-time location-based services , 2009, SIGSPACIAL.

[39]  Dimitrios Gunopulos,et al.  On indexing mobile objects , 1999, PODS '99.

[40]  Chris D. Nugent,et al.  Managing Sensor Data in Ambient Assisted Living , 2011, J. Comput. Sci. Eng..

[41]  Dimitrios Gunopulos,et al.  Indexing mobile objects on the plane , 2002, Proceedings. 13th International Workshop on Database and Expert Systems Applications.