arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.09186cs.CRcs.LG

pvCNN:隐私保护且可验证的卷积神经网络测试

pvCNN: Privacy-Preserving and Verifiable Convolutional Neural Network Testing

Jinan University(暨南大学);Pazhou Lab(琶洲实验室);Dongguan University of Technology(东莞理工学院);Guangzhou Fongwell Data Limited Company(广州方纬数据有限公司)

Jiasi Weng, Jian Weng, Gui Tang, Anjia Yang, Ming Li, Jia-Nan Liu

AI总结:

本文提出 pvCNN 框架,通过划分 CNN 模型并结合同态加密与 zk-SNARK,实现隐私保护且可验证的神经网络测试,并利用基于 QMPs 的电路和证明聚合显著提升证明效率。

摘要:

本文提出了一种用于隐私保护且可验证的卷积神经网络(CNN)测试的新方法,使 CNN 模型开发者能够向用户证明该 CNN 在来自多个测试者的非公开数据上的真实性能,同时尊重模型隐私。为了平衡安全性与效率问题,通过将同态加密(HE)和零知识简洁非交互式知识论证(zk-SNARK)原语与 CNN 测试适当集成,完成了三项新工作。首先,将被测试的 CNN 模型策略性地划分为由模型开发者本地保留的私有部分,以及外包给外部服务器的公共部分。然后,私有部分对测试者发送的经 HE 保护的测试数据进行运算,并将其输出传输给公共部分,以完成 CNN 测试的后续计算。其次,通过生成基于 zk-SNARK 的证明来强制保证上述 CNN 测试的正确性,重点优化二维(2-D)卷积操作的证明开销,因为这些操作在证明生成过程中主导了性能瓶颈。我们特别提出了一种新的基于二次矩阵程序(QMPs)的算术电路,该电路仅使用一个乘法门,以批处理方式表达多个滤波器和输入之间的二维卷积操作。第三,我们将针对同一 CNN 模型但不同测试者的测试数据(即不同陈述)的多个证明聚合为一个证明,并确保聚合证明的有效性蕴含原始多个证明的有效性。最后,我们的实验结果表明,对于高维矩阵乘法,我们基于 QMPs 的 zk-SNARK 在证明时间上比现有的基于 QAPs 的 zk-SNARK 快近 13.9 倍,在 Setup 时间上快 17.6 倍。

英文摘要:

This paper proposes a new approach for privacy-preserving and verifiable convolutional neural network (CNN) testing, enabling a CNN model developer to convince a user of the truthful CNN performance over non-public data from multiple testers, while respecting model privacy. To balance the security and efficiency issues, three new efforts are done by appropriately integrating homomorphic encryption (HE) and zero-knowledge succinct non-interactive argument of knowledge (zk-SNARK) primitives with the CNN testing. First, a CNN model to be tested is strategically partitioned into a private part kept locally by the model developer, and a public part outsourced to an outside server. Then, the private part runs over HE-protected test data sent by a tester and transmits its outputs to the public part for accomplishing subsequent computations of the CNN testing. Second, the correctness of the above CNN testing is enforced by generating zk-SNARK based proofs, with an emphasis on optimizing proving overhead for two-dimensional (2-D) convolution operations, since the operations dominate the performance bottleneck during generating proofs. We specifically present a new quadratic matrix programs (QMPs)-based arithmetic circuit with a single multiplication gate for expressing 2-D convolution operations between multiple filters and inputs in a batch manner. Third, we aggregate multiple proofs with respect to a same CNN model but different testers' test data (i.e., different statements) into one proof, and ensure that the validity of the aggregated proof implies the validity of the original multiple proofs. Lastly, our experimental results demonstrate that our QMPs-based zk-SNARK performs nearly 13.9$\times$faster than the existing QAPs-based zk-SNARK in proving time, and 17.6$\times$faster in Setup time, for high-dimension matrix multiplication.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