Advertisement

Protecting privacy for distance and rank based group nearest neighbor queries

  • Tanzima Hashem
  • Lars Kulik
  • Kotagiri Ramamohanarao
  • Rui Zhang
  • Subarna Chowdhury Soma
Article
  • 35 Downloads

Abstract

This paper proposes a novel approach to safeguarding location privacy for GNN (group nearest neighbor) queries. Given the locations of a group of dispersed users, the GNN query returns the location that minimizes the total or the maximal distance for all group users. The returned location is typically a meeting place such as a cinema or coffee shop where the group would like to meet. In our work, we highlight the challenges for private GNN queries and propose a general framework that have two key features: (i) it ensures privacy in a decentralized manner and (ii) can compute an optimal location for GNN query that maximizes the group’s overall preference for the meeting place. To mask their precise locations, we assume that user locations are given as regions to a location-based service provider (LSP). The LSP computes then a set of candidate answers (i.e., meeting places) for the GNN query. We identify two privacy attacks on the user locations, the distance intersection attack and the rank disclosure attack. These attacks are possible when the answer of a GNN query is determined from the candidate answers in a straightforward manner. We develop private filters that prevent these attacks and compute the GNN from the retrieved candidate answers. Our decentralized approach ensures that neither the users nor the LSP can learn the location of any group member. Our algorithms compute from the candidate set an optimal meeting place given the group members’ imprecise locations. Our key insight to an efficient computation is to prune the meeting places that cannot be GNNs given the locations of the group members within the search region. A comprehensive experimental evaluation shows the effectiveness of our approach to answering private GNN queries.

Keywords

Group nearest neighbor queries Location based services Privacy 

