CoChat

Optimal Geo-Indistinguishable Mechanisms for Location Privacy

Open access
Bordenabe, Nicolás E., Chatzikokolakis, Konstantinos, Palamidessi, Catuscia · 2014 · Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security
Cited by 221

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

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 ofgeo-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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/2660267.2660345

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 221

Metadata

Authors
Bordenabe, N. E., Chatzikokolakis, K., & Palamidessi, C.
Venue
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security
Publisher
ACM
Published
2014-11-03
Pages
251-262
OpenAlex
W1994952354
Cited by
221
References
3
FWCI
8.50
Type
conference paper
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Optimal Geo-Indistinguishable Mechanisms for Location Privacy. https://app.cochat.ai/papers/10.1145/2660267.2660345
The paper
Bordenabe, N. E., Chatzikokolakis, K., & Palamidessi, C. (2014). Optimal Geo-Indistinguishable Mechanisms for Location Privacy. Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security. https://doi.org/10.1145/2660267.2660345

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.