用零知识证明让联邦学习上链可验证,防作弊又保隐私。
VerifBFL: Leveraging zk-SNARKs for A Verifiable Blockchained Federated Learning
- 结合zk-SNARKs与增量可验证计算,实现训练和聚合过程的可验证性。
- 本地训练和聚合证明生成时间分别低于81秒和2秒,链上验证不足0.6秒。
- 无需信任第三方,适合对安全性和透明度要求高的分布式学习场景。
基于区块链的联邦学习(BFL)是一种新兴的去中心化机器学习范式,可在无需中心服务器的情况下进行模型训练。尽管部分BFL框架被视为保护隐私,但仍易受推理攻击和模型投毒攻击。此外,多数方案依赖各参与方间的强信任假设或引入激励机制以促进协作,导致存在多种安全漏洞。本文提出VerifBFL,一个无信任、隐私保护且可验证的联邦学习框架,融合区块链技术与密码学协议。通过采用零知识简洁非交互式知识论证(zk-SNARKs)和增量可验证计算(IVC),VerifBFL确保本地训练与聚合过程的可验证性。训练与聚合的证明在链上验证,保障每个参与者贡献的完整性与可审计性。为防止训练数据遭受推理攻击,VerifBFL引入差分隐私。为验证所提协议的效率,我们使用新兴工具构建了原型系统。结果显示,生成本地训练和聚合的证明分别耗时少于81秒和2秒,链上验证时间低于0.6秒。
原文摘要 · Abstract (English)
Blockchain-based Federated Learning (FL) is an emerging decentralized machine learning paradigm that enables model training without relying on a central server. Although some BFL frameworks are considered privacy-preserving, they are still vulnerable to various attacks, including inference and model poisoning. Additionally, most of these solutions employ strong trust assumptions among all participating entities or introduce incentive mechanisms to encourage collaboration, making them susceptible to multiple security flaws. This work presents VerifBFL, a trustless, privacy-preserving, and verifiable federated learning framework that integrates blockchain technology and cryptographic protocols. By employing zero-knowledge Succinct Non-Interactive Argument of Knowledge (zk-SNARKs) and incrementally verifiable computation (IVC), VerifBFL ensures the verifiability of both local training and aggregation processes. The proofs of training and aggregation are verified on-chain, guaranteeing the integrity and auditability of each participant's contributions. To protect training data from inference attacks, VerifBFL leverages differential privacy. Finally, to demonstrate the efficiency of the proposed protocols, we built a proof of concept using emerging tools. The results show that generating proofs for local training and aggregation in VerifBFL takes less than 81s and 2s, respectively, while verifying them on-chain takes less than 0.6s.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。