Skip to main content

Evaluating k Nearest Neighbor Query on Road Networks with no Information Leakage

  • Conference paper
  • First Online:
Web Information Systems Engineering – WISE 2015 (WISE 2015)

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

Included in the following conference series:

  • 1525 Accesses

Abstract

The development of positioning technologies and pervasiveness of mobile devices make an upsurge of interest in location based services (LBS). The k nearest neighbor(kNN) query in road networks is an important query type in LBS and has many real life applications, such as map service. However, such query requires the client to disclose sensitive location information to the LBS. The only existing method for privacy-preserving kNN query adopts the cloaking-region paradigm, which blurs the location into a spatial region. However, the LBS can still deduce some information (albeit not exact) about the location. In this paper, we aim at strong privacy wherein the LBS learns nothing about the query location. To this end, we employ private information retrivial (PIR) technique, which accesses data pages anonymously from a database. Based on PIR, we propose a secure query processing framework together with flexible query plan for arbitrary kNN query. To the best of our knowledge, this is the first research that preserves strong location privacy for network kNN query. Extensive experiments under real world and synthetic datasets demonstrate the practicality of our approach.

This research was partially supported by the grants from the Natural Science Foundation of China (No. 61379050, 91224008); the National 863 High-tech Program (No. 2013AA013204); Specialized Research Fund for the Doctoral Program of Higher Education(No. 20130004130001); the Fundamental Research Funds for the Central Universities, and the Research Funds of Renmin University(No. 11XNL010).

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

Access this chapter

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

Similar content being viewed by others

Notes

  1. 1.

    www.openstreetmap.org.

References

  1. Mokbel, M.F., Chow, C.Y., Aref, W.G.: The new casper: query processing for location services without compromising privacy. In: VLDB, pp. 763–774 (2006)

    Google Scholar 

  2. Yiu, M.L., Jensen, C., Huang, X., Lu, H.: Spacetwist: managing the trade-offs among location privacy, query performance, and query accuracy in mobile systems. In: ICDE, pp. 366–375 (2008)

    Google Scholar 

  3. Wong, W.K., Cheung, D.Q., Kao, B., Manoulis, N.: Secure kNN Computation on encrypted databases. In: SIGMOD, pp. 139–152 (2009)

    Google Scholar 

  4. Khoshgozaran, A., Shahabi, C., Shirani-Mehr, H.: Location privacy: going beyond k-anonymity, cloaking and anonymizers. KAIS 26(1), 435–465 (2011)

    Google Scholar 

  5. Jung-Ho, U., Yong-Ki, K., Hyun-Jo, L., Miyoung, J., Jae-Woo, C.: K nearest neighbor query processing algorithm for cloaking regions towards user privacy protection in location-based services. J. Syst. Archit. EUROMICRO J. 58(9), 354–371 (2012)

    Article  Google Scholar 

  6. Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: FOCS, pp. 364–373 (1997)

    Google Scholar 

  7. Papadopoulos, S., Bakiras, S., Papadias, D.: Nearest neighbor search with strong location privacy. Proc. VLDB 3, 619–629 (2010)

    Article  Google Scholar 

  8. Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., Tan, K.-L.: Private queries in location based services: anonymizers are not necessary. In: SIGMOD (2008)

    Google Scholar 

  9. Mouratidis, K., Yiu, M.L.: Shortest path computation with no information leakage. PVLDB 5(1), 692–703 (2012)

    Google Scholar 

  10. Beimel, A., Ishai, Y., Kushilevitz, E., Raymond, J.-F.: Breaking the O(n1/(2k–1)) barrier for information-theoretic private information retrieval. In: Proceedings of FOCS, pp. 261–270 (2002)

    Google Scholar 

  11. Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. JACM 45(6), 965–981 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  12. Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803–815. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Wang, L., Meng, X., Hu, H., Xu, J.: Bichromatic reverse nearest neighbor query without information leakage. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 609–624. Springer, Heidelberg (2015)

    Google Scholar 

  14. Williams, P., Sion, R.: Usable PIR. In: NDSS (2008)

    Google Scholar 

  15. Naor, M., Pinkas, B.: Oblivious transfer with adaptive queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 573–590. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  16. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  17. Paulet, R., Kaosar, Md.G., Yi, X., Bertino, E.: Privacy-preserving and content-protecting location based queries. In: ICDE, pp. 44–53 (2012)

    Google Scholar 

  18. Yi, X., Paulet, R., Bertino, E., Varadharajan, V.: Practical k nearest neighbor queries with location privacy. In: ICDE, pp. 640–651 (2014)

    Google Scholar 

  19. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  20. Goldberg, A.V., Harrelson, C.: Computing the shortest path: A* search meets graph theory. In: SODA, pp. 156–165 (2005)

    Google Scholar 

  21. Lee, K.C.K., Lee, W.-C., Zheng, B.: Fast object search on road networks. In: EDBT, pp. 1018–1029 (2009)

    Google Scholar 

  22. Kolahdouzan, M., Shahabi, C.: Voronoi-based K nearest neighbor search for spatial network databases. In: VLDB, pp. 840–851 (2004)

    Google Scholar 

  23. Hu, H., Lee, D.-L., Xu, J.: Fast nearest neighbor search on road networks. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 186–203. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  24. Safar, M.: K nearest neighbor search in navigation systems. Mob. Inf. Syst. 1(3), 207–224 (2005)

    Google Scholar 

  25. Narayanan, A., Shmatikov, V.: Robust De-anonymization of large sparse datasets. In: IEEE Symposium on Security and Privacy, pp 111–125 (2008)

    Google Scholar 

  26. Jensen, C., Kolarvr, J., Pedersen, T.B., Timko, I.: Nearest neighbor queries in road networks. In: GIS, pp. 1–8 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiaofeng Meng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, L., Ma, R., Meng, X. (2015). Evaluating k Nearest Neighbor Query on Road Networks with no Information Leakage. In: Wang, J., et al. Web Information Systems Engineering – WISE 2015. WISE 2015. Lecture Notes in Computer Science(), vol 9418. Springer, Cham. https://doi.org/10.1007/978-3-319-26190-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26190-4_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26189-8

  • Online ISBN: 978-3-319-26190-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics