Skip to content
Book Open access

PoL-BFL: Towards Trustworthy Federated Learning with Zero-Knowledge Proofs and Verifiable Incentives

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 5291-5302 · 0 citations · 4 references

Abstract

Decentralized Federated Learning removes the need for a trusted central server but introduces a critical verification gap: participants cannot prove to each other that they have honestly executed the costly local training. This gap undermines both security and incentive alignment, as rational clients are tempted to cheat without fear of automated penalty. Existing defenses are insufficient. Statistical methods cannot cryptographically verify computation, while cryptographic systems incur prohibitive overhead by exhaustively verifying every client. Crucially, both lack a mechanism to automatically convert detection into punishment. To solve the problem, we propose PoL-BFL, a framework that bridges this gap through a novel "verify-then-slash" paradigm. Its core insight is to make verification economically decisive rather than exhaustive. PoL-BFL integrates (1) probabilistic cryptographic verification, where clients efficiently prove training authenticity via zero-knowledge proofs, with only a random subset audited each round; and (2) automated economic enforcement, where smart contracts slash the stake of clients whose proofs fail. This is instantiated in a synergistic three-layer defense that ensures computational authenticity, filters malicious updates that pass cryptographic verification, and enforces incentive compatibility. We prove that honest participation is strictly more profitable than cheating for rational clients whenever the detection probability, stake, and reward parameters satisfy a derived condition. Extensive experiments across eight attack types show that PoL-BFL consistently outperforms single-point defenses. Against free-riding, our detection rate reaches 96.5% compared to 72.5% for ShapleyFL [24]. Against Byzantine attacks, model accuracy under ALIE attack reaches 82.8% versus 68.2% with Krum [5] alone. System overhead remains practical in our controlled testbed: 23.6× faster than Veriblock-FL [9], with per-round gas costs under $1 at 1.5 gwei and $2500/ETH. Code is available at https://github.com/weixiubo/PoL-BFL.

Read PDF

Similar papers

Open access Aug 2026

TriVer: a lightweight and client-verifiable secure aggregation with dropout tolerance for federated learning

It is proved that TriVer satisfies client data privacy, aggregation correctness, and aggregation-result non-forgeability in the Random Oracle Model under ECDLP hardness, HPRF pseudorandomness, and hash collision resistance, against a fully malicious server that may collude with a subset of aggregators and clients.

Guang-Ye Zhu, Liqiang Wu, Wei-Dong Du · 0 citations

A vc-compatible zero-knowledge framework for selective academic grade verification

Academic transcript verification suffers from an "all-or-nothing" disclosure problem: students must reveal complete records even when verifiers only need specific threshold confirmations. This thesis proposes, implements, and evaluates a privacy-preserving system that enables threshold verification (e.g., "Mathematics...

R. Watanabe · 0 citations
#machine learning Preprint Sep 2026

End-to-End Verifiable and Robust Federated Learning

The results show that robust outlier exclusion and public verifiability can be jointly achieved in a federated learning setting.

Doryan Lesaignoux, Enrique Mármol Campos, Gabriele Spini et al. · 0 citations
Preprint Sep 2026

Cryptographic Security Is Not Enough: Privacy Gaps in the Renegade Decentralized Dark Pool

Dark pools are designed to provide pre-trade privacy, liveness, and post-trade confidentiality - concealing order flow before execution and limiting information leakage after. Decentralized dark pools, such as Renegade, aim to replicate these properties without custodial risk, using secure multi-party computation (MPC)...

Prerna Arote, A. Saiz, Oriol Saguillo et al. · 0 citations
#federated learning Open access Sep 2026

Toward Intelligent Blockchain Consensus: A Machine Learning-Enhanced Redbelly Framework for Scalable, Secure, and Energy-Efficient Decentralized Networks

Blockchain consensus still forces a hard choice among scalability, security, and energy use. Redbelly, a leaderless Byzantine Fault Tolerance protocol, largely settles the scalability-versus-energy side of that tension, yet it accepts any cryptographically valid transaction without judging whether it is economically fr...

Ismail Fdilat, Khadija Louzaoui, Khalid Benlhachmi · 0 citations
Open access 2026

Privacy-Preserving and Byzantine-Robust Federated Learning With Mean-Constrained Secret Sharing

PVeriFL is a federated learning framework that integrates privacy preservation, Byzantine fault tolerance, and lightweight client-side verifiability and effectively unifies the three security objectives, offering a practical and trustworthy solution for real-world federated learning systems.

Guang-Ye Zhu, Liqiang Wu, Ke-Qian Liu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.