Differential Privacy

Decomposition-Based Optimal Bounds for Privacy Amplification via Shuffling
We unify decomposition-based shuffle-privacy analyses, identify the optimal decomposition, and compute tight amplification bounds efficiently with FFT.
Pengcheng Su, Haibo Cheng, Ping Wang
PDF Cite DOI IEEE S&P 2026 program arXiv
Decomposition-Based Optimal Bounds for Privacy Amplification via Shuffling