Nothing Special   »   [go: up one dir, main page]

Skip to main content

A Free Terrain Model for Trajectory K–Anonymity

  • Conference paper
Database and Expert Systems Applications (DEXA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5181))

Included in the following conference series:

Abstract

This paper introduces a privacy model for location based services that utilizes collected movement data to identify parts of the user trajectories, where user privacy is at an elevated risk. To protect the privacy of the user, the proposed methodology transforms the original requests into anonymous counterparts by offering trajectory K–anonymity. As a proof of concept, we build a working prototype that implements our solution approach and is used for experimentation and evaluation purposes. Our implementation relies on a spatial DBMS that carries out part of the necessary analysis. Through experiments we demonstrate the effectiveness of our approach to preserve the K–anonymity of the users for as long as the requested services are in progress.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gidófalvi, G., Pedersen, T.B.: Mining long, sharable patterns in trajectories of moving objects. In: Third Workshop on Spatio-Temporal Database Management (2006)

    Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: 20th International Conference on Very Large Databases, pp. 487–499 (1994)

    Google Scholar 

  3. Jensen, C.S., Lahrmann, H., Pakalnis, S., Runge, J.: The INFATI data. Time Center TR-79 (2004), http://www.cs.aau.dk/TimeCenter

  4. Gruteser, M., Grunwald, D.: Anonymous usage of location-based services through spatial and temporal cloaking. In: First International Conference on Mobile Systems, Applications, and Services, pp. 31–42 (2003)

    Google Scholar 

  5. Gedik, B., Liu, L.: A customizable K-anonymity model for protecting location privacy. Technical report, Georgia Institute of Technology (April 2004)

    Google Scholar 

  6. Bettini, C., Wang, X.S., Jajodia, S.: Protecting privacy against location-based personal identification. In: Second VLDB Workshop on Secure Data Management, pp. 185–199 (2005)

    Google Scholar 

  7. Mokbel, M.F., Chow, C.Y., Aref, W.G.: The new casper: query processing for location services without compromising privacy. In: 32nd International Conference on Very Large Data Bases, pp. 763–774 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Sourav S. Bhowmick Josef Küng Roland Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gkoulalas-Divanis, A., Verykios, V.S. (2008). A Free Terrain Model for Trajectory K–Anonymity. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2008. Lecture Notes in Computer Science, vol 5181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85654-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85654-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85653-5

  • Online ISBN: 978-3-540-85654-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics