FORTA: Byzantine-Resilient FL Aggregation via DFT-Guided Krum
Usayd Shahul, J. Harshan

TL;DR
FORTA introduces a real-domain secure aggregation method for federated learning that combines DFT codes and an improved Krum algorithm to enhance robustness against Byzantine attacks while preserving privacy.
Contribution
It proposes FORTA, a novel real-domain secure aggregation framework that refines Krum with DFT feedback, addressing numerical issues in Byzantine-resilient federated learning.
Findings
FORTA outperforms standard Krum in robustness and accuracy.
The method effectively detects and mitigates malicious updates.
Theoretical analysis confirms improved resilience against Byzantine failures.
Abstract
Secure federated learning enables collaborative model training across decentralized users while preserving data privacy. A key component is secure aggregation, which keeps individual updates hidden from both the server and users, while also defending against Byzantine users who corrupt the aggregation. To this end, Jinhyun So et al. recently developed a Byzantine-resilient secure aggregation scheme using a secret-sharing strategy over finite-field arithmetic. However, such an approach can suffer from numerical errors and overflows when applied to real-valued model updates, motivating the need for secure aggregation methods that operate directly over the real domain. We propose FORTA, a Byzantine-resilient secure aggregation framework that operates entirely in the real domain. FORTA leverages Discrete Fourier Transform (DFT) codes for privacy and employs Krum-based outlier detection for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
