Numerical Composition of Differential Privacy
We give a fast algorithm to optimally compose privacy guarantees of differentially private (DP) algorithms to arbitrary accuracy. Our method is based on the notion of \emph{privacy loss random variables} to quantify the privacy loss of DP algorithms. The running time and memory needed for our algor...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Labor Dynamics Institute
2024-02-01
|
Series: | The Journal of Privacy and Confidentiality |
Subjects: | |
Online Access: | https://journalprivacyconfidentiality.org/index.php/jpc/article/view/870 |