# Analysis of Shuffling Beyond Pure Local Differential Privacy

arXiv: https://arxiv.org/abs/2601.19154 · HTML: https://mlsanity.com/paper/2601.19154/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 3 of its 10 references that are in the map.
- First posted on arXiv 27 Jan 2026.

## Builds on (most cited first, 3 of 3)

- [Privacy Amplification via Compression: Achieving the Optimal Privacy-Accuracy-Communication Trade-off in Distributed Mean Estimation](https://mlsanity.com/paper/2304.01541/) (2023)
- [Network Shuffling: Privacy Amplification via Random Walks](https://mlsanity.com/paper/2204.03919/) (2022)
- [Privacy Amplification via Shuffling: Unified, Simplified, and Tightened](https://mlsanity.com/paper/2304.05007/) (2023)

## Built on by (most cited first, 1 of 1)

- [Shuffling-Aware Optimization for Private Vector Mean Estimation](https://mlsanity.com/paper/2604.28032/) (2026)

## Abstract (arXiv)

Shuffling is a powerful way to amplify privacy of a local randomizer in private distributed data analysis. Most existing analyses of how shuffling amplifies privacy are based on the pure local differential privacy (DP) parameter varepsilon0. This paper raises the question of whether varepsilon0 adequately captures the privacy amplification. For example, since the Gaussian mechanism does not satisfy pure local DP for any finite varepsilon0, does it follow that shuffling yields weak amplification? To solve this problem, we revisit the privacy blanket bound of Balle et al. (the blanket divergence) and develop a direct asymptotic analysis that bypasses varepsilon0. Our key finding is that, asymptotically, the blanket divergence depends on the local mechanism only through a single scalar parameter chi and that this dependence is monotonic. Therefore, this parameter serves as a proxy for shuffling efficiency, which we call the shuffle index. By applying this analysis to both upper and lower bounds of the shuffled mechanism's privacy profile, we obtain a band for its privacy guarantee through shuffle indices. Furthermore, we derive a simple structural, necessary and sufficient condition on the local randomizer under which this band collapses asymptotically. k-RR families with k≥3 satisfy this condition, while for generalized Gaussian mechanisms the condition may not hold but the resulting band remains tight. Finally, we complement the asymptotic theory with an FFT-based algorithm for computing the blanket divergence at finite n, which offers rigorously controlled relative error and near-linear running time in n, providing a practical numerical analysis for shuffle DP.