Bichromatic Reverse Nearest Neighbor Query without Information Leakage

  • Lu Wang
  • Xiaofeng MengEmail author
  • Haibo Hu
  • Jianliang Xu
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9049)


Bichromatic Reverse Nearest Neighbor (BRNN) Query is an important query type in location-based services (LBS) and has many real life applications, such as site selection and resource allocation. However, such query requires the client to disclose sensitive location information to the LBS. The only existing method for privacy-preserving BRNN 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 retrieval (PIR) technique, which accesses data pages anonymously from a database. Based on PIR, we propose a secure query processing framework together with various indexing and optimization techniques. To the best knowledge, this is the first research that preserves strong location privacy in BRNN query. Extensive experiments under real world and synthetic datasets demonstrate the practicality of our approach.


Privacy preservation Location privacy Private information retrieval Bichromatic RNN 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Tian, F., Gui, X., Yang, P., Zhang, X., Yang, J.: Security analysis for hilbert curve based spatial data privacy-preserving method. In: 10th IEEE International Conference on High Performance Computing and Communications and 2013 IEEE International Conference on Embedded and Ubiquitous Computing, pp. 929–934, Zhangjiajie, China (2013)Google Scholar
  2. 2.
    Wicker, S.B.: The loss of location privacy in the cellular age. Commun. ACM 55(8), 60–68 (2012)CrossRefGoogle Scholar
  3. 3.
    Du, Y.: Privacy-aware RNN query processing on location-based services. In: 8th International Conference on Mobile Data Management, pp. 253–257, Mannheim, Germany (2007)Google Scholar
  4. 4.
    Williams, P., Sion, R.: Usable PIR. In: NDSS, San Diego, California, USA (2008)Google Scholar
  5. 5.
    Kushilevitz, E., Ostrovsky, R.: Replication is NOT needed: SINGLE database, computationally-private information retrieval. In: FOCS, pp. 364–373, Florida, USA (1997)Google Scholar
  6. 6.
    Papadopoulos, S., Bakiras, S., Papadias, D.: Nearest neighbor search with strong location privacy. In: VLDB, pp. 619–629 (2010)Google Scholar
  7. 7.
    Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., Tan, K.L.: Private queries in location based services: anonymizers are not necessary. In: SIGMOD, pp. 121–132, Vancouver, BC, Canada (2008)Google Scholar
  8. 8.
    Mouratidis, K., Yiu, M.L.: Shortest path computation with no information leakage. In: VLDB, pp. 692–703, Istanbul, Turkey (2012)Google Scholar
  9. 9.
    Stanoi, I., Riedewald, M., Agrawal, D. and Abbadi, A.E.: Discovery of influence sets in frequently updated databases. In: VLDB, pp. 99–108, Roma, Italy (2001)Google Scholar
  10. 10.
    Wong, W.K., Cheung, D.W.L., Kao, B., Mamoulis, N.: Secure kNN computation on encrypted databases. In: SIGMOD, pp. 139–152, Rhode Island, USA (2009)Google Scholar
  11. 11.
    Khoshgozaran, A., Shahabi, C.: Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 239–257. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  12. 12.
    Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. In: SIGMOD, pp. 201–212, Dallas, Texas, USA (2000)Google Scholar
  13. 13.
    Tran, Q.T., Taniar, D., Safar, M.: Bichromatic Reverse Nearest-Neighbor Search in Mobile Systems. J. IEEE SYSTEMS 4(2), 230–242 (2010)CrossRefGoogle Scholar
  14. 14.
    Kang, J.M., Mokbel, M.F., Shekhar, S., Xia, T. and Zhang, D.: Continuous evaluation of monochromatic and bichromatic reverse nearest neighbors. In: ICDE, pp. 806–815, Istanbul, Turkey (2007)Google Scholar
  15. 15.
    Chen, S., Jensen, C.S., Lin, D.: A benchmark for evaluating moving object indexes. In: VLDB, pp. 1574–1585, New Zealand (2008)Google Scholar
  16. 16.
    Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965–981 (1998)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Lu Wang
    • 1
  • Xiaofeng Meng
    • 1
    Email author
  • Haibo Hu
    • 2
  • Jianliang Xu
    • 2
  1. 1.School of InformationRenmin University of ChinaBeijingChina
  2. 2.Department of Computer ScienceHong Kong Baptist UniversityHong KongChina

Personalised recommendations