End-to-End Verifiable and Robust Federated Learning

2026-09-14

AI Summary

该论文提出一种可验证的联邦学习协议，结合密码承诺与非交互零知识证明方法，解决拜占庭客户端更新和聚合器可审计性问题。

Abstract

Federated learning enables multiple parties to train a shared model without centralizing raw data with the help of an aggregator, but introduces integrity risks once participants or infrastructure are not fully trustworthy. Two requirements are particularly important: robustness to poisoned or Byzantine client updates, and verifiability of the aggregator so that clients or third parties can audit the reported aggregation without learning individual updates. Existing work has largely treated these goals separately, and efficient public verifiability for robust, outlier-excluding aggregation remains limited. We present a verifiable federated learning protocol that makes a robust aggregation pipeline publicly auditable. Our design combines cryptographic commitments with non-interactive zero-knowledge proofs to certify both (i) cosine-similarity-based outlier exclusion and (ii) aggregation over the selected set, without revealing individual client updates to verifiers. In experiments under representative poisoning attacks, our method maintains high accuracy, with an average accuracy loss below 4\% across the evaluated configurations, while keeping verification overhead practical: proof artifacts can be generated and verified within minutes at the scale studied. In summary, our results show that robust outlier exclusion and public verifiability can be jointly achieved in a federated learning setting.

Problem

• federated learning
• robustness
• verifiability
• Byzantine clients
• aggregator

Innovation

• Verifiable Federated Learning
• Robust Aggregation
• Non-interactive Zero-knowledge Proofs
• Cryptographic Commitments