Perfect Privacy for Discriminator-Based Byzantine-Resilient Federated Learning

Read full text
Authors: Yue Xia, Christoph Hofmeister, Maximilian Egger, Rawad Bitar
Cited by: 0
References: 67

Abstract

Federated learning (FL) shows great promise in large-scale machine learning but introduces new privacy and security challenges. We propose ByITFL and LoByITFL, two novel FL schemes that enhance resilience against Byzantine users while preventing eavesdroppers from learning users’ private data. To ensure privacy and Byzantine resilience, our schemes are built on having a small representative dataset available to the federator and crafting a discriminator function allowing mitigating corrupt users’ contributions. ByITFL employs Lagrange coded computing and re-randomization, making it the first Byzantine-resilient FL scheme with perfect Information-Theoretic (IT) privacy, though at the cost of a significant communication overhead. LoByITFL, on the other hand, achieves Byzantine resilience and IT privacy at a significantly reduced communication cost, but requires a Trusted Third Party (TTP), used only before training in a one-time initialization phase. We provide theoretical guarantees of privacy and Byzantine resilience, along with convergence guarantees and experimental results validating our findings.

Fields of Study & Subjects

Privacy-Preserving Technologies in Data Stochastic Gradient Optimization Techniques Adversarial Robustness in Machine Learning

Publication details

Journal / source
IEEE Transactions on Information Forensics and Security
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Volume
21
Pages
4940–4954
Publication date
1 January 2026
Language
EN