mlsanityData to 7 Oct 2026

Echo of Neighbors: Privacy Amplification for Personalized Private Federated Learning with Shuffle Model

arXiv 2304.05516 ↗First posted 11 Apr 2023cs.CR cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

Federated Learning, as a popular paradigm for collaborative training, is vulnerable against privacy attacks. Different privacy levels regarding users' attitudes need to be satisfied locally, while a strict privacy guarantee for the global model is also required centrally. Personalized Local Differential Privacy (PLDP) is suitable for preserving users' varying local privacy, yet only provides a central privacy guarantee equivalent to the worst-case local privacy level. Thus, achieving strong central privacy as well as personalized local privacy with a utility-promising model is a challenging problem. In this work, a general framework (APES) is built up to strengthen model privacy under personalized local privacy by leveraging the privacy amplification effect of the shuffle model. To tighten the privacy bound, we quantify the heterogeneous contributions to the central privacy user by user. The contributions are characterized by the ability of generating "echos" from the perturbation of each user, which is carefully measured by proposed methods Neighbor Divergence and Clip-Laplace Mechanism. Furthermore, we propose a refined framework (S-APES) with the post-sparsification technique to reduce privacy loss in high-dimension scenarios. To the best of our knowledge, the impact of shuffling on personalized local privacy is considered for the first time. We provide a strong privacy amplification effect, and the bound is tighter than the baseline result based on existing methods for uniform local privacy. Experiments demonstrate that our frameworks ensure comparable or higher accuracy for the global model.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 17 of its 28 references that are in the map. First posted on arXiv 11 Apr 2023.

Builds on

17 of 28 references.

References · 17

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  3. 2019Deep Leakage from Gradientscited by 1,004
  4. 2019Federated Learning with Differential Privacy: Algorithms and Performance Analysiscited by 528
  5. 2013The Composition Theorem for Differential Privacycited by 290
  6. 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 262
  7. 2017Sparse Communication for Distributed Gradient Descentcited by 243
  8. 2018Amplification by Shuffling: From Local to Central Differential Privacy via Anonymitycited by 163
  9. 2020Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shufflingcited by 96
  10. 2019The Privacy Blanket of the Shuffle Modelcited by 73
  11. 2019Differentially Private Model Publishing for Deep Learningcited by 69
  12. 2019Cold Case: The Lost MNIST Digitscited by 61
5 more
  1. 2021On the Renyi Differential Privacy of the Shuffle Modelcited by 16
  2. 2018The Bounded Laplace Mechanism in Differential Privacycited by 13
  3. 2018Privacy and Utility Tradeoff in Approximate Differential Privacycited by 3
  4. 2022Utility Analysis and Enhancement of LDP Mechanisms in High-Dimensional Spacecited by 3
  5. 2019Differential Privacy Via a Truncated and Normalized Laplace Mechanismcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 0; 2026: 2.

4 papers.