Optimal Geo-Indistinguishable Mechanisms for Location Privacy

Abstract

We consider the geo-indistinguishability approach to location privacy, and the trade-off with respect to utility. We show that, given a desired degree of geo-indistinguishability, it is possible to construct a mechanism that minimizes the service quality loss, using linear programming techniques. In addition we show that, under certain conditions, such mechanism also provides optimal privacy in the sense of Shokri et al. Furthermore, we propose a method to reduce the number of constraints of the linear program from cubic to quadratic, maintaining the privacy guarantees and without affecting significantly the utility of the generated mechanism. This reduces considerably the time required to solve the linear program, thus enlarging significantly the location sets for which the optimal mechanisms can be computed.

13 pages

References in corpus (1)

• Geo-Indistinguishability: Differential Privacy for Location-Based Systems

Cited by in corpus (13)

• The Long Road to Computational Location Privacy: A Survey
• Protecting Spatiotemporal Event Privacy in Continuous Location-Based Services
• Local Obfuscation Mechanisms for Hiding Probability Distributions
• PRIVIC: A privacy-preserving method for incremental collection of location data
• DPIVE: A Regionalized Location Obfuscation Scheme with Personalized Privacy Levels
• Locality Sensitive Hashing with Extended Differential Privacy
• A privacy preserving querying mechanism with high utility for electric vehicles
• On the Anonymization of Differentially Private Location Obfuscation
• Optimal noise functions for location privacy on continuous regions
• Where have you been? A Study of Privacy Risk for Point-of-Interest Recommendation
• Toward a Secure Crowdsourced Location Tracking System
• Optimizing noise level for perturbing geo-location data
• Metric Differential Privacy at the User-Level Via the Earth Mover's Distance