References

  1. 1.
    Ahmad, S., Kamal, R., Ali, M.E., Qi, J., Scheuermann, P., Tanin, E.: The flexible group spatial keyword query. In: ADC, pp. 3–16 (2017)Google Scholar
  2. 2.
    Ashouri-Talouki, M., Baraani-Dastjerdi, A., Selçuk, A.A.: Glp A cryptographic approach for group location privacy. Comput. Commun. 35(12), 1527–1533 (2012)CrossRefGoogle Scholar
  3. 3.
    Ashouri-Talouki, M., Baraani-Dastjerdi, A., Selċuk, A.A.: The cloaked-centroid protocol: location privacy protection for a group of users of location-based services. Knowl. Inf. Syst. 45(3), 589–615 (2015)CrossRefGoogle Scholar
  4. 4.
    Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An efficient and robust access method for points and rectangles. SIGMOD Rec. 19(2), 322–331 (1990)CrossRefGoogle Scholar
  5. 5.
    Bettini, C., Mascetti, S., Wang, X.S., Jajodia, S.: Anonymity in location-based services: Towards a general framework. In: MDM, pp. 69–76 (2007)Google Scholar
  6. 6.
    Bickson, D., Dolev, D., Bezman, G., Pinkas, B.: Peer-to-peer secure multi-party numerical computation. In: P2P, pp. 257–266 (2008)Google Scholar
  7. 7.
    Bilogrevic, I., Jadliwala, M., Kalkan, K., Hubaux, J. -P., Aad, I.: Privacy in mobile computing for location-sharing-based services. In: PETS, pp. 77–96 (2011)Google Scholar
  8. 8.
    Chow, C.-Y., Mokbel, M.F., Liu, X.: A peer-to-peer spatial cloaking algorithm for anonymous location-based services. In: GIS, pp. 171–178 (2006)Google Scholar
  9. 9.
  10. 10.
    Fischer, I., Gotsman, C.: Fast approximation of high-order voronoi diagrams and distance transforms on the gpu. J. Graph. Tools 11(4), 39–60 (2006)CrossRefGoogle Scholar
  11. 11.
    Freudiger, J., Shokri, R., Hubaux, J.: Evaluating the privacy risk of location-based services. In: Financial cryptography and data security, pp. 31–46 (2011)Google Scholar
  12. 12.
    Gedik, B., Liu, L.: Protecting location privacy with personalized k-anonymity: Architecture and algorithms. TMC 7(1), 1–18 (2008)Google Scholar
  13. 13.
    Ghinita, G., Kalnis, P., Skiadopoulos, S.: Mobihide: A mobile peer-to-peer system for anonymous location-based queries. In: SSTD, pp. 221–238 (2007)Google Scholar
  14. 14.
    Ghinita, G., Kalnis, P., Skiadopoulos, S.: Privé Anonymous location-based queries in distributed mobile systems. In: WWW, pp. 371–389 (2007)Google Scholar
  15. 15.
    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 (2008)Google Scholar
  16. 16.
    Ghinita, G., Damiani, M.L., Silvestri, C., Bertino, E.: Preventing velocity-based linkage attacks in location-aware applications. In: GIS, pp. 246–255 (2009)Google Scholar
  17. 17.
  18. 18.
    Gruteser, M., Grunwald, D.: Anonymous usage of location-based services through spatial and temporal cloaking. In: MobiSys, pp. 31–42 (2003)Google Scholar
  19. 19.
    Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)Google Scholar
  20. 20.
    Hashem, T., Kulik, L.: Safeguarding location privacy in wireless ad-hoc networks. In: Ubicomp, pp. 372–390 (2007)Google Scholar
  21. 21.
    Hashem, T., Kulik, L., Zhang, R.: Privacy preserving group nearest neighbor queries. In: EDBT, pp. 489–500 (2010)Google Scholar
  22. 22.
    Hashem, T., Kulik, L: “Don’t trust anyone”: Privacy protection for location-based services. Perv. Mob. Comput. 7, 44–59 (2011)CrossRefGoogle Scholar
  23. 23.
    Hashem, T., Ali, M.E., Kulik, L., Tanin, E., Quattrone, A.: Protecting privacy for group nearest neighbor queries with crowdsourced data and computing. In: UbiComp, pp. 559–562 (2013)Google Scholar
  24. 24.
    Hashem, T., Hashem, T., Ali, M.E., Kulik, L.: Group trip planning queries in spatial databases. In: SSTD, pp. 259–276 (2013)Google Scholar
  25. 25.
    Hashem, T., Kulik, L., Zhang, R.: Countering overlapping rectangle privacy attack for moving knn queries. Inf. Syst. 38(3), 430–453 (2013)CrossRefGoogle Scholar
  26. 26.
    Hashem, T., Barua, S., Ali, M.E., Kulik, L., Tanin, E.: Efficient computation of trips with friends and families. In: CIKM, pp. 931–940 (2015)Google Scholar
  27. 27.
    Hjaltason, G.R., Samet, H.: Ranking in spatial databases. In: SSD, pp. 83–95 (1995)Google Scholar
  28. 28.
    Hu, H., Lee, D.L.: Range nearest-neighbor query. TKDE 18(1), 78–91 (2006)Google Scholar
  29. 29.
    Hu, H., Xu, J.: Non-exposure location anonymity. In: ICDE, pp. 1120–1131 (2009)Google Scholar
  30. 30.
    Huang, Y., Vishwanathan, R.: Privacy preserving group nearest neighbour queries in location-based services using cryptographic techniques. In: GLOBECOM, pp. 1–5 (2010)Google Scholar
  31. 31.
    Huang, J., Peng, M., Wang, H., Cao, J., Gao, W., Zhang, X.: A probabilistic method for emerging topic tracking in microblog stream. World Wide Web 20(2), 325–350 (2017)CrossRefGoogle Scholar
  32. 32.
    Jahan, R., Hashem, T., Barua, S.: Group trip scheduling (GTS) queries in spatial databases. In: EDBT, pp. 390–401 (2017)Google Scholar
  33. 33.
    Khoshgozaran, A., Shahabi, C.: Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy. In: SSTD, pp. 239–257 (2007)Google Scholar
  34. 34.
    Li, H., Lu, H., Huang, B., Huang, Z.: Two ellipse-based pruning methods for group nearest neighbor queries. In: GIS, pp. 192–199 (2005)Google Scholar
  35. 35.
    Li, F., Yao, B., Kumar, P.: Group enclosing queries. TKDE 23(10), 1526–1540 (2011)Google Scholar
  36. 36.
    Li, M., Sun, X., Wang, H., Zhang, Y., Zhang, J.: Privacy-aware access control with trust management in Web service. World Wide Web 14(4), 407–430 (2011)CrossRefGoogle Scholar
  37. 37.
    Li, Y., Li, F., Yi, K., Yao, B., Wang, M.: Flexible aggregate similarity search. In: SIGMOD, pp. 1009–1020 (2011)Google Scholar
  38. 38.
    Li, J., Thomsen, J.R., Yiu, M.L., Mamoulis, N.: Efficient notification of meeting points for moving groups via independent safe regions. TKDE 27(7), 1767–1781 (2015)Google Scholar
  39. 39.
  40. 40.
    Luo, Y., Chen, H., Furuse, K., Ohbo, N.: Efficient methods in finding aggregate nearest neighbor by projection-based filtering. In: ICCSA, pp. 821–833 (2007)Google Scholar
  41. 41.
    Microsoft. Location & privacy: Where are we headed?, 2011 (accessed September 30, 2017). https://news.microsoft.com/location_and_privacy_where_are_we_headed__web
  42. 42.
    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
  43. 43.
    Namnandorj, S., Chen, H., Furuse, K., Ohbo, N.: Efficient bounds in finding aggregate nearest neighbors. In: DEXA, pp. 693–700 (2008)Google Scholar
  44. 44.
    Papadias, D., Shen, Q., Tao, Y., Mouratidis, K.: Group nearest neighbor queries. In: ICDE, p. 301 (2004)Google Scholar
  45. 45.
    Papadias, D., Tao, Y., Mouratidis, K., Hui, C.K.: Aggregate nearest neighbor queries in spatial databases. TODS 30(2), 529–576 (2005)CrossRefGoogle Scholar
  46. 46.
    Peng, M., Zeng, G., Sun, Z., Huang, J, Wang, H., Tian, G.: Personalized app recommendation based on app permissions. World Wide Web (2017)Google Scholar
  47. 47.
    Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. In: SIGMOD, pp. 71–79 (1995)Google Scholar
  48. 48.
    Schlegel, R., Chow, C., Huang, Q., Wong, D.S.: User-defined privacy grid system for continuous location-based services. TMC 14(10), 2158–2172 (2015)Google Scholar
  49. 49.
    Strassman, M., Collier, C.: Case study: The development of the find friends application. In: Location-Based Services, pp. 27–40 (2004)Google Scholar
  50. 50.
    Sun, X., Wang, H., Li, J., Truta, T.M.: Enhanced p-sensitive k-anonymity models for privacy preserving data publishing. Trans. Data Privacy 1(2), 53–66 (2008)MathSciNetGoogle Scholar
  51. 51.
    Wang, H., Zhang, Z., Taleb, T.: Special issue on security and privacy of iot. World Wide Web, 1–6 (2017)Google Scholar
  52. 52.
    Xue, M., Kalnis, P., Pung, H.K.: Location diversity: Enhanced privacy protection in location based services. In: International Symposium on Location and Context Awareness, pp. 70–87 (2009)Google Scholar
  53. 53.
    Yi, X., Paulet, R., Bertino, E., Varadharajan, V.: Practical approximate k nearest neighbor queries with location and query privacy. TKDE 28(6), 1546–1559 (2016)Google Scholar
  54. 54.
    Yiu, M.L., Jensen, C.S., Huang, X., Lu, H.: Spacetwist: Managing the trade-offs among location privacy, query performance, and query accuracy in mobile services. In: ICDE, pp. 366–375 (2008)Google Scholar
  55. 55.
    Zhang, J., Tao, X., Wang, H.: Outlier detection from large distributed databases. World Wide Web 17(4), 539–568 (2014)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • Tanzima Hashem
    • 1
  • Lars Kulik
    • 2
  • Kotagiri Ramamohanarao
    • 2
  • Rui Zhang
    • 2
  • Subarna Chowdhury Soma
    • 1
  1. 1.Department of Computer Science and EngineeringBangladesh University of Engineering and TechnologyDhakaBangladesh
  2. 2.Department of Computing and Information SystemUniversity of MelbourneMelbourneAustralia

Personalised recommendations