Metric Differential Privacy at the User-Level Via the Earth Mover's Distance

TL;DR

This paper introduces a new approach to user-level metric differential privacy using the earth mover's distance, providing mechanisms with improved utility for linear and frequency queries.

Contribution

It develops novel mechanisms for user-level metric DP with earth mover's distance, including a reduction from unbounded to bounded datasets and utility improvements.

Findings

Designed two mechanisms for $d_{EM}$-DP answering queries

Generalized privacy amplification by shuffling for item-wise queries

Achieved improved utility over existing user-level DP mechanisms

Abstract

Metric differential privacy (DP) provides heterogeneous privacy guarantees based on a distance between the pair of inputs. It is a widely popular notion of privacy since it captures the natural privacy semantics for many applications (such as, for location data) and results in better utility than standard DP. However, prior work in metric DP has primarily focused on the item-level setting where every user only reports a single data item. A more realistic setting is that of user-level DP where each user contributes multiple items and privacy is then desired at the granularity of the user's entire contribution. In this paper, we initiate the study of one natural definition of metric DP at the user-level. Specifically, we use the earth-mover's distance ($d_\textsf{EM}$) as our metric to obtain a notion of privacy as it captures both the magnitude and spatial aspects of changes in a user's data. We make three main technical contributions. First, we design two novel mechanisms under $d_\textsf{EM}$-DP to answer linear queries and item-wise queries. Specifically, our analysis for the latter involves a generalization of the privacy amplification by shuffling result which may be of independent interest. Second, we provide a black-box reduction from the general unbounded to bounded $d_\textsf{EM}$-DP (size of the dataset is fixed and public) with a novel sampling based mechanism. Third, we show that our proposed mechanisms can provably provide improved utility over user-level DP, for certain types of linear queries and frequency estimation.