MUDGUARD: Taming Malicious Majorities in Federated Learning using Privacy-Preserving Byzantine-Robust Clustering
Not on the map. Why?
Abstract (arXiv)
Byzantine-robust Federated Learning (FL) aims to counter malicious clients and train an accurate global model while maintaining an extremely low attack success rate. Most existing systems, however, are only robust when most of the clients are honest. FLTrust (NDSS '21) and Zeno++ (ICML '20) do not make such an honest majority assumption but can only be applied to scenarios where the server is provided with an auxiliary dataset used to filter malicious updates. FLAME (USENIX '22) and EIFFeL (CCS '22) maintain the semi-honest majority assumption to guarantee robustness and the confidentiality of updates. It is therefore currently impossible to ensure Byzantine robustness and confidentiality of updates without assuming a semi-honest majority. To tackle this problem, we propose a novel Byzantine-robust and privacy-preserving FL system, called MUDGUARD, that can operate under malicious minority or majority in both the server and client sides. Based on DBSCAN, we design a new method for extracting features from model updates via pairwise adjusted cosine similarity to boost the accuracy of the resulting clustering. To thwart attacks from a malicious majority, we develop a method called textitModel Segmentation, that aggregates together only the updates from within a cluster, sending the corresponding model only to the clients of the corresponding cluster. The fundamental idea is that even if malicious clients are in their majority, their poisoned updates cannot harm benign clients if they are confined only within the malicious cluster. We also leverage multiple cryptographic tools to conduct clustering without sacrificing training correctness and updates confidentiality. We present a detailed security proof and empirical evaluation along with a convergence analysis for MUDGUARD.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 30 of its 72 references that are in the map. First posted on arXiv 22 Aug 2022.
Builds on
30 of 72 references.
References · 30
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016Deep Learning with Differential Privacycited by 2,728
- 2019Deep Leakage from Gradientscited by 1,021
- 2018LEAF: A Benchmark for Federated Settingscited by 792
- 2018How To Backdoor Federated Learningcited by 765
- 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 712
18 more
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
- 2020An Efficient Framework for Clustered Federated Learningcited by 511
- 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 493
- 2018Analyzing Federated Learning through an Adversarial Lenscited by 351
- 2020FLTrust: Byzantine-robust Federated Learning via Trust Bootstrappingcited by 346
- 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 329
- 2020Attack of the Tails: Yes, You Really Can Backdoor Federated Learningcited by 309
- 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288
- 2018A Hybrid Approach to Privacy-Preserving Federated Learningcited by 210
- 2020Feature Inference Attack on Model Predictions in Vertical Federated Learningcited by 106
- 2019Zeno++: Robust Fully Asynchronous SGDcited by 53
- 2019XONN: XNOR-based Oblivious Deep Neural Network Inferencecited by 51
- 2020Convolution-Weight-Distribution Assumption: Rethinking the Criteria of Channel Pruningcited by 30
- 2020Improving Deep Learning with Differential Privacy using Gradient Encoding and Denoisingcited by 30
- 2021EIFFeL: Ensuring Integrity for Federated Learningcited by 28
- 2019The Value of Collaboration in Convex Machine Learning with Differential Privacycited by 24
- 2020SWIFT: Super-fast and Robust Privacy-Preserving Machine Learningcited by 20
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 3.
5 papers.
- 2024Asynchronous Multi-Server Federated Learning for Geo-Distributed Clientscited by 3
- 2025Multi-Modal Multi-Task Federated Foundation Models for Next-Generation Extended Reality Systems: Towards Privacy-Preserving Distributed Intelligence in AR/VR/MRcited by 3
- 2026Dynamic Topology Optimization for Non-IID Data in Decentralized Learningcited by 2
- 2026SCRUB-FL: Sanitizing and Cleansing Representations via Unlearning of Backdoorscited by 0
- 2026PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learningcited by 0
- 2026PRoVeFL: Private Robust and Verifiable Aggregation in Federated Learning7 Jul 2026
- 2026SCRUB-FL: Sanitizing and Cleansing Representations via Unlearning of Backdoors21 Jun 2026
- 2026Dynamic Topology Optimization for Non-IID Data in Decentralized Learning3 Feb 2026
- 2025Multi-Modal Multi-Task Federated Foundation Models for Next-Generation Extended Reality Systems: Towards Privacy-Preserving Distributed Intelligence in AR/VR/MR6 Jun 2025
- 2024Asynchronous Multi-Server Federated Learning for Geo-Distributed Clients3 Jun 2024