arXiv:2412.10537cs.CRcs.DC2024-12被引 3

用可信执行环境证明联邦学习训练过程合规,防作弊且无数据泄露风险。

VerifiableFL: Verifiable Claims for Federated Learning using Exclaves

  • 通过仅保证完整性的小型执行环境(exclaves)生成运行时证明
  • 训练过程中的每步数据处理均有可验证的证据链,错误操作无法隐藏
  • 适合需要审计和信任保障的医疗、金融等敏感领域联邦学习应用

在联邦学习中,数据提供方联合训练模型而不共享原始数据,这使得难以对训练结果做出可验证声明,例如所用数据是否经过清洗或算法是否正确执行——恶意参与方可擅自偏离协议而无法被发现。现有基于可信执行环境(TEEs)的方案依赖其机密性与完整性,但机密性易受侧信道攻击。本文提出VerifiableFL,利用细粒度运行时证明建立对联邦学习模型的可验证声明。该系统通过新型‘exclaves’(仅具备完整性保护的执行环境)生成证明,不存储软件管理的密钥,因而免于数据泄露攻击。VerifiableFL在训练过程中为每个数据转换步骤生成证明,构建完整的训练计算证据流图。审计者可通过检查该图确认模型是否满足预设要求,如数据清洗或聚合正确性。系统扩展了NVFlare框架,相比无保护训练仅增加12%以下开销。

原文摘要 · Abstract (English)

In federated learning (FL), data providers jointly train a machine learning model without sharing their training data. This makes it challenging to provide verifiable claims about the trained FL model, e.g., related to the employed training data, any data sanitization, or the correct training algorithm-a malicious data provider can simply deviate from the correct training protocol without detection. While prior FL training systems have explored the use of trusted execution environments (TEEs) to protect the training computation, such approaches rely on the confidentiality and integrity of TEEs. The confidentiality guarantees of TEEs, however, have been shown to be vulnerable to a wide range of attacks, such as side-channel attacks. We describe VerifiableFL, a system for training FL models that establishes verifiable claims about trained FL models with the help of fine-grained runtime attestation proofs. Since these runtime attestation proofs only require integrity protection, VerifiableFL generates them using the new abstraction of exclaves. Exclaves are integrity-only execution environments, which do not contain software-managed secrets and thus are immune to data leakage attacks. VerifiableFL uses exclaves to attest individual data transformations during FL training without relying on confidentiality guarantees. The runtime attestation proofs then form an attested dataflow graph of the entire FL model training computation. The graph is checked by an auditor to ensure that the trained FL model satisfies its claims, such as the use of data sanitization by data providers or correct aggregation by the model provider. VerifiableFL extends NVFlare FL framework to use exclaves. We show that VerifiableFL introduces less than 12% overhead compared to unprotected FL training.

联邦学习可信执行可验证计算

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