Skip to main content

A Novel Trajectory Privacy-Preserving Future Time Index Structure in Moving Object Databases

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7653))

Abstract

The next generation of location-based services has been being predicted to achieve its superior development over the coming years. Keeping pace with this growth are new trends of predictive applications emerging to meet the demands of end-users and satisfy their matters of life. The violation of users’ private information from their position disclosure, however, cuts off their beliefs when they enjoy such services. In this paper, therefore, we propose a novel index structure known as PPST-tree, which is able to deal with predictive and aggregate queries and is aware of trajectory privacy protection towards future positions of moving objects. Moreover, the prediction model and related strategies are also introduced in order to support location-based applications whereas user privacy is still preserved. Last but not least, privacy analyses and performance experiments show how well the proposed method can help.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Atluri, V., Shin, H., Vaidya, J.: Efficient Security Policy Enforcement for the Mobile Environment. In: Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, vol. 16(4), pp. 439–475 (2008)

    Google Scholar 

  2. Dan, L., Elisa, B., Reynold, C., Sunil, P.: Location Privacy in Moving Object Environments. Transactions on Data Privacy Archive 2(1), 21–46 (2009)

    Google Scholar 

  3. Dang, T.K.: Semantic Based Similarity Searches in Database Systems (Multidimensional Access Methods, Similarity Search Algorithms). PhD thesis, FAW-Institute, Johannes Kepler University Linz, Austria (2003)

    Google Scholar 

  4. Dang, T.K., Phan, T.N., Ngo, C.N., Ngo, N.N.M.: An Open Design Privacy-Enhancing Platform Supporting Location-Based Applications. In: Proc. of the 6th ACM Int. Conf. on Ubiquitous Information Management and Communication, Malaysia (2012)

    Google Scholar 

  5. Dang, T.K., Thoai, N., To, Q.C., Phan, T.N.: A Database-Centric Approach to Privacy Protection in Location-Based Applications. In: Proc. of the 3rd Regional Conf. on ICT Applications for Industries and Small Companies in ASEAN countries, Lao PDR (2011)

    Google Scholar 

  6. Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B + -Tree Based Indexing of Moving Objects. In: Proc. of the 30th Int. Conf. on VLDB, Canada, pp. 768–779 (2004)

    Google Scholar 

  7. Lin, D., Jensen, C.S., Zhang, R., Xiao, L., Lu, J.: A Moving Object Index for Efficient Query Processing with Peer-Wise Location Privacy. In: Proc. of Int. Conf. on Very Large Data Bases Endowment, vol. 5(1), pp. 37–48 (2011)

    Google Scholar 

  8. Liu, X., Karimi, H.A.: Location Awareness through Trajectory Prediction. In: Proc. of Computers, Environment and Urban Systems, pp. 741–756 (2006)

    Google Scholar 

  9. Mehmet, E.N., Maurizio, A., Yucel, S.: Towards Trajectory Anonymization: a Generalization-Based Approach. In: Proc. of the SIGSPATIAL ACM GIS Int. Workshop on Security and Privacy in GIS and LBS (2008)

    Google Scholar 

  10. Phan, T.N., Dang, T.K., Küng, J.: User Privacy Protection from Trajectory Perspective in Location-Based Applications. In: Proc. of the 19th Interdisciplinary Information Management Talks, Jindřichův Hradec, Czech Republic, pp. 281–288 (2011)

    Google Scholar 

  11. Samarati, P., Sweeney, L.: Protecting Privacy When Disclosing Information: K-anonymity and Its Enforcement through Generalization and Suppression. Technical Report SRI-CSL-98-04, SRI Computer Science Laboratory (1998)

    Google Scholar 

  12. To, Q.C., Dang, T.K., Küng, J.: Bob-Tree: An Efficient B + -Tree Based Index Structure for Geographic-Aware Obfuscation. In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011, Part I. LNCS, vol. 6591, pp. 109–118. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. To, Q.C., Dang, T.K., Küng, J.: A Hilbert-Based Framework for Preserving Privacy in Location-Based Services. International Journal of Intelligent Information and Database Systems (IJIIDS). Inderscience Publisher (to appear, 2012) ISSN 1751-5858

    Google Scholar 

  14. Yiu, M.L., Tao, Y., Mamoulis, N.: The Bdual-Tree: Indexing Moving Objects by Space Filling Curves in the Dual Space. VLDB Journal 17(3), 379–400 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phan, T.N., Dang, T.K. (2012). A Novel Trajectory Privacy-Preserving Future Time Index Structure in Moving Object Databases. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34630-9_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34630-9_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34629-3

  • Online ISBN: 978-3-642-34630-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics