English

Privacy Under Hard Distortion Constraints

Information Theory 2018-06-04 v1 math.IT

Abstract

We study the problem of data disclosure with privacy guarantees, wherein the utility of the disclosed data is ensured via a \emph{hard distortion} constraint. Unlike average distortion, hard distortion provides a deterministic guarantee of fidelity. For the privacy measure, we use a tunable information leakage measure, namely \textit{maximal α\alpha-leakage} (α[1,]\alpha\in[1,\infty]), and formulate the privacy-utility tradeoff problem. The resulting solution highlights that under a hard distortion constraint, the nature of the solution remains unchanged for both local and non-local privacy requirements. More precisely, we show that both the optimal mechanism and the optimal tradeoff are invariant for any α>1\alpha>1; i.e., the tunable leakage measure only behaves as either of the two extrema, i.e., mutual information for α=1\alpha=1 and maximal leakage for α=\alpha=\infty.

Keywords

Cite

@article{arxiv.1806.00063,
  title  = {Privacy Under Hard Distortion Constraints},
  author = {Jiachun Liao and Oliver Kosut and Lalitha Sankar and Flavio P. Calmon},
  journal= {arXiv preprint arXiv:1806.00063},
  year   = {2018}
}

Comments

5 pages, 1 figure

R2 v1 2026-06-23T02:15:17.928Z