用零知识证明让分片学习可验证,确保双方计算可信。
Verifiable Split Learning via zk-SNARKs
- 在前后传播中为双端生成zk-SNARK证明,确保计算正确
- 相比区块链系统,实现可验证性但开销略高
- 适合对计算可信度要求高的分布式训练场景
分片学习将深度神经网络在某层切分为客户端与服务端两部分,客户端用原始数据运行模型并发送中间激活值给服务端,适用于数据或资源分布于不同设备时的协作训练。然而,现有方法无法验证双方计算的正确性与诚实性。本文提出一种可验证分片学习框架,集成zk-SNARK证明,在服务端对前向与反向传播分别生成证明与验证,确保双端可验证。与基于区块链的系统对比,后者仅记录更新但无零知识证明。结果表明,采用zk-SNARK可实现强验证性与正确性,而区块链虽轻量但不可验证。
原文摘要 · Abstract (English)
Split learning is an approach to collaborative learning in which a deep neural network is divided into two parts: client-side and server-side at a cut layer. The client side executes its model using its raw input data and sends the intermediate activation to the server side. This configuration architecture is very useful for enabling collaborative training when data or resources are separated between devices. However, split learning lacks the ability to verify the correctness and honesty of the computations that are performed and exchanged between the parties. To this purpose, this paper proposes a verifiable split learning framework that integrates a zk-SNARK proof to ensure correctness and verifiability. The zk-SNARK proof and verification are generated for both sides in forward propagation and backward propagation on the server side, guaranteeing verifiability on both sides. The verifiable split learning architecture is compared to a blockchain-enabled system for the same deep learning network, one that records updates but without generating the zero-knowledge proof. From the comparison, it can be deduced that applying the zk-SNARK test achieves verifiability and correctness, while blockchains are lightweight but unverifiable.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。