REVIEW 1 cited by
Bounding data reconstruction attacks with the hypothesis testing interpretation of differential privacy
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We explore Reconstruction Robustness (ReRo), which was recently proposed as an upper bound on the success of data reconstruction attacks against machine learning models. Previous research has demonstrated that differential privacy (DP) mechanisms also provide ReRo, but so far, only asymptotic Monte Carlo estimates of a tight ReRo bound have been shown. Directly computable ReRo bounds for general DP mechanisms are thus desirable. In this work, we establish a connection between hypothesis testing DP and ReRo and derive closed-form, analytic or numerical ReRo bounds for the Laplace and Gaussian mechanisms and their subsampled variants.
Forward citations
Cited by 1 Pith paper
-
Covert Attacks on Machine Learning Training in Passively Secure MPC
An active adversary can exploit additive error injection in passively secure MPC training to poison models, amplify membership inference, reduce fairness, and reconstruct exact training data.
Discussion (0). Continue with ORCID to comment.