mlsanityData to 7 Oct 2026

How to Securely Shuffle? A survey about Secure Shufflers for privacy-preserving computations

arXiv 2507.01487 ↗First posted 2 Jul 2025cs.CR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Ishai et al. (FOCS'06) introduced secure shuffling as an efficient building block for private data aggregation. Recently, the field of differential privacy has revived interest in secure shufflers by highlighting the privacy amplification they can provide in various computations. Although several works argue for the utility of secure shufflers, they often treat them as black boxes; overlooking the practical vulnerabilities and performance trade-offs of existing implementations. This leaves a central question open: what makes a good secure shuffler? This survey addresses that question by identifying, categorizing, and comparing 26 secure protocols that realize the necessary shuffling functionality. To enable a meaningful comparison, we adapt and unify existing security definitions into a consistent set of properties. We also present an overview of privacy-preserving technologies that rely on secure shufflers, offer practical guidelines for selecting appropriate protocols, and outline promising directions for future work.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 58 of its 151 references that are in the map. First posted on arXiv 2 Jul 2025.

Builds on

58 of 151 references.

References · 58

  1. 2019Advances and Open Problems in Federated Learningcited by 3,021
  2. 2016Deep Learning with Differential Privacycited by 2,682
  3. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  4. 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 558
  5. 2018Sparsified SGD with Memorycited by 373
  6. 2019SecureBoost: A Lossless Federated Learning Frameworkcited by 174
  7. 2018Amplification by Shuffling: From Local to Central Differential Privacy via Anonymitycited by 163
  8. 2021Back to the Drawing Board: A Critical Evaluation of Poisoning Attacks on Production Federated Learningcited by 116
  9. 2018Distributed Differential Privacy via Shufflingcited by 115
  10. 2020You Autocomplete Me: Poisoning Vulnerabilities in Neural Code Completioncited by 112
  11. 2018Privacy Amplification by Iterationcited by 97
  12. 2018Byzantine Stochastic Gradient Descentcited by 81
38 more
  1. 2019The Privacy Blanket of the Shuffle Modelcited by 73
  2. 2019Federated Forestcited by 49
  3. 2021Poisoning the Unlabeled Dataset of Semi-Supervised Learningcited by 44
  4. 2020Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluationcited by 39
  5. 2020Privacy Amplification via Random Check-Inscited by 39
  6. 2020Private Summation in the Multi-Message Shuffle Modelcited by 34
  7. 2022Stronger Privacy Amplification by Shuffling for R'enyi and Approximate Differential Privacycited by 29
  8. 2020Privacy Amplification by Decentralizationcited by 28
  9. 2020FLAME: Differentially Private Federated Learning in the Shuffle Modelcited by 27
  10. 2020FederBoost: Private Federated Learning for GBDTcited by 27
  11. 2021EIFFeL: Ensuring Integrity for Federated Learningcited by 26
  12. 2019Scalable and Differentially Private Distributed Aggregation in the Shuffled Modelcited by 20
  13. 2019Data Poisoning Attacks to Local Differential Privacy Protocolscited by 20
  14. 2020An Accurate, Scalable and Verifiable Protocol for Federated Differentially Private Averagingcited by 20
  15. 2019Separating Local & Shuffled Differential Privacy via Histogramscited by 16
  16. 2021Private Counting from Anonymous Messages: Near-Optimal Accuracy with Vanishing Communication Overheadcited by 16
  17. 2017Leaky Cauldron on the Dark Land: Understanding Memory Side-Channel Hazards in SGXcited by 15
  18. 2020Pure Differentially Private Summation from Anonymous Messagescited by 15
  19. 2020Shuffled Model of Federated Learning: Privacy, Communication and Accuracy Trade-offscited by 15
  20. 2017Software Grand Exposure: SGX Cache Attacks Are Practicalcited by 14
  21. 2021Differential Privacy in the Shuffle Model: A Survey of Separationscited by 14
  22. 2020Connecting Robust Shuffle Privacy and Pan-Privacycited by 12
  23. 2021Towards Sparse Federated Analytics: Location Heatmaps under Distributed Differential Privacy with Secure Aggregationcited by 10
  24. 2023A Generalized Shuffle Framework for Privacy Amplification: Strengthening Privacy Guarantees and Enhancing Utilitycited by 6
  25. 2021MixNN: Protection of Federated Learning Against Inference Attacks by Mixing Neural Network Layerscited by 5
  26. 2015Riposte: An Anonymous Messaging System Handling Millions of Userscited by 4
  27. 2019Improved Summation from Shufflingcited by 4
  28. 2013Hang With Your Buddies to Resist Intersection Attackscited by 3
  29. 2015RAPTOR: Routing Attacks on Privacy in Torcited by 3
  30. 2017The Loopix Anonymity Systemcited by 3
  31. 2016A Survey on Routing in Anonymous Communication Protocolscited by 2
  32. 2016Atom: Horizontally Scaling Strong Anonymitycited by 2
  33. 2017Glimmers: Resolving the Privacy/Trust Quagmirecited by 2
  34. 2018On Privacy Notions in Anonymous Communicationcited by 2
  35. 2019Express: Lowering the Cost of Metadata-hiding Communication with Cryptographic Privacycited by 2
  36. 2021Selective MPC: Distributed Computation of Differentially Private Key-Value Statisticscited by 2
  37. 2022A Survey on Anonymous Communication Systems with a Focus on Dining Cryptographers Networkscited by 2
  38. 2023Amplification by Shuffling without Shufflingcited by 2

50 most cited of 58 All 58 (JSON)

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

  1. 2025Prediction with Expert Advice under Local Differential Privacycited by 0