The paper reviews the state of robustness in Federated Learning (FL), highlighting its vulnerability to performance degradation, data theft, and aggregation attacks. It presents a comprehensive framework that includes a threat-centric view of attack surfaces, a taxonomy of robust aggregation methods (distinguishing outcome‑centric from security‑centric approaches), and a layered taxonomy of defensive strategies. The authors also scrutinize current evaluation practices and outline key applications and open research challenges to steer future work.
The development of federated learning (FL) techniques has helped improve the privacy preservation of users' data and extended the applications of machine learning models. However, the involvement of a...
arXiv:2502. 17748v4 Announce Type: replace Abstract: Federated Learning (FL) inherently mitigates mass data centralization risks; however, its privacy protections are not equally distributed - leaving vulnerable individuals disproportionately exposed to sophisticated privacy attacks.
arXiv:2509. 11974v2 Announce Type: replace-cross Abstract: Federated Learning (FL) enables collaborative model training among clients without centralising data, making it a widely adopted privacy-enhancing technology (PET).
The paper investigates how adversarial examples transfer between client models in federated learning and explores the relationship between these examples and client data distributions. It proposes a defense strategy based on adversarial training that leverages the transferability of model robustness. Experiments on real-life datasets demonstrate that the new attack and defense methods outperform existing state‑of‑the‑art approaches.
arXiv:2606. 10595v1 Announce Type: cross Abstract: Federated Learning (FL) has emerged as a promising solution for data hunger in centralized learning.
The paper introduces DP‑BR‑FedAvg, a federated learning framework that combines Gaussian‑mechanism differential privacy with a coordinate‑wise trimmed‑mean Byzantine‑robust aggregation rule. It is evaluated on a simulated cross‑institutional classification task for fraud and clinical‑risk scoring, showing that plain FedAvg fails when a quarter of twenty clients are Byzantine, while DP‑BR‑FedAvg recovers more signal and bounds privacy loss. The study demonstrates that privacy and robustness interact, and system design for regulated, adversarial, cross‑institutional settings must account for this interaction.
The paper introduces DP‑BR‑FedAvg, a federated learning framework that combines Gaussian‑mechanism differential privacy with a coordinate‑wise trimmed‑mean Byzantine‑robust aggregation rule. It is evaluated on a simulated cross‑institutional classification task involving fraud and clinical‑risk scoring, where it improves the F1‑score for a minority class from 0.030 (plain FedAvg) to 0.119 while bounding privacy loss. The study demonstrates that privacy and robustness mechanisms interact, and that system design for regulated, adversarial, cross‑institutional settings must account for this interaction.
The paper investigates how privacy guarantees, robustness to Byzantine attacks, and detection coverage for rare intrusion types interact in federated network intrusion detection systems. It introduces geometric indistinguishability to explain how privacy noise can obscure minority-class signals, and demonstrates through experiments on UNSW‑NB15 that combining differential privacy with robust aggregation can disproportionately harm detection of rare attacks. The study highlights that these properties cannot be treated as independently composable and calls for aggregation‑aware modeling and sample‑aware evaluation to build trustworthy federated NIDS.
arXiv:2606. 17035v1 Announce Type: new Abstract: Prior research suggests that differential privacy (DP) inherently enhances the robustness of federated learning (FL) against backdoor attacks.
arXiv:2608.21137v1 Announce Type: new Abstract: Decentralized Federated Learning (DFL) promises trust-free collaborative learning by replacing the centralized parameter server with peer-to-peer model...
arXiv:2606. 00947v1 Announce Type: cross Abstract: Foundation models are increasingly personalized on decentralized private data through federated learning and are now deployed at scale under growing regulatory requirements for post-market monitoring.
The paper introduces a general learning framework that protects privacy in federated learning by distorting model parameters, enabling a trade‑off between privacy and utility. The algorithm supports arbitrary privacy measurements and delivers personalized utility‑privacy balances for each parameter, client, and communication round. The authors prove that the gap between their algorithm’s utility loss and the optimal loss is sub‑linear in iterations, provide a convergence rate, and demonstrate empirically that their method outperforms baselines under the same privacy budget.