Optimal Geo-Indistinguishable Mechanisms for Location Privacy
Open accessThe 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.
Integrity signals
Registry
Cites
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.
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
Calibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., & Zemel, R. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090255 · Cited by 3,501
Understanding mobility based on GPS data
Zheng, Y., Li, Q., Chen, Y., Xie, X., & Ma, W.-Y. (2008) · Proceedings of the 10th international conference on Ubiquitous computing · doi:10.1145/1409635.1409677 · Cited by 1,132
Cited by
A Privacy-Preserving Querying Mechanism with High Utility for Electric Vehicles
Atmaca, U. I., Biswas, S., Maple, C., & Palamidessi, C. (2024) · IEEE Open Journal of Vehicular Technology · doi:10.1109/ojvt.2024.3360302 · Cited by 9
“…x , x (cid:2) ∈ X , and all y ∈ Y , we have Recently, GeoI [16], a variant of the local DP capturing the essence of the distance between locations [17], [18] has been in focus as a standard for privacy protection for location-based services, being motivated by the idea of preserving the best…”
BackgroundA Privacy-Preserving Crowd Flow Prediction Framework Based on Federated Learning during Epidemics
Wang, W., Yang, G., Bao, L., Ma, K., & Zhou, H. (2022) · Security and Communication Networks · doi:10.1155/2022/8712597 · Cited by 5
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.