Fetching the paper…
Reading the bibliography…
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.
R. E. Burkard, “Quadratic assignment problems,” European Journal of Operational Research , vol. 15, no. 3, pp. 283–289, 1984
1984
Earlier work this paper cites.
A. De Santis and G. Persiano, “Zero-knowledge proofs of knowledge without interaction,” in Proc. 33rd Annual Symposium on Foundations of Computer Science , 1992, pp. 427–436
1992
Earlier work this paper cites.
C. Lund, L. Fortnow, H. Karloff, and N. Nisan, “Algebraic methods for interactive proof systems,” Journal of the ACM , vol. 39, no. 4, pp. 859–868, 1992
1992
Earlier work this paper cites.
J. Camenisch and M. Stadler, “Proof systems for general statements about discrete logarithms,” Technical Report/ETH Zurich, Department of Computer Science , vol. 260, 1997
1997
Earlier work this paper cites.
R. Canetti, O. Goldreich, S. Goldwasser, and S. Micali, “Resettable zero-knowledge,” in Proc. the thirty-second annual ACM symposium on Theory of computing , 2000, pp. 235–244
2000
Earlier work this paper cites.
C. Dwork, “Differential privacy,” in Proc. International colloquium on automata, languages, and programming , 2006, pp. 1–12
2006
Earlier work this paper cites.
R. Chaabouni, “Efficient protocols for set membership and range proofs,” Master’s thesis, EPFL, 2007
2007
Earlier work this paper cites.
——, “Differential privacy: A survey of results,” in Theory and Applications of Models of Computation , 2008, pp. 1–19
2008
Earlier work this paper cites.
2011
Earlier work this paper cites.
E. B. Sasson, A. Chiesa, C. Garman, M. Green, I. Miers, E. Tromer, and M. Virza, “Zerocash: Decentralized anonymous payments from bitcoin,” in Proc. 2014 IEEE Symposium on Security and Privacy . IEEE, 2014, pp. 459–474
2014
Earlier work this paper cites.
X. Yi, R. Paulet, E. Bertino, X. Yi, R. Paulet, and E. Bertino, Homomorphic encryption . Springer, 2014, pp. 27–46
2014
Earlier work this paper cites.
A. E. Kosba, D. Papadopoulos, C. Papamanthou, M. F. Sayed, E. Shi, and N. Triandopoulos, “TRUESET: Faster verifiable set computations,” in Proc. 23rd USENIX Security Symposium , 2014, pp. 765–780
2014
Earlier work this paper cites.
2014
Earlier work this paper cites.
M. Ribeiro, K. Grolinger, and M. A. Capretz, “Mlaas: Machine learning as a service,” in Proc. 2015 IEEE 14th International Conference on Machine Learning and Applications (ICMLA) , 2015, pp. 896–902
2015
Earlier work this paper cites.
M. I. Jordan and T. M. Mitchell, “Machine learning: Trends, perspectives, and prospects,” Science , vol. 349, no. 6245, pp. 255–260, 2015
2015
Earlier work this paper cites.
J. Thaler, “A note on the GKR protocol,” 2015, unpublished manuscript
2015
Earlier work this paper cites.
M. Sabt, M. Achemlal, and A. Bouabdallah, “Trusted execution environment: What it is, and what it is not,” in Proc. 2015 IEEE Trustcom/BigDataSE/Ispa , vol. 1. IEEE, 2015, pp. 57–64
2015
Earlier work this paper cites.
2016
Earlier work this paper cites.
Z. Ghodsi, T. Gu, and S. Garg, “Safetynets: Verifiable execution of deep neural networks on an untrusted cloud,” in Proc. 2017 Advances in Neural Information Processing Systems , vol. 30, 2017, pp. 1–10
2017
Earlier work this paper cites.
D. Froelicher, P. Egger, J. S. Sousa, J. L. Raisaro, Z. Huang, C. V. Mouchet, B. A. Ford, and J.-P. Hubaux, “Unlynx: a decentralized system for privacy-conscious data sharing,” Proceedings on Privacy Enhancing Technologies (PoPETS) , vol. 2017, no. 4, pp. 232–250, 2017
2017
Earlier work this paper cites.
E. Ben-Sasson, I. Bentov, Y. Horesh, and M. Riabzev, “Scalable, transparent, and post-quantum secure computational integrity,” Cryptology ePrint Archive , 2018
2018
Earlier work this paper cites.
R. S. Wahby, I. Tzialla, A. Shelat, J. Thaler, and M. Walfish, “Doubly-efficient zksnarks without trusted setup,” in Proc. 2018 IEEE Symposium on Security and Privacy (SP) . IEEE, 2018, pp. 926–943
2018
Earlier work this paper cites.
M. Sandler, A. Howard, M. Zhu, A. Zhmoginov, and L.-C. Chen, “Mobilenetv2: Inverted residuals and linear bottlenecks,” in Proc. the IEEE Conference on Computer Vision and Pattern Recognition , 2018, pp. 4510–4520
2018
Earlier work this paper cites.
B. Jacob, S. Kligys, B. Chen, M. Zhu, M. Tang, A. Howard, H. Adam, and D. Kalenichenko, “Quantization and training of neural networks for efficient integer-arithmetic-only inference,” in Proc. the IEEE Conference on Computer Vision and Pattern Recognition , June 2018
2018
Earlier work this paper cites.
M. Al-Rubaie and J. M. Chang, “Privacy-preserving machine learning: Threats and solutions,” IEEE Security & Privacy , vol. 17, no. 2, pp. 49–58, 2019
2019
Earlier work this paper cites.
X. Wang, J. Li, X. Kuang, Y.-a. Tan, and J. Li, “The security of machine learning in an adversarial setting: A survey,” Journal of Parallel and Distributed Computing , vol. 130, pp. 12–23, 2019
2019
Earlier work this paper cites.
E. Ben-Sasson, I. Bentov, Y. Horesh, and M. Riabzev, “Scalable zero knowledge with no trusted setup,” in Advances in Cryptology–CRYPTO 2019 , 2019, pp. 701–732
2019
Earlier work this paper cites.
C. Zhao, S. Zhao, M. Zhao, Z. Chen, C.-Z. Gao, H. Li, and Y.-a. Tan, “Secure multi-party computation: theory, practice and applications,” Information Sciences , vol. 476, pp. 357–372, 2019
2019
Earlier work this paper cites.
E. Ben-Sasson, A. Chiesa, M. Riabzev, N. Spooner, M. Virza, and N. P. Ward, “Aurora: Transparent succinct arguments for R1CS,” in Proc. Advances in Cryptology–EUROCRYPT 2019 , 2019, pp. 103–128
2019
Cited alongside, same era.
A. Gabizon, Z. J. Williamson, and O. Ciobotaru, “Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge,” Cryptology ePrint Archive , 2019
2019
Cited alongside, same era.
N. Rieke, J. Hancox, W. Li, F. Milletari, H. R. Roth, S. Albarqouni, S. Bakas, M. N. Galtier, B. A. Landman, K. Maier-Hein et al. , “The future of digital health with federated learning,” NPJ Digital Medicine , vol. 3, no. 1, pp. 1–7, 2020
2020
Cited alongside, same era.
D. Froelicher, J. R. Troncoso-Pastoriza, J. S. Sousa, and J.-P. Hubaux, “Drynx: Decentralized, secure, verifiable system for statistical queries and machine learning on distributed datasets,” IEEE Transactions on Information Forensics and Security , vol. 15, pp. 3035–3050, 2020
2020
Y. Fan, B. Xu, L. Zhang, J. Song, A. Zomaya, and K.-C. Li, “Validating the integrity of convolutional neural network predictions based on zero-knowledge proof,” Information Sciences , vol. 625, pp. 125–140, 2023
2023
Later among the works it cites.
D. Balbás, D. Fiore, M. I. G. Vasco, D. Robissout, and C. Soriente, “Modular sumcheck proofs with applications to machine learning and image processing,” Cryptology ePrint Archive , 2023, paper 2023/1342
2023
Later among the works it cites.
A. Karpathy, “nanogpt: The simplest, fastest repository for training/finetuning medium-sized gpts,” GitHub repository , 2023, available: https://github.com/karpathy/nanoGPT
2023
Later among the works it cites.
K. Abbaszadeh, C. Pappas, J. Katz, and D. Papadopoulos, “Zero-knowledge proofs of training for deep neural networks,” Cryptology ePrint Archive , 2024
2024
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
S. Setty, “Spartan: Efficient and general-purpose zksnarks without trusted setup,” in Proc. Annual International Cryptology Conference . Springer, 2020, pp. 704–737
2020
Cited alongside, same era.
Y. Chen, G. Huang, J. Shi, X. Xie, and Y. Yan, “Rosetta: A privacy-preserving framework based on tensorflow,” 2020. [Online]. Available: https://github.com/LatticeX-Foundation/Rosetta
2020
Cited alongside, same era.
J. Bonneau, I. Meckler, V. Rao, and E. Shapiro, “Coda: Decentralized cryptocurrency at scale,” Cryptology ePrint Archive , 2020, paper 2020/352
2020
Cited alongside, same era.
C. Janiesch, P. Zschech, and K. Heinrich, “Machine learning and deep learning,” Electronic Markets , vol. 31, no. 3, pp. 685–695, 2021
2021
Cited alongside, same era.
L. Zhao, Q. Wang, C. Wang, Q. Li, C. Shen, and B. Feng, “Veriml: Enabling integrity assurances and fair payments for machine learning as a service,” IEEE Transactions on Parallel and Distributed Systems , vol. 32, no. 10, pp. 2524–2540, 2021
2021
Cited alongside, same era.
B. Feng, L. Qin, Z. Zhang, Y. Ding, and S. Chu, “ZEN: An optimizing compiler for verifiable, zero-knowledge neural network inferences,” Cryptology ePrint Archive , 2021
2021
Cited alongside, same era.
T. Liu, X. Xie, and Y. Zhang, “zkCNN: Zero knowledge proofs for convolutional neural network predictions and accuracy,” in Proc. 2021 ACM SIGSAC Conf. Comput. Commun. Secur. , 2021, pp. 2968–2985
2021
Cited alongside, same era.
C. Weng, K. Yang, X. Xie, J. Katz, and X. Wang, “Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning,” in Proc. 30th USENIX Security Symposium , 2021, pp. 501–518
2021
Cited alongside, same era.
2024
Later among the works it cites.
S. Lee, H. Ko, J. Kim, and H. Oh, “vCNN: Verifiable convolutional neural network based on zk-SNARKs,” IEEE Transactions on Dependable and Secure Computing , vol. 21, no. 4, pp. 4254–4270, 2024
2024
Later among the works it cites.
B.-J. Chen, S. Waiwitlikhit, I. Stoica, and D. Kang, “Zkml: An optimizing system for ml inference in zero-knowledge proofs,” in Proceedings of the Nineteenth European Conference on Computer Systems , 2024, pp. 560–574
2024
Later among the works it cites.
H. Sun, J. Li, and H. Zhang, “zkLLM: Zero knowledge proofs for large language models,” in Proc. The ACM Conference on Computer and Communications Security , 2024, pp. 4405–4419
2024
Later among the works it cites.
T. Lu, H. Wang, W. Qu, Z. Wang, J. He, T. Tao, W. Chen, and J. Zhang, “An efficient and extensible zero-knowledge proof framework for neural networks,” Cryptology ePrint Archive , 2024
2024
Later among the works it cites.
M. Hao, H. Chen, H. Li, C. Weng, Y. Zhang, H. Yang, and T. Zhang, “Scalable zero-knowledge proofs for non-linear functions in machine learning,” in Proc. 33rd USENIX Security Symposium , 2024, pp. 3819–3836
2024
Later among the works it cites.
B.-M. Ganescu and J. Passerat-Palmbach, “Trust the process: Zero-knowledge machine learning to enhance trust in generative AI interactions,” arXiv preprint , vol. arXiv: 2402.06414, 2024
2024
Later among the works it cites.
M. Campanelli, A. Faonio, D. Fiore, T. Li, and H. Lipmaa, “Lookup arguments: improvements, extensions and applications to zero-knowledge decision trees,” in Proc. IACR International Conference on Public-Key Cryptography . Springer, 2024, pp. 337–369
2024
Later among the works it cites.
A. Li, Q. Liang, and M. Dong, “Sparsity-aware protocol for zk-friendly ML models: Shedding lights on practical ZKML,” Cryptology ePrint Archive , 2024
2024
Later among the works it cites.
Q. Zhan, Y. Liu, Z. Xie, and Y. Liu, “Validating the integrity for deep learning models based on zero-knowledge proof and blockchain,” in Proc. Blockchain and Web3 Technology Innovation and Application Exchange Conference , 2024, pp. 387–399
2024
Later among the works it cites.
S. Setty, J. Thaler, and R. Wahby, “Unlocking the lookup singularity with lasso,” in Proc. Annual International Conference on the Theory and Applications of Cryptographic Techniques . Springer, 2024, pp. 180–209
2024
Later among the works it cites.
EZKL Team, “Ezkl documentation,” 2024, available: https://ezkl.xyz/ . Accessed: Nov. 2024
2024
Later among the works it cites.
DeFiChain, “Connecting old and new worlds,” 2024, available: https://defichain.com/ . Accessed: Nov. 2024
2024
Later among the works it cites.
Modulus Labs, “Modulus xyz: Enabling modular web3 infrastructure,” 2024, available: https://www.modulus.xyz/ . Accessed: Nov. 2024
2024
Later among the works it cites.
Giza, “Streamline blockchain complexity through autonomous agents,” 2024, available: https://gizatech.xyz/ . Accessed: Nov. 2024
2024
Later among the works it cites.
zkaptcha, “Zero-knowledge captcha,” 2024, available: https://www.zkaptcha.xyz/ . Accessed: Nov. 2024
2024
Later among the works it cites.
J. Ma, H. Liu, M. Zhang, and Z. Liu, “Vpfl: Enabling verifiability and privacy in federated learning with zero-knowledge proofs,” Knowledge-Based Systems , vol. 299, p. 112115, 2024
2024
Later among the works it cites.
Z. Xing, Z. Zhang, Z. Zhang, Z. Li, M. Li, J. Liu, Z. Zhang, Y. Zhao, Q. Sun, L. Zhu, and G. Russello, “Zero-knowledge proof-based verifiable decentralized machine learning in communication network: A comprehensive survey,” IEEE Communications Surveys & Tutorials , pp. 1–1, 2025
2025
Closest in time.
2025
Closest in time.
W. Qu, Y. Sun, X. Liu et al. , “zkGPT: An efficient non-interactive zero-knowledge proof framework for LLM inference,” in 34st USENIX Security Symposium (USENIX Security 25) , 2025
2025
Closest in time.
J. Wei, Y. Chen, X. Yang, Y. Luo, and X. Pei, “A verifiable scheme for differential privacy based on zero-knowledge proofs,” Journal of King Saud University Computer and Information Sciences , vol. 37, no. 3, pp. 1–15, 2025
2025
Closest in time.
2025
Closest in time.
G. Liao, T. Wang, S. Zhang, J. Zhang, S. Long, and D. Tao, “Verilora: Fine-tuning large language models with verifiable security via zero-knowledge proofs,” NDSS 2026 , 2026
2026
Closest in time.
J. Zhang, Z. Fang, Y. Zhang, and D. Song, “Zero knowledge proofs for decision tree predictions and accuracy,” in Proc. the 2020 ACM SIGSAC Conference on Computer and Communications Security , 2020, pp. 2039–2053
2053
Closest in time.