CRCYMay 4, 2020

PGLP: Customizable and Rigorous Location Privacy through Policy Graph

arXiv:2005.01263v213 citations
AI Analysis

This work addresses location privacy for users in real-world applications, offering a more flexible and secure approach, though it builds incrementally on differential privacy.

The authors tackled the problem of existing location privacy models lacking rigor or customizability by proposing PGLP, a policy graph-based location privacy notion that provides customizable and rigorous privacy guarantees, with experiments on real-world datasets verifying effective privacy-utility trade-offs and algorithm efficiency.

Location privacy has been extensively studied in the literature. However, existing location privacy models are either not rigorous or not customizable, which limits the trade-off between privacy and utility in many real-world applications. To address this issue, we propose a new location privacy notion called PGLP, i.e., \textit{Policy Graph based Location Privacy}, providing a rich interface to release private locations with customizable and rigorous privacy guarantee. First, we design the privacy metrics of PGLP by extending differential privacy. Specifically, we formalize a user's location privacy requirements using a \textit{location policy graph}, which is expressive and customizable. Second, we investigate how to satisfy an arbitrarily given location policy graph under adversarial knowledge. We find that a location policy graph may not always be viable and may suffer \textit{location exposure} when the attacker knows the user's mobility pattern. We propose efficient methods to detect location exposure and repair the policy graph with optimal utility. Third, we design a private location trace release framework that pipelines the detection of location exposure, policy graph repair, and private trajectory release with customizable and rigorous location privacy. Finally, we conduct experiments on real-world datasets to verify the effectiveness of the privacy-utility trade-off and the efficiency of the proposed algorithms.

Code Implementations3 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes