Optimal geo-indistinguishable mechanisms for location privacy

Nicholás E. Bordenabe, Konstantinos Chatzikokolakis, Catuscia Palamidessi

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

227 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationProceedings of the 2014 ACM SIGSAC conference on computer and communications security
Place of PublicationNew York, N.Y.
PublisherAssociation for Computing Machinery
Number of pages12
ISBN (Print)9781450332392, 9781450329576
Publication statusPublished - 2014
Externally publishedYes
EventACM conference on computer and communications security (21st : 2014) - Arizona, USA
Duration: 3 Nov 20147 Nov 2014

Publication series

NameProceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)1543-7221


ConferenceACM conference on computer and communications security (21st : 2014)
CityArizona, USA


  • Location privacy
  • Location obfuscation
  • Geo-indistinguishability
  • Differential privacy
  • Linear optimization


Dive into the research topics of 'Optimal geo-indistinguishable mechanisms for location privacy'. Together they form a unique fingerprint.

Cite this