Skip to main content
SpringerLink
Log in

Efficient privacy-preserving group-nearest-neighbor queries with the presence of active adversaries

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Location-based services (LBSs) allow users to ask location-dependent queries and receive information based on their location. A group of users can send a group-nearest-neighbor (GNN) query in order to receive a Point Of Interest (POI). This POI in turn shows a point which is the minimum distance from all members of the group. To benefit from these services, it is important to preserve the location privacy of each group user from others in the group (Intragroup location privacy) as well as from anyone outside of the group, including the LBS, (Intergroup location privacy). It may also be necessary to protect the location privacy of the resulting POI from the LBS and other possible attackers. In this paper, we propose two different privacy-preserving protocols for finding the exact answer to a GNN query among a set of returned POIs. The first protocol assumes a semi-honest model while the second one works in a malicious model. The proposed protocols are based on the Anonymous Veto network and Burmester–Desmedt key establishment protocols. The security analysis shows that the proposed protocols provide both Intragroup and Intergroup location privacy; they also protect the location privacy of the resulting POI and are resistant to collusion and multi-point aggregate distance attacks. The performed analyses indicate that they incur a constant computation cost per user and are efficient in terms of computation and communication costs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Notes

  1. Group Location Privacy.

References

  1. Papadias, D., Tao, Y., Mouratidis, K., & Kit Hui, C. (2005). Aggregate nearest neighbor queries in spatial databases. ACM Transactions on Database Systems (TODS), 30(2), 529–576.

    Article  Google Scholar 

  2. Ashouri-Talouki, M., Baraani-Dastjerdi, A., & Selçuk, A. A. (2012). GLP: A cryptographic approach for group location privacy. Computer Communications, 35(12), 1527–1533.

    Article  Google Scholar 

  3. Hashem, T., Kulik, L., & Zhang, R. (2010). Privacy preserving group nearest neighbor queries. In Proceedings of the 13th ACM international conference on extending database technology (pp. 489–500).

  4. Huang, Y., & Vishwanathan, R. (2010). Privacy preserving group nearest neighbour queries in location-based services using cryptographic techniques. In IEEE GLOBECOM (pp. 1–5).

  5. Ashouri-Talouki, M., Baraani-Dastjerdi, A. B., & Selçuk, A. A. (2013). Preserving location privacy for a group of users. Turkish Journal of Electrical Engineering & Computer Sciences, 21, 1857–1870.

    Google Scholar 

  6. Ashouri-Talouki, M., Baraani-Dastjerdi, A. B., & Selçuk, A. A. (2015). The Cloaked-Centroid protocol: Location privacy protection for a group of users of location-based services. Knowledge and Information Systems, 45(3), 589–615.

    Article  Google Scholar 

  7. Khan, A. M. R., Hashem, T., Tanin, E., & Kulik, L. (2014). Location oblivious privacy protection for group nearest neighbor queries. In GIScience’14. Lecture notes in computer science (Vol. 8728, pp. 301–317).

  8. Hao, F., & Zielinski, P. (2006). A 2-round anonymous veto protocol. In Proceedings of the 14th international workshop on security protocols, Cambridge. Lecture notes in computer science (Vol. 5087, pp. 202–211).

  9. Paillier, P., & Pointcheval, D. (1999). Efficient public-key cryptosystems provably secure against active adversaries. In Advances in cryptology (ASIACRYPT).

  10. Burmester, M., & Desmedt, Y. (1994). A secure and efficient conference key distribution system. In Advances in cryptology (EUROCRYPT’94) (pp. 275–286).

  11. Sheikh, R., Kumar, B., & Mishra, D. K. (2010). A Distributed k-secure sum protocol for secure multi-party computations. Journal of Computing, 2(3), 68–72.

    Google Scholar 

  12. Jung, T., & Li, X. Y. (2015). Collusion-tolerable privacy-preserving sum and product calculation without secure channel. IEEE Transactions on Dependable and Secure Computing, 12(1), 45–57.

    Article  Google Scholar 

  13. Schnorr, C. P. (1991). Efficient signature generation by smart cards. Journal of Cryptology, 4(3), 161–174.

    Article  Google Scholar 

  14. Beresford, A. R., & Stajano, F. (2004). Mix zones: User privacy in location-aware services. In Proceedings of the second IEEE annual conference on pervasive computing and communications workshops, 2004.

  15. Gedik, B., & Liu, L. (2008). Protecting location privacy with personalized k-anonymity: Architecture and algorithms. IEEE Transactions on Mobile Computing, 7(1), 1–18.

    Article  Google Scholar 

  16. Chow, C. Y., Mokbel, M. F., & Liu, X. (2006). A peer to peer spatial cloaking algorithm for anonymous location based services. In GIS ‘06 Proceedings of the 14th annual ACM international symposium on advances in geographic information systems (pp. 171–178). ACM.

  17. Bao, J., Chen, H., & Ku, W. S. (2009). PROS: A peer-to-peer system for location privacy protection on road networks. In ACM GIS’. ACM.

  18. Hu, H., & Xu, J. (2009). Non-exposure location anonymity. In IEEE international conference on data engineering (ICDE’09) (pp. 1120–1131).

  19. Solanas, A., & Balleste, A. M. (2008). A TTP-free protocol for location privacy in location-based services. Computer Communications, 31, 1181–1191.

    Article  Google Scholar 

  20. Chow, C. Y., Mokbel, M. F., & Aref, W. G. (2009). Casper*: Query processing for location services without compromising privacy. ACM Transactions on Database Systems (TODS), 34(4), 1–48.

    Article  Google Scholar 

  21. Chow, C. Y., Mokbel, M. F., & Liu, X. (2011). Spatial cloaking for anonymous location-based services in mobile peer-to-peer environments. GeoInformatica, 15(2), 351–380.

    Article  Google Scholar 

  22. Ghinita, G., Kalnis, P., & Skiadopoulos, S. (2007). MobiHide: A mobile peer-to-peer system for anonymous location-based queries. In Proceedings of international symposium on advances in spatial and temporal databases (SSTD’07) (pp. 221–238).

  23. Ghinita, G., Kalnis, P., & Skiadopoulos, S. (2007). PRIVÉ: Anonymous location-based queries in distributed mobile systems. In Proceedings of international conference on world wide web (pp. 371–389).

  24. Ghinita, G., Kalnis, P., Kantarcioglu, M., & Bertino, E. (2009). A hybrid technique for private location-based queries with database protection. In Proceedings of international symposium on advances in spatial and temporal databases (SSTD’09). Lecture notes in computer science (Vol. 5644, pp. 98–116).

  25. Ghinita, G., Kalnis, P., Khoshgozaran, A., Shahabi, C., & Tan, K.-L. (2008). Private queries in location based services: Anonymizers are not necessary. In Proceedings of the ACM international conference on management of data (SIGMOD’08) (pp. 121–132).

  26. Gruteser, M., & Grunwald, D. (2003). Anonymous usage of location-based services through spatial and temporal cloaking. In Proceedings of on mobile systems, applications and services (pp. 31–42).

  27. Kalnis, P., Ghinita, G., & Mouratidis, K. (2007). Preventing location-based identity inference in anonymous spatial queries. IEEE Transactions on Knowledge and Data Engineering, 19(12), 1719–1733.

    Article  Google Scholar 

  28. Khoshgozaran, A., Shahabi, C., & Shirani-Mehr, H. (2011). Location privacy: Going beyond K-anonymity, cloaking and anonymizers. Knowledge and Information Systems, 26(3), 435–465.

    Article  Google Scholar 

  29. Khoshgozaran, A., & Shahabi, C. (2007). Blind evaluation of nearest neighbor queries using space transformation to preserve location privacy. In Proceedings of international conference on advances in spatial and temporal databases (SSTD’07) (pp. 239–257).

  30. Mokbel, M. F. (2007). Privacy in location-based services: State-of-the-art and research directions. In IEEE international conference on mobile data management, MDM 2007, Mannheim, Germany (3-hours tutorial).

  31. Olumofin, F., Tysowski, P. K., Goldberg, I., & Hengartner, U. (2010). Achieving efficient query privacy for location based services. In Proceedings of the 10th international conference on privacy enhancing technologies (PETS’10) (pp. 93–110).

  32. Solanas, A., Domingo-Ferrer, J., Martínez-& Ballesté, A. (2008). Location privacy in location-based services: Beyond TTP-based schemes. In Proceeding of 1st international workshop on privacy in location-based applications (PILBA) within 13th European symposium on research in computer security (ESORICS) (pp. 12–23).

  33. Papadopoulos, S., Bakiras, S., & Papadias, D. (2010). Nearest neighbor search with strong location privacy. In Proceedings of the VLDB endowment (Vol. 3, No. 1–2).

  34. Naor, M., & Pinkas, B. (2001). Efficient oblivious transfer protocols. In ACM-SIAM symposium on discrete algorithms, SODA’01 (pp. 448–457). Society for Industrial and Applied Mathematics.

Download references

Author information

Authors and Affiliations

  1. Department of IT Engineering, Faculty of Computer Engineering, University of Isfahan, Isfahan, Iran

    Shadie Azizi, Maede Ashouri-Talouki & Hamid Mala

Authors
  1. Shadie Azizi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maede Ashouri-Talouki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hamid Mala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maede Ashouri-Talouki.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Azizi, S., Ashouri-Talouki, M. & Mala, H. Efficient privacy-preserving group-nearest-neighbor queries with the presence of active adversaries. Wireless Netw 25, 4799–4814 (2019). https://doi.org/10.1007/s11276-018-1768-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-018-1768-2

Keywords

Search

Navigation