Rényi Pufferfish Privacy: General Additive Noise Mechanisms and Privacy Amplification by Iteration
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916280747950080 |
|---|---|
| author | Pierquin, Clément Bellet, Aurélien Tommasi, Marc Boussard, Matthieu |
| author_facet | Pierquin, Clément Bellet, Aurélien Tommasi, Marc Boussard, Matthieu |
| contents | Pufferfish privacy is a flexible generalization of differential privacy that allows to model arbitrary secrets and adversary's prior knowledge about the data. Unfortunately, designing general and tractable Pufferfish mechanisms that do not compromise utility is challenging. Furthermore, this framework does not provide the composition guarantees needed for a direct use in iterative machine learning algorithms. To mitigate these issues, we introduce a Rényi divergence-based variant of Pufferfish and show that it allows us to extend the applicability of the Pufferfish framework. We first generalize the Wasserstein mechanism to cover a wide range of noise distributions and introduce several ways to improve its utility. We also derive stronger guarantees against out-of-distribution adversaries. Finally, as an alternative to composition, we prove privacy amplification results for contractive noisy iterations and showcase the first use of Pufferfish in private convex optimization. A common ingredient underlying our results is the use and extension of shift reduction lemmas. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_13985 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Rényi Pufferfish Privacy: General Additive Noise Mechanisms and Privacy Amplification by Iteration Pierquin, Clément Bellet, Aurélien Tommasi, Marc Boussard, Matthieu Cryptography and Security Machine Learning Pufferfish privacy is a flexible generalization of differential privacy that allows to model arbitrary secrets and adversary's prior knowledge about the data. Unfortunately, designing general and tractable Pufferfish mechanisms that do not compromise utility is challenging. Furthermore, this framework does not provide the composition guarantees needed for a direct use in iterative machine learning algorithms. To mitigate these issues, we introduce a Rényi divergence-based variant of Pufferfish and show that it allows us to extend the applicability of the Pufferfish framework. We first generalize the Wasserstein mechanism to cover a wide range of noise distributions and introduce several ways to improve its utility. We also derive stronger guarantees against out-of-distribution adversaries. Finally, as an alternative to composition, we prove privacy amplification results for contractive noisy iterations and showcase the first use of Pufferfish in private convex optimization. A common ingredient underlying our results is the use and extension of shift reduction lemmas. |
| title | Rényi Pufferfish Privacy: General Additive Noise Mechanisms and Privacy Amplification by Iteration |
| topic | Cryptography and Security Machine Learning |
| url | https://arxiv.org/abs/2312.13985 |