arXiv:2503.15550cs.CRcs.AI2025-03中稿 · IEEE Communication…被引 11

用零知识证明提升联邦学习的可信度与隐私保护

Zero-Knowledge Federated Learning: A New Trustworthy and Privacy-Preserving Distributed Learning Paradigm

  • 引入零知识证明机制,验证客户端模型性能真伪
  • 新算法可筛选高质量模型,提升训练效率与系统安全
  • 适合关注隐私保护与分布式信任的科研与工程人员

联邦学习(FL)作为分布式机器学习的前沿范式,可在保护数据隐私的前提下实现协同建模。然而,其仍面临安全与信任挑战。零知识证明(ZKPs)为解决该问题提供了可能,能增强整个联邦学习过程的可信性与完整性。尽管已有研究探索基于零知识证明的联邦学习(ZK-FL),但尚缺乏系统性框架与全面分析。本文提出一个结构化的ZK-FL框架,对零知识证明在不同联邦学习阶段的技术角色进行分类与解析。同时,设计了一种新型算法——可验证客户端选择联邦学习(Veri-CS-FL),利用零知识证明对客户端本地模型的性能指标生成可验证证明,并提交至服务器高效验证。服务器据此筛选高质量模型参与上传并聚合,显著提升系统效率与安全性。该方法不仅确保性能指标真实性,还增强了参与者间的信任。

原文摘要 · Abstract (English)

Federated Learning (FL) has emerged as a promising paradigm in distributed machine learning, enabling collaborative model training while preserving data privacy. However, despite its many advantages, FL still contends with significant challenges -- most notably regarding security and trust. Zero-Knowledge Proofs (ZKPs) offer a potential solution by establishing trust and enhancing system integrity throughout the FL process. Although several studies have explored ZKP-based FL (ZK-FL), a systematic framework and comprehensive analysis are still lacking. This article makes two key contributions. First, we propose a structured ZK-FL framework that categorizes and analyzes the technical roles of ZKPs across various FL stages and tasks. Second, we introduce a novel algorithm, Verifiable Client Selection FL (Veri-CS-FL), which employs ZKPs to refine the client selection process. In Veri-CS-FL, participating clients generate verifiable proofs for the performance metrics of their local models and submit these concise proofs to the server for efficient verification. The server then selects clients with high-quality local models for uploading, subsequently aggregating the contributions from these selected clients. By integrating ZKPs, Veri-CS-FL not only ensures the accuracy of performance metrics but also fortifies trust among participants while enhancing the overall efficiency and security of FL systems.

联邦学习零知识证明隐私保护可信计算

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。