Journal of Computing Science and Engineering

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지
DOI QR코드

DOI QR Code

Uncertainty for Privacy and 2-Dimensional Range Query Distortion

  • Received : 2011.02.01
  • Accepted : 2011.03.20
  • Published : 2011.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

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_{min}$, where $A_{min}$ 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, ${\theta}$) plane, where u and ${\theta}$ 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, ${\theta}$) 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.

Keywords

References

  1. R. Bajaj, S. L. Ranaweera, and D. P. Agrawal, "GPS: location-tracking technology," Computer, vol. 35, no. 4, pp. 92-94, Apr. 2002.
  2. R. Clarke, "Person location and person tracking: technologies, risks and policy implications," Information Technology & People, vol. 14, no. 2, pp. 206-231, 2001. https://doi.org/10.1108/09593840110695767
  3. B. Hoh, M. Gruteser, H. Xiong, and A. Alrabady, "Preserving privacy in GPS traces via uncertainty-aware path cloaking," Proceedings of the 14th ACM Conference on Computer and Communications Security, Alexandria, VA, 2007, pp. 161-171.
  4. T. D'Roza and G. Bilchev, "An overview of location-based services," BT Technology Journal, vol. 21, no. 1, pp. 20-27, 2003. https://doi.org/10.1023/A:1022491825047
  5. C. Hauser and M. Kabatnik, "Towards privacy support in a global location service," Proceedings of the IFIP Workshop on IP and ATM Traffic Management, Paris, France, 2001, pp. 81-89.
  6. M. Gruteser and D. Grunwald, "Anonymous usage of location-based services through spatial and temporal cloaking," Proceedings of the 1st International Conference on Mobile Systems, Applications and Services, San Francisco, CA, 2003, pp. 31-42.
  7. M. Duckham and L. Kulik, "Location privacy and location-aware computing," Dynamic and Mobile GIS: Investigating Changes in Space and Time, R. Billen, E. Joao, and D. Forrest, Eds., Boca Raton, FL: CRC Press, ch. 3, pp. 34-51, 2006.
  8. C. Ardagna, M. Cremonini, S. De Capitani di Vimercati, and P. Samarati, "Access control in location-based services," Privacy in Location-Based Applications. Lecture Notes in Computer Science Vol. 5599, C. Bettini, S. Jajodia, P. Samarati, and X. Wang, Eds., Heidelberg: Springer Berlin, pp. 106-126, 2009. https://doi.org/10.1007/978-3-642-03511-1_5
  9. M. Gruteser and X. Liu, "Protecting privacy in continuous location-tracking applications," IEEE Security and Privacy, vol. 2, no. 2, pp. 28-34, 2004. https://doi.org/10.1109/MSECP.2004.1281242
  10. L. Kulik, "Privacy for real-time location-based services," SIGSPATIAL Special, vol. 1, no. 2, pp. 9-14, Jul. 2009 https://doi.org/10.1145/1567253.1567256
  11. G. Ghinita, "Private queries and trajectory anonymization: a dual perspective on location privacy," Transactions on Data Privacy, vol. 2, no. 1, pp. 3-19, 2009.
  12. P. Samarati, "Protecting respondents' identities in microdata release," IEEE Transactions on Knowledge and Data Engineering, vol. 13, no. 6, pp. 1010-1027, 2001. https://doi.org/10.1109/69.971193
  13. L. Sweeney, "K-anonymity: a model for protecting privacy," International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002. https://doi.org/10.1142/S0218488502001648
  14. A. Gkoulalas-Divanis, V. S. Verykios, and P. Bozanis, "A network aware privacy model for online requests in trajectory data," Data and Knowledge Engineering, vol. 68, no. 4, pp. 431-452, 2009. https://doi.org/10.1016/j.datak.2008.11.003
  15. B. Salzberg and V. J. Tsotras, "Comparison of access methods for time-evolving data," ACM Computing Surveys, vol. 31, no. 2, pp. 217-221, 1999.
  16. V. Gaede and O. Günther, "Multidimensional access methods," ACM Computing Surveys, vol. 30, no. 2, pp. 170-231, 1998. https://doi.org/10.1145/280277.280279
  17. Y. Manolopoulos, Y. Theodoridis, and V. J. Tsotras, Advanced Database Indexing, Boston, MA: Kluwer Academic Publishers, 2000.
  18. C. S. Jensen, D. Lin, and B. C. Ooi, "Query and update efficient b+-tree based indexing of moving objects," Proceedings of the 30th International Conference on Very Large Data Bases, Toronto, Canada, 2004, pp. 768-779.
  19. G. Kollios, D. Gunopulos, and V. J. Tsotras, "On indexing mobile objects," Proceedings of 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Philadelphia, PA, 1999, pp. 261-272.
  20. D. Papadopoulos, G. Kollios, D. Gunopulos, and V. J. Tsotras, "Indexing mobile objects on the plane," Proceedings of the 13th International Workshop on Database and Expert Systems Applications, Aix-en-Provence, France, 2002, pp. 693-697.
  21. J. M. Patel, Y. Chen, and V. P. Chakka, "STRIPES: an efficient index for predicted trajectories," Proceedings of the ACM SIGMOD International Conference on Management of Data, Paris, France, 2004, pp. 635-646.
  22. Y. Tao, D. Papadias, and J. Sun, "The $TPR^{\ast}-tree:$ an optimized spatio-temporal access method for predictive queries," Proceedings of the 29th International Conference on Very Large Data Bases, Berlin, Germany, 2003, pp. 790-801.
  23. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, "The R-tree: an efficient and robust access method for points and rectangles," Proceedings of the ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ, 1990, pp. 322-331.
  24. P. K. Agarwal, L. Arge, J. Erickson, P. G. Franciosa, and J. S. Vitter, "Efficient searching with linear constraints," Proceedings of the 17th ACM SIGART-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, WA, 1998, pp. 169-178.
  25. S. Saltenis, C. S. Jensen, S. T. Leutenegger, and M. A. Lopez, "Indexing the positions of continuously moving objects," Proceedings of the ACM SIGMOD International Conference on Management of Data, Dallas, TX, 2000, pp. 331-342.
  26. S. Saltenis and C. S. Jensen, "Indexing of moving objects for location-based services," Proceedings of the 18th International Conference on Data Engineering, San Jose, CA, 2002, pp. 463-472.
  27. S. Sioutas, K. Tsakalidis, K. Tsichlas, C. Makris, and Y. Manolopoulos, "A new approach on indexing mobile objects on the plane," Data and Knowledge Engineering, vol. 67, no. 3, pp. 362-380, 2008. https://doi.org/10.1016/j.datak.2008.06.009
  28. J. Han and M. Kamber, Data Mining: Concepts and Techniques, 2nd ed., San Francisco, CA: Morgan Kaufmann Publishers, 2006.
  29. M. H. Dunham, Data Mining: Introductory and Advanced Topics, Upper Saddle River, NJ: Prentice Hall/Pearson Education, 2003.
  30. J. MacQueen, "On convergence of k-means and partitions with minimum average variance (abstract)," Annals of Mathematical Statistics, vol. 36, no. 3, p. 1084, Jun. 1965.
  31. D. Pelleg and A. W. Moore, "X-means: extending k-means with efficient estimation of the number of clusters," Proceedings of the 17th International Conference on Machine Learning, Stanford, CA, 2000, pp. 727-734.
  32. G. Hamerly and C. Elkan, "Learning the k in k-means," Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference, S. Thrun, L. K. Saul, and B. Scholkopf, Eds., Cambridge, MA: MIT Press, pp. 281-288, 2004.
  33. H. Koivistoinen, M. Ruuska, and T. Elomaa, "A voronoi diagram approach to autonomous clustering," Discovery Science. Lecture Notes in Computer Science Vol. 4265, L. Todorovski, N. Lavrac, and K. Jantke, Eds., Heidelberg: Springer Berlin, pp. 149-160, 2006. https://doi.org/10.1007/11893318_17
  34. B. Kao, S. D. Lee, F. K. F. Lee, D. W. Cheung, and W. S. Ho, "Clustering uncertain data using voronoi diagrams and R-tree index," IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 9, pp. 1219-1233, 2010. https://doi.org/10.1109/TKDE.2010.82
  35. P. S. Bishnu and V. Bhattacherjee, "CTVN: clustering technique using voronoi diagram," International Journal of Recent Trends in Engineering, vol. 2, no. 3, pp. 13-15, Nov. 2009.
  36. F. Aurenhammer, T. U. Graz, R. Klein, F. Hagen, and P. I. Vi, "Voronoi diagrams," Handbook of Computational Geometry, J. R. Sack and J. Urrutia, Eds., Amsterdam, The Netherlands: North-Holland Publishing Co., pp. 201-290, 2000.
  37. A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor, "A linear-time algorithm for computing the voronoi diagram of a convex polygon," Discrete & Computational Geometry, vol. 4, no. 1, pp. 591-604, 1989. https://doi.org/10.1007/BF02187749
  38. J. Goldstein, U. Shaft, R. Ramakrishnan, and J. B. Yu, "Processing queries by linear constraints," Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Tucson, AZ, 1997, pp. 257-267.
  39. A. Kaporis, C. Makris, G. Mavritsakis, S. Sioutas, A. Tsakalidis, K. Tsichlas, and C. Zaroliagis, "ISB-tree: a new indexing scheme with efficient expected behaviour," Algorithms and Computation. Lecture Notes in Computer Science Vol. 3827, X. Deng and D. Z. Du, Eds., Heidelberg: Springer Berlin, pp. 318-327, 2005. https://doi.org/10.1007/11602613_33
  40. O. Abul, F. Bonchi, and M. Nanni, "Never walk alone: uncertainty for anonymity in moving objects databases," Proceedings of the 24th International Conference on Data Engineering, Cancun, Mexico, 2008, pp. 376-385.