Privacy Preserving Spatio-Temporal Clustering on Horizontally Partitioned Data

  • Ali İnan
  • Yücel Saygın
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4081)

Abstract

Time-stamped location information is regarded as spatio-temporal data and, by its nature, such data is highly sensitive from the perspective of privacy. In this paper, we propose a privacy preserving spatio-temporal clustering method for horizontally partitioned data which, to the best of our knowledge, was not done before. Our methods are based on building the dissimilarity matrix through a series of secure multi-party trajectory comparisons managed by a third party. Our trajectory comparison protocol complies with most trajectory comparison functions and complexity analysis of our methods shows that our protocol does not introduce extra overhead when constructing dissimilarity matrix, compared to the centralized approach.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, L., Özsu, M.T., Oria, V.: Robust and Fast Similarity Search for Moving Object Trajectories. In: Proc. of the 2005 ACM SIGMOD, pp. 491–502 (2005)Google Scholar
  2. 2.
    Vlachos, M., Kollios, G., Gunopulos, D.: Discovering Similar Multidimensional Trajectories. In: Proc. of the 18th ICDE, pp. 673–684 (2002)Google Scholar
  3. 3.
    Yi, B.-K., Jagadish, H.V., Faloutsos, C.: Efficient Retrieval of Similar Time Sequences Under Time Warping. In: Proc. of the 14th ICDE, pp. 201–208 (1998)Google Scholar
  4. 4.
    Chen, L., Ng, R.: On the Marriage of Edit Distance and Lp-Norms. In: Proc. of the 2004 VLDB, pp. 792–803 (2004)Google Scholar
  5. 5.
    Oliveira, S.R.M., Zaiane, O.R.: Privacy Preserving Clustering by Object Similarity-Based Representation. In: Proc. of the 2004 ICDM Workshop on Privacy and Security Aspects of Data Mining, pp. 40–46 (2004)Google Scholar
  6. 6.
    Inan, A., Saygin, Y., Savas, E., Hintoglu, A.A., Levi, A.: Privacy Preserving Clustering on Horizontally Partitioned Data. In: Proc. of the 22nd ICDE Workshop on Privacy Data Management (2006)Google Scholar
  7. 7.
    Agrawal, R., Srikant, R.: Privacy Preserving Data Mining. In: Proc. of the 2000 ACM SIGMOD, pp. 439–450 (2000)Google Scholar
  8. 8.
    Jha, S., Kruger, L., Mc Daniel, P.: Privacy Preserving Clustering. In: Proc. of the 10th European Symposium on Research in Computer Security, pp. 397–417 (2005)Google Scholar
  9. 9.
    Merugu, S., Ghosh, J.: Privacy Preserving Distributed Clustering using Generative Models. In: Proc. of the 3rd ICDM, pp. 211–218 (2003)Google Scholar
  10. 10.
    Vaidya, J., Clifton, C.: Privacy Preserving K-Means Clustering over Vertically Partitioned Data. In: Proc. of the 9th ACM SIGKDD, pp. 206–215 (2003)Google Scholar
  11. 11.
    Hoh, B., Gruteser, M.: Protecting Location Privacy through Path Confusion. In: Proc. of the 2005 SecureComm (2005)Google Scholar
  12. 12.
    Beresford, A.R., Stajano, F.: Mix Zones: User Privacy in Location-Aware Services. In: Proc. of PerCom Workshops, pp. 127–131 (2004)Google Scholar
  13. 13.
    Beresford, A.R.: Location Privacy in Ubiquitous Computing. Ph.D. Dissertation, University of Cambridge (2004)Google Scholar
  14. 14.
    Saygin, Y., Verykios, V.S., Clifton, C.: Using Unknowns to Prevent Discovery of Association Rules. SIGMOD Record 30(4), 45–54 (2001)CrossRefGoogle Scholar
  15. 15.
    Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-200, 644–654 (1976)CrossRefMathSciNetGoogle Scholar
  16. 16.
  17. 17.
    ppSTClusteringOnHP.zip [3510K] (March 28, 2006), http://students.sabanciuniv.edu/~inanali/ppSTClusteringOnHP.zip

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ali İnan
    • 1
  • Yücel Saygın
    • 1
  1. 1.Faculty of Engineering and Natural SciencesSabancı UniversityIstanbulTurkey

Personalised recommendations