MUDGUARD

Taming Malicious Majorities in Federated Learning using Privacy-preserving Byzantine-robust Clustering

Conference Paper (2025)
Author(s)

R. Wang (TU Delft - Cyber Security)

Xingkai Wang (Shanghai Jiao Tong University)

H. Chen (TU Delft - Cyber Security)

Jeremie Decouchant (TU Delft - Data-Intensive Systems)

Stjepan Picek (Radboud Universiteit Nijmegen)

Nikolaos Laoutaris (IMDEA Networks Institute)

Kaitai Liang (TU Delft - Cyber Security)

Research Group
Cyber Security
DOI related publication
https://doi.org/10.1145/3726854.3727296
More Info
expand_more
Publication Year
2025
Language
English
Research Group
Cyber Security
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository as part of the Taverne amendment. More information about this copyright law amendment can be found at https://www.openaccess.nl. Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.@en
Pages (from-to)
25-27
ISBN (electronic)
979-8-4007-1593-8
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

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, to capture malicious minority and majority for server and client sides, respectively. Our experimental results demonstrate that the accuracy of MUDGUARD is practically close to the FL baseline using FedAvg without attacks (≈0.8% gap on average). Meanwhile, the attack success rate is around 0%-5% even under an adaptive attack tailored to MUDGUARD. We further optimize our design by using binary secret sharing and polynomial transformation, leading to communication overhead and runtime decreases of 67%-89.17% and 66.05%-68.75%, respectively.

Files

3744970.3727296.pdf
(pdf | 1.09 Mb)
License info not available
warning

File under embargo until 09-12-2025