Collaborative Location Privacy

Shokri, Reza; Papadimitratos, Panos; Theodorakopoulos, George; Hubaux, Jean-Pierre

doi:10.1109/mass.2011.55

Cited by 40 publications

(35 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With only two rounds of communication, the user can get the exact -nearest neighbor POIs without the leakage of the location. The MobiCrowd algorithm [44] utilizes the buffer to guarantee that queries can be accomplished locally in order to reduce the communication cost.…”

Section: Spatial Transformationmentioning

confidence: 99%

Efficient Privacy-Preserving Protocol for k-NN Search over Encrypted Data in Location-Based Service

et al. 2017

View full text Add to dashboard Cite

With the development of mobile communication technology, location-based services (LBS) are booming prosperously. Meanwhile privacy protection has become the main obstacle for the further development of LBS. The -nearest neighbor ( -NN) search is one of the most common types of LBS. In this paper, we propose an efficient private circular query protocol (EPCQP) with high accuracy rate and low computation and communication cost. We adopt the Moore curve to convert two-dimensional spatial data into one-dimensional sequence and encrypt the points of interest (POIs) information with the Brakerski-Gentry-Vaikuntanathan homomorphic encryption scheme for privacy-preserving. The proposed scheme performs the secret circular shift of the encrypted POIs information to hide the location of the user without a trusted third party. To reduce the computation and communication cost, we dynamically divide the table of the POIs information according to the value of . Experiments show that the proposed scheme provides high accuracy query results while maintaining low computation and communication cost.

show abstract

Section: Spatial Transformationmentioning

confidence: 99%

Efficient Privacy-Preserving Protocol for k-NN Search over Encrypted Data in Location-Based Service

et al. 2017

View full text Add to dashboard Cite

show abstract

“…Cachecloak [23] uses cache prefetching to hide the exact location of the user by requesting the location based data along an entire predicted path. [33] proposes a collaborating strategy where users can have their LBS queries answered by nearby peers and thereby minimize the exposure of location information to the untrusted LBS. As discussed before, the approaches based on location cloaking do not work for applications that require identity or pseudo-identity of mobile users.…”

Section: Related Workmentioning

confidence: 99%

“…As discussed before, the approaches based on location cloaking do not work for applications that require identity or pseudo-identity of mobile users. Also the existing methods [23], [33] are not suitable for continuous location query services.…”

Section: Related Workmentioning

confidence: 99%

Attack-Resilient Mix-zones over Road Networks: Architecture and Algorithms

Palanisamy

Liu

2015

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-Continuous exposure of location information, even with spatially cloaked resolution, may lead to breaches of location privacy due to statistics-based inference attacks. An alternative and complementary approach to spatial cloaking based location anonymization is to break the continuity of location exposure by introducing techniques, such as mix-zones, where no application can trace user movements. Several factors impact on the effectiveness of mix-zone approach, such as user population, mix-zone geometry, location sensing rate and spatial resolution, as well as spatial and temporal constraints on user movement patterns. However, most of the existing mix-zone proposals fail to provide effective mix-zone construction and placement algorithms that are resilient to timing and transition attacks. This paper presents MobiMix, a road network based mix-zone framework to protect location privacy of mobile users traveling on road networks. It makes three original contributions. First, we provide the formal analysis on the vulnerabilities of directly applying theoretical rectangle mix-zones to road networks in terms of anonymization effectiveness and resilience to timing and transition attacks. Second, we develop a suite of road network mix-zone construction methods that effectively consider the above mentioned factors to provide higher level of resilience to timing and transition attacks, and yield a specified lower-bound on the level of anonymity. Third, we present a set of mix-zone placement algorithms that identify the best set of road intersections for mix-zone placement considering the road network topology, user mobility patterns and road characteristics. We evaluate the MobiMix approach through extensive experiments conducted on traces produced by GTMobiSim on different scales of geographic maps. Our experiments show that MobiMix offers high level of anonymity and high level of resilience to timing and transition attacks, compared to existing mix-zone approaches.

show abstract

“…MobiCrowd [14] mitigates the loss in location privacy by assuming users carry location-aware wireless devices capable of peer-to-peer communication, through which they can share regional data and, in this way, reduce the fraction of queries dispatched to the LBS. MobiCrowd devices are equipped with a mobile proxy that stores the results of LBS queries in a buffer.…”

Section: Introductionmentioning

confidence: 99%

“…In the first game, we study an elementary, two-agent interaction and use pure game theory to derive Nash and Pareto optimal equilibria. In the second, we analyze a complex, multi-agent interaction by using a modified version of the epidemic model in [14] to support threshold strategies and derive the optimal threshold that maximizes agents' payoffs.…”

Section: Introductionmentioning

confidence: 99%

Collaborative Location Privacy with Rational Users

Santos

Humbert

Shokri

et al. 2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Recent smartphones incorporate embedded GPS devices that enable users to obtain geographic information about their surroundings by providing a location-based service (LBS) with their current coordinates. However, LBS providers collect a significant amount of data from mobile users and could be tempted to misuse it, by compromising a customer's location privacy (her ability to control the information about her past and present location). Many solutions to mitigate this privacy threat focus on changing both the architecture of location-based systems and the business models of LBS providers. MobiCrowd does not introduce changes to the existing business practices of LBS providers, rather it requires mobile devices to communicate wirelessly in a peer-to-peer fashion. To lessen the privacy loss, users seeking geographic information try to obtain this data by querying neighboring nodes, instead of connecting to the LBS. However, such a solution will only function if users are willing to share regional data obtained from the LBS provider. We model this collaborative location-data sharing problem with rational agents following threshold strategies. Initially, we study agent cooperation by using pure game theory and then by combining game theory with an epidemic model that is enhanced to support threshold strategies to address a complex multi-agent scenario. From our game-theoretic analysis, we derive cooperative and non-cooperative Nash equilibria and the optimal threshold that maximizes agents' expected utility.

show abstract

Collaborative Location Privacy

Cited by 40 publications

References 24 publications

Efficient Privacy-Preserving Protocol for k-NN Search over Encrypted Data in Location-Based Service

Efficient Privacy-Preserving Protocol for k-NN Search over Encrypted Data in Location-Based Service

Attack-Resilient Mix-zones over Road Networks: Architecture and Algorithms

Collaborative Location Privacy with Rational Users

Contact Info

Product

Resources

About