mlsanityData to 7 Oct 2026

Noiseless Privacy-Preserving Decentralized Learning

arXiv 2404.09536 ↗First posted 15 Apr 2024cs.DC cs.AI cs.CRcited by 9

Not on the map. Why?

Abstract (arXiv)

Decentralized learning (DL) enables collaborative learning without a server and without training data leaving the users' devices. However, the models shared in DL can still be used to infer training data. Conventional defenses such as differential privacy and secure aggregation fall short in effectively safeguarding user privacy in DL, either sacrificing model utility or efficiency. We introduce Shatter, a novel DL approach in which nodes create virtual nodes (VNs) to disseminate chunks of their full model on their behalf. This enhances privacy by (i) preventing attackers from collecting full models from other nodes, and (ii) hiding the identity of the original node that produced a given model chunk. We theoretically prove the convergence of Shatter and provide a formal analysis demonstrating how Shatter reduces the efficacy of attacks compared to when exchanging full models between nodes. We evaluate the convergence and attack resilience of Shatter with existing DL algorithms, with heterogeneous datasets, and against three standard privacy attacks. Our evaluation shows that Shatter not only renders these privacy attacks infeasible when each node operates 16 VNs but also exhibits a positive impact on model utility compared to standard DL. In summary, Shatter enhances the privacy of DL while maintaining the utility and efficiency of the model.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 49 of its 94 references that are in the map. First posted on arXiv 15 Apr 2024.

Builds on

49 of 94 references.

References · 49

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2018The Unreasonable Effectiveness of Deep Features as a Perceptual Metriccited by 11,029
  4. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  5. 2019Deep Leakage from Gradientscited by 1,004
  6. 2020Tackling the Objective Inconsistency Problem in Heterogeneous Federated Optimizationcited by 897
  7. 2021Membership Inference Attacks From First Principlescited by 839
  8. 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 836
  9. 2018LEAF: A Benchmark for Federated Settingscited by 780
  10. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 707
  11. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 496
  12. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
37 more
  1. 2019A Survey on Federated Learning Systems: Vision, Hype and Reality for Data Privacy and Protectioncited by 371
  2. 2020iDLG: Improved Deep Leakage from Gradientscited by 367
  3. 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 361
  4. 2021See through Gradients: Image Batch Recovery via GradInversioncited by 320
  5. 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 303
  6. 2014RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Responsecited by 262
  7. 2021Enhanced Membership Inference Attacks against Machine Learning Modelscited by 237
  8. 2018The Convergence of Sparsified Gradient Methodscited by 228
  9. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 218
  10. 2018Stochastic Gradient Push for Distributed Deep Learningcited by 152
  11. 2017Lower Bounds for Finding Stationary Points Icited by 125
  12. 2019Decentralized Deep Learning with Arbitrary Communication Compressioncited by 109
  13. 2016Asynchronous Stochastic Gradient Descent with Delay Compensationcited by 98
  14. 2021Papaya: Practical, Private, and Scalable Federated Learningcited by 89
  15. 2021Do Not Let Privacy Overbill Utility: Gradient Embedding Perturbation for Private Learningcited by 86
  16. 2017Knock Knock, Who's There? Membership Inference on Aggregate Location Datacited by 63
  17. 2021TAG: Gradient Attack on Transformer-based Language Modelscited by 63
  18. 2022Asynchronous SGD Beats Minibatch SGD Under Arbitrary Delayscited by 61
  19. 2022Preserving Privacy in Federated Learning with Ensemble Cross-Domain Knowledge Distillationcited by 45
  20. 2016Differential Privacy as a Mutual Information Constraintcited by 41
  21. 2023Stochastic Gradient Descent under Markovian Sampling Schemescited by 37
  22. 2014Stochastic Gradient-Push for Strongly Convex Functions on Time-Varying Directed Graphscited by 31
  23. 2017Context-Aware Generative Adversarial Privacycited by 27
  24. 2023Epidemic Learning: Boosting Decentralized Learning with Randomized Communicationcited by 21
  25. 2023Decentralized Learning Made Easy with DecentralizePycited by 18
  26. 2023IronForge: An Open, Secure, Fair, Decentralized Federated Learningcited by 15
  27. 2017Privacy-Preserving Adversarial Networkscited by 13
  28. 2016Learning to Protect Communications with Adversarial Neural Cryptographycited by 11
  29. 2022Privacy-preserving Decentralized Federated Learning over Time-varying Communication Graphcited by 11
  30. 2023Asynchronous SGD on Graphs: a Unified Framework for Asynchronous Decentralized and Federated Optimizationcited by 11
  31. 2021Separation of Powers in Federated Learningcited by 8
  32. 2023Get More for Less in Decentralized Learning Systemscited by 6
  33. 2021MixNN: Protection of Federated Learning Against Inference Attacks by Mixing Neural Network Layerscited by 5
  34. 2021Flatee: Federated Learning Across Trusted Execution Environmentscited by 5
  35. 2022Shielding Federated Learning Systems against Inference Attacks with ARM TrustZonecited by 5
  36. 2022PRIVIC: A privacy-preserving method for incremental collection of location datacited by 3
  37. 2017Back to the Drawing Board: Revisiting the Design of Optimal Location Privacy-preserving Mechanismscited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 2; 2026: 4.

9 papers.