Privacy Preserving Group Nearest Neighbour Queries in Location-Based Services Using Cryptographic Techniques

Huang, Yan; Vishwanathan, Roopa

doi:10.1109/glocom.2010.5683308

Cited by 19 publications

(21 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the distributed architecture, users protect their privacy by working collaboratively (Domingo-Ferrer, 2006) or autonomously (Olumofin et al, 2010;Huang and Vishwanathan, 2010;Durr et al, 2011). Domingo-Ferrer (2006) proposed a collaborative algorithm, in which a user broadcasts his perturbed location to form a group with k À 1 neighbors.…”

Section: Distributed Privacy-preserving Architecturementioning

confidence: 99%

A fast privacy-preserving framework for continuous location-based queries in road networks

Wang

Xia

Hou

et al. 2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Section: Distributed Privacy-preserving Architecturementioning

confidence: 99%

A fast privacy-preserving framework for continuous location-based queries in road networks

Wang

Xia

Hou

et al. 2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

“…The solution has high communication overhead and cannot resist the collusion attack. In the same year, [15] proposed two schemes with centralized and distributed architecture, respectively, in the application of the GNN query. It adopts the multiparty computation to compute the object location so as to get the smallest sum of distances between the object location and all the users in the group.…”

Section: Related Workmentioning

confidence: 99%

“…Both of the schemes in [3,15] adopt the method of computing the distance sum to obtain the group center and need to get the candidate target locations and each user's anonymous region in advance. Taking [3] as an example, the number of the query nodes is the number of the users in the group.…”

Section: Characteristics Analysis As Shown Inmentioning

confidence: 99%

A New Group Location Privacy-Preserving Method Based on Distributed Architecture in LBS

Wang

Han

Yang

et al. 2019

Security and Communication Networks

View full text Add to dashboard Cite

Nowadays, the location privacy problem has become an important problem for the users who enjoy the location-based services (LBSs). Researchers have focused on the problem of how to protect the location privacy of user efficiently for a long time. On one hand, many achievements adopt the centralized structure in which there is an additional center server. Additionally, some other researchers adopt the distributed structure to overcome the disadvantages brought by the center server in the centralized anonymous system structure. On the other hand, the existing methods of solving the problem are always to protect the individual user’s location privacy in LBSs, without considering the user group’s location privacy. This kind of methods is not very applicable to the status of a number of users who formed a group to complete a LBS task together by collaborative computing. In order to solve the problem of location privacy protection for a user group in the untrusted mobile social networks, a location privacy protection method based on the distributed structure is discussed in this paper. In the scheme, the special homomorphic features of BGN cryptosystem are cleverly used so that it can solve the group’s three classical location service applications simultaneously, namely, group nearest neighbor query, optimal group collection point determination, and group friend’s distance query, by only one security policy. If there are k users who formed the group, it could achieve k-anonymity without exposing the coordinate of each individual user or using any anonymous areas. Furthermore, theoretical and experimental analysis proves that the proposal can efficiently protect each user’s location privacy in the group through taking full advantage of the collaborative computing and communication capabilities of the mobile terminals. It can resist the existing distance interaction attack and collusion attack and can realize the secure and efficient fine-grained controllable location privacy protection for the user group.

show abstract

“…To the best of our knowledge, there are only 2 papers on the subject of group location privacy: one written by Huang and Vishwanathan [29] and the other by Hashem et al [6], which has 2 phases.…”

Section: Related Workmentioning

confidence: 99%

“…Huang and Vishwanathan's method [29], based on a garbled circuit (GC) and oblivious transfer (OT), assumes that the group members know the set of candidate POIs and presents a cryptographic solution to find the nearest POI from the members' locations. In this method, there are 2 special users: a creator who creates the encrypted circuit and an evaluator who evaluates the circuit.…”

Section: Related Workmentioning

confidence: 99%

Preserving Location Privacy for a Group of Users

Ashouri-Talouki¹,

Baraani-Dastjerdi²,

Selçuk³

2013

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Location privacy is an interesting problem that has been receiving considerable attention. This problem has been widely discussed from the individual point of view; however, there exist only a few works that support location privacy for a group of users. In this paper we consider the problem of supporting location privacy for a group of users during the use of location-based services (LBSs). We assume a group of users who want to benefit from a LBS and find the nearest meeting place that minimizes their aggregate distance. Each user in this scenario wants to protect his or her location from the LBS, outside attackers, and other group members. We show that individual solutions for location privacy cannot be directly applied to the group location privacy problem and a special solution must be developed. We identify the privacy issues for this group scenario and propose a resource-aware solution in order to satisfy these group privacy issues. Our solution is based on secure multiparty computation and the anonymous veto network protocol. The proposed protocol decreases the number of group queries to a large extent, as it only sends a single query to the LBS.Consequently, the LBS overhead to evaluate the query and the size of the LBS result are significantly decreased. The proposed protocol also protects the LBS from the excessive disclosure of points of interest and the LBS provider only needs to apply an existing private nearest neighbor (NN) query algorithm instead of an aggregate NN query algorithm.The performance and security analysis show that the protocol is secure against a partial collusion attack and a denialof-service attack in a malicious model.

show abstract

Privacy Preserving Group Nearest Neighbour Queries in Location-Based Services Using Cryptographic Techniques

Cited by 19 publications

References 10 publications

A fast privacy-preserving framework for continuous location-based queries in road networks

A fast privacy-preserving framework for continuous location-based queries in road networks

A New Group Location Privacy-Preserving Method Based on Distributed Architecture in LBS

Preserving Location Privacy for a Group of Users

Contact Info

Product

Resources

About