๐ค AI Summary
This work investigates high-probability information leakage bounds of the Gaussian mechanism under arbitrary post-processing, formalized through the pointwise maximal leakage (PML) envelope. For Gaussian priors, the authors derive, for the first time, a closed-form expression for the PML envelope under small failure probabilities and extend this result to general unbounded secrets. Leveraging the BrascampโLieb inequality, they further establish that strongly log-concave priors satisfy the same leakage envelope as the Gaussian case. By integrating tools from information theory, probability theory, and differential privacy, this study provides tight PML bounds for the Gaussian mechanism under both Gaussian and strongly log-concave priors, offering a precise characterization of high-probability information leakage.
๐ Abstract
We study the pointwise maximal leakage (PML) envelope of the Gaussian mechanism, which characterizes the smallest information leakage bound that holds with high probability under arbitrary post-processing. For the Gaussian mechanism with a Gaussian secret, we derive a closed-form expression for the deterministic PML envelope for sufficiently small failure probabilities. We then extend this result to general unbounded secrets by identifying a sufficient condition under which the envelope coincides with the Gaussian case. In particular, we show that strongly log-concave priors satisfy this condition via an application of the Brascamp-Lieb inequality.