Pith. sign in

Towards Trustworthy Federated Learning with Untrusted Participants

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Resilience against malicious participants and data privacy are essential for trustworthy federated learning, yet achieving both with good utility typically requires the strong assumption of a trusted central server. This paper shows that a significantly weaker assumption suffices: each pair of participants shares a randomness seed unknown to others. In a setting where malicious participants may collude with an untrusted server, we propose CafCor, an algorithm that integrates robust gradient aggregation with correlated noise injection, using shared randomness between participants. We prove that CafCor achieves strong privacy-utility trade-offs, significantly outperforming local differential privacy (DP) methods, which do not make any trust assumption, while approaching central DP utility, where the server is fully trusted. Empirical results on standard benchmarks validate CafCor's practicality, showing that privacy and robustness can coexist in distributed systems without sacrificing utility or trusting the server.

citation-role summary

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

support 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • ByzFL: Research Framework for Robust Federated Learning cs.LG · 2025-05-30 · conditional · none · ref 2024 · internal anchor

    The paper introduces ByzFL, a modular open-source library for simulating, attacking, and benchmarking Byzantine-robust federated learning with a single JSON config.