Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Bob-Tree: An Efficient B + -Tree Based Index Structure for Geographic-Aware Obfuscation

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2011)

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

Included in the following conference series:

Abstract

The privacy protection of personal location information increasingly gains special attention in the field of location-based services, and obfuscation is the most popular technique aiming at protecting this sensitive information. However, all of the conventional obfuscation techniques are geometry-based and separated from the database level. Thus, the query processing has two time-consuming phases due to the number of disk accesses required to retrieve the user’s exact location, and the location obfuscation. Also, since these techniques are geometry-based, they cannot assure location privacy when the adversary has knowledge about the geography of the obfuscated region. We address these problems by proposing Bob-tree, an index structure that is based on Bdual-tree and contains geographic-aware information on its nodes. Experiments show that Bob-tree provides a significant improvement over the algorithm separated from the database level for query processing time and location privacy protection.

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 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

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. Ardagna, C.A., Cremonini, M., Vimercati, S.D.C., Samarati, P.: An Obfuscation-Based Approach for Protecting Location Privacy. TDSC 8(1), 13–27 (2009)

    Google Scholar 

  2. Anh, T.T., Chi, T.Q., Dang, T.K.: An Adaptive Grid-Based Approach to Location Privacy Preservation. In: ACIIDS, Hue, Vietnam, pp. 133–144 (2010)

    Google Scholar 

  3. Jafarian, J.H., Amini, M., Jalili, R.: Protecting Location Privacy through a Graph-based Location Representation and a Robust Obfuscation Technique. In: Lee, P.J., Cheon, J.H. (eds.) ICISC 2008. LNCS, vol. 5461, pp. 116–133. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Mohamed, F.M.: Privacy in Location-based Services: State-of-the-art and Research Directions. Tutorial, MDM, Germany (2007)

    Google Scholar 

  5. Dinh, L.V.N., Aref, W.G., Mokbel, M.F.: Spatio-temporal Access Methods-Part 2. IEEE Data Engineering Bulletin (2010)

    Google Scholar 

  6. Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. In: ACM SIGMOD, USA, pp. 331–342 (2000)

    Google Scholar 

  7. Jensen, C.S., Lin, D., Ooi, B.C.: Query and Update Efficient B + -tree based Indexing of Moving Objects. In: VLDB, Canada, pp. 768–779 (2004)

    Google Scholar 

  8. 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 

  9. Dang, T.K., To, Q.C.: An Extensible and Pragmatic Hybrid Indexing Scheme for MAC-based LBS Privacy-Preserving in Commercial DBMSs. In: ACOMP, Ho Chi Minh City, Vietnam, pp. 58–67 (2010)

    Google Scholar 

  10. Atluri, V., Shin, H.: Efficient Security Policy Enforcement in a Location Based Service Environment. In: DBSEC, USA, pp. 61–76 (2007)

    Google Scholar 

  11. To, Q.C., Dang, T.K., Küng, J.: OST-tree: An Access Method for Obfuscating Spatio-temporal Data in Location-based Services. In: NTMS, France (to appear, 2011)

    Google Scholar 

  12. Hadjieleftheriou, M., Hoel, E., Tsotras, V.J.: SaIL: A Spatial Index Library for Efficient Application Integration. Geoinformatica 9(4), 367–389 (2005)

    Article  Google Scholar 

  13. Damiani, M., Bertino, E., Silvestri, C.: Protecting Location Privacy through Semantics-aware Obfuscation Techniques. In: IFIPTM, Norway, pp. 231–245 (2008)

    Google Scholar 

  14. Damiani, M., Bertino, E., Silvestri, C.: PROBE: an Obfuscation System for the Protection of Sensitive Location Information in LBS. TR2001-145, CERIAS (2008)

    Google Scholar 

  15. Guttman, A.: R-trees: A Dynamic Index Structure for Spatial Searching. In: ACM SIGMOD, USA, pp. 47–57 (1984)

    Google Scholar 

  16. Dang, T.K., Küng, J., Wagner, R.: The SH-tree: A Super Hybrid Index Structure for Multidimensional Data. In: Mayr, H.C., Lazanský, J., Quirchmayr, G., Vogel, P. (eds.) DEXA 2001. LNCS, vol. 2113, pp. 340–349. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

To, Q.C., Dang, T.K., Küng, J. (2011). Bob-Tree: An Efficient B + -Tree Based Index Structure for Geographic-Aware Obfuscation. In: Nguyen, N.T., Kim, CG., Janiak, A. (eds) Intelligent Information and Database Systems. ACIIDS 2011. Lecture Notes in Computer Science(), vol 6591. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20039-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20039-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20038-0

  • Online ISBN: 978-3-642-20039-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics