A Survey of Zero-Knowledge Proof Based Verifiable Machine Learning
Zhizhi Peng, Chonghe Zhao, Taotao Wang, Guofu Liao, Zibin Lin, Yifeng Liu, Bin Cao, Long Shi, Qing Yang, and Shengli Zhang

TL;DR
This survey comprehensively reviews zero-knowledge proof techniques applied to verifiable machine learning, covering system designs, challenges, and future directions from 2017 to 2025.
Contribution
It organizes and synthesizes existing ZKML research, highlighting design choices, bottlenecks, and techniques for improving efficiency and generality.
Findings
Identifies key bottlenecks like circuit expressiveness and proving costs.
Classifies ZKML tasks into training, testing, and inference.
Summarizes emerging commercial efforts and future research directions.
Abstract
Machine learning is increasingly deployed through outsourced and cloud-based pipelines, which improve accessibility but also raise concerns about computational integrity, data privacy, and model confidentiality. Zero-knowledge proofs (ZKPs) provide a compelling foundation for verifiable machine learning because they allow one party to certify that a training, testing, or inference result was produced by the claimed computation without revealing sensitive data or proprietary model parameters. Despite rapid progress in zero-knowledge machine learning (ZKML), the literature remains fragmented across different cryptographic settings, ML tasks, and system objectives. This survey presents a comprehensive review of ZKML research published from June 2017 to August 2025. We first introduce the basic ZKP formulations underlying ZKML and organize existing studies into three core tasks: verifiable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
