提出vPIN方案,让用户在不泄露数据的前提下验证AI推理结果的正确性。
Privacy-Preserving Verifiable Neural Network Inference Service
- 用部分同态加密与简洁零知识证明保护数据隐私
- 证明时间仅需0.43秒,证明大小仅16.8KB,验证速度快
- 适合需要可信推理的医疗、金融等敏感场景
机器学习已革新数据分析与模式识别,但其训练资源密集限制了普及。机器学习即服务(MLaaS)通过让用户将数据委托给预训练模型的提供方获取推理结果,简化了使用流程。然而,这种模式带来显著的隐私与可靠性风险:客户端数据可能被恶意提供商泄露,且缺乏可验证性可能导致推理偏差或不公平计费。现有可信机器学习技术如可验证计算或安全计算虽能解决部分问题,但难以同时保障数据隐私和推理可验证性。本文提出vPIN,一种隐私保护且可验证的CNN推理方案,既保护客户端数据隐私,又确保推理结果可验证。vPIN结合部分同态加密与承诺-证明简洁非交互式知识论证技术,并设计多种优化策略,显著减小同态推理的证明电路,提升效率。我们在标准数据集(如MNIST、CIFAR-10)上完整实现并评估该方案,实验结果表明,vPIN在证明时间(0.43秒)、验证时间与证明大小(16.8KB)方面表现优异,同时提供数据隐私保障与可证明的可验证性。
原文摘要 · Abstract (English)
Machine learning has revolutionized data analysis and pattern recognition, but its resource-intensive training has limited accessibility. Machine Learning as a Service (MLaaS) simplifies this by enabling users to delegate their data samples to an MLaaS provider and obtain the inference result using a pre-trained model. Despite its convenience, leveraging MLaaS poses significant privacy and reliability concerns to the client. Specifically, sensitive information from the client inquiry data can be leaked to an adversarial MLaaS provider. Meanwhile, the lack of a verifiability guarantee can potentially result in biased inference results or even unfair payment issues. While existing trustworthy machine learning techniques, such as those relying on verifiable computation or secure computation, offer solutions to privacy and reliability concerns, they fall short of simultaneously protecting the privacy of client data and providing provable inference verifiability. In this paper, we propose vPIN, a privacy-preserving and verifiable CNN inference scheme that preserves privacy for client data samples while ensuring verifiability for the inference. vPIN makes use of partial homomorphic encryption and commit-and-prove succinct non-interactive argument of knowledge techniques to achieve desirable security properties. In vPIN, we develop various optimization techniques to minimize the proving circuit for homomorphic inference evaluation thereby, improving the efficiency and performance of our technique. We fully implemented and evaluated our vPIN scheme on standard datasets (e.g., MNIST, CIFAR-10). Our experimental results show that vPIN achieves high efficiency in terms of proving time, verification time, and proof size, while providing client data privacy guarantees and provable verifiability.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。