Fetching the paper…
Reading the bibliography…
The recent advancements in deep learning have brought about significant changes in various aspects of people's lives.
Probabilistic algorithms for sparse polynomials
Richard Zippel · 1979
Earlier work this paper cites.
Fast probabilistic algorithms for verification of polynomial identities
Jacob T. Schwartz · 1980
Earlier work this paper cites.
Algebraic methods for interactive proof systems
Carsten Lund, Lance Fortnow, Howard J. Karloff, and Noam Nisan · 1992
Earlier work this paper cites.
Zero-knowledge from secure multiparty computation
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai · 2007
Earlier work this paper cites.
Delegating computation: interactive proofs for muggles
Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum · 2008
Earlier work this paper cites.
Practical verified computation with streaming interactive proofs
Graham Cormode, Michael Mitzenmacher, and Justin Thaler · 2012
Earlier work this paper cites.
Pinocchio: Nearly practical verifiable computation
Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova · 2013
Earlier work this paper cites.
Time-optimal interactive proofs for circuit evaluation
Justin Thaler · 2013
Earlier work this paper cites.
On the size of pairing-based non-interactive arguments
Jens Groth · 2016
Earlier work this paper cites.
A zero knowledge sumcheck and its applications
Alessandro Chiesa, Michael A. Forbes, and Nicholas Spooner · 2017
Earlier work this paper cites.
Safetynets: Verifiable execution of deep neural networks on an untrusted cloud
Zahra Ghodsi, Tianyu Gu, and Siddharth Garg · 2017
Earlier work this paper cites.
Doubly-efficient zkSNARKs without trusted setup
Riad S. Wahby, Ioanna Tzialla, Abhi Shelat, Justin Thaler, and Michael Walfish · 2018
Earlier work this paper cites.
PLONK: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge
Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru · 2019
Cited alongside, same era.
Libra: Succinct zero-knowledge proofs with optimal prover computation
Tiancheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song · 2019
Cited alongside, same era.
On polynomial approximations for privacy-preserving and verifiable relu networks
Ramy E. Ali, Jinhyun So, and Amir Salman Avestimehr · 2020
Cited alongside, same era.
Halo infinite: Recursive zk-SNARKs from any additive polynomial commitment scheme
Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon · 2020
Cited alongside, same era.
Certified data removal from machine learning models
Chuan Guo, Tom Goldstein, Awni Y. Hannun, and Laurens van der Maaten · 2020
Cited alongside, same era.
Veriml: Enabling integrity assurances and fair payments for machine learning as a service
Lingchen Zhao, Qian Wang, Cong Wang, Qi Li, Chao Shen, and Bo Feng · 2021
Later among the works it cites.
Succinct non-interactive arguments via linear interactive proofs
Nir Bitansky, Alessandro Chiesa, Yuval Ishai, Rafail Ostrovsky, and Omer Paneth · 2022
Later among the works it cites.
Verifiable and provably secure machine unlearning
Thorsten Eisenhofer, Doreen Riepel, Varun Chandrasekaran, Esha Ghosh, Olga Ohrimenko, and Nicolas Papernot · 2022
Later among the works it cites.
On the fundamental limits of formally (dis)proving robustness in proof-of-learning
Congyu Fang, Hengrui Jia, Anvith Thudi, Mohammad Yaghini, Christopher A. Choquette-Choo, Natalie Dullerud, Varun Chandrasekaran, and Nicolas Papernot · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
vCNN: Verifiable convolutional neural network
Seunghwa Lee, Hankyung Ko, Jihye Kim, and Hyunok Oh · 2020
Cited alongside, same era.
Towards probabilistic verification of machine unlearning
David Marco Sommer, Liwei Song, Sameer Wagh, and Prateek Mittal · 2020
Cited alongside, same era.
ZEN: efficient zero-knowledge proofs for neural networks
Boyuan Feng, Lianke Qin, Zhenfei Zhang, Yufei Ding, and Shumo Chu · 2021
Cited alongside, same era.
Proof-of-learning: Definitions and practice
Hengrui Jia, Mohammad Yaghini, Christopher A. Choquette-Choo, Natalie Dullerud, Anvith Thudi, Varun Chandrasekaran, and Nicolas Papernot · 2021
Cited alongside, same era.
zkCNN: Zero knowledge proofs for convolutional neural network predictions and accuracy
Tianyi Liu, Xiang Xie, and Yupeng Zhang · 2021
Cited alongside, same era.
Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning
Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang · 2021
Cited alongside, same era.
Doubly efficient interactive proofs for general arithmetic circuits with linear prover time
Jiaheng Zhang, Tianyi Liu, Weijie Wang, Yinuo Zhang, Dawn Song, Xiang Xie, and Yupeng Zhang · 2021
Cited alongside, same era.
Xiangshan Gao, Xingjun Ma, Jingyi Wang, Youcheng Sun, Bo Li, Shouling Ji, Peng Cheng, and Jiming Chen · 2022
Later among the works it cites.
Scaling up trustless DNN inference with zero-knowledge proofs
Daniel Kang, Tatsunori Hashimoto, Ion Stoica, and Yi Sun · 2022
Later among the works it cites.
Proof of unlearning: Definitions and instantiation
Jia-Si Weng, Shenglong Yao, Yuefeng Du, Junjie Huang, Jian Weng, and Cong Wang · 2022
Later among the works it cites.
Orion: Zero knowledge proof with linear prover time
Tiancheng Xie, Yupeng Zhang, and Dawn Song · 2022
Later among the works it cites.
Adversarial examples for proof-of-learning
Rui Zhang, Jian Liu, Yuan Ding, Zhibo Wang, Qingbiao Wu, and Kui Ren · 2022
Later among the works it cites.
Experimenting with zero-knowledge proofs of training
Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru-Vamsi Policharla, and Mingyuan Wang · 2023
Closest in time.
ezDPS: An efficient and zero-knowledge machine learning inference pipeline
Haodi Wang and Thang Hoang · 2023
Closest in time.
pvcnn: Privacy-preserving and verifiable convolutional neural network testing
Jia-Si Weng, Jian Weng, Gui Tang, Anjia Yang, Ming Li, and Jia-Nan Liu · 2023
Closest in time.