{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,30]],"date-time":"2026-10-30T16:30:30Z","timestamp":1793377830363,"version":"4.5.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Natural Sciences and Engineering ResearchCouncil of Canada (NSERC) Discovery","award":["RGPIN-2022-03215"],"award-info":[{"award-number":["RGPIN-2022-03215"]}]},{"name":"Natural Sciences and Engineering ResearchCouncil of Canada (NSERC) Discovery","award":["DGECR-2022-00357"],"award-info":[{"award-number":["DGECR-2022-00357"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2024.3520863","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T13:57:27Z","timestamp":1734703047000},"page":"914-927","source":"Crossref","is-referenced-by-count":28,"title":["zkDL: Efficient Zero-Knowledge Proofs of Deep Learning Training"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4147-0346","authenticated-orcid":false,"given":"Haochen","family":"Sun","sequence":"first","affiliation":[{"name":"David R. Cheriton School of Computer Science, Faculty of Mathematics, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7338-2986","authenticated-orcid":false,"given":"Tonghe","family":"Bai","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Faculty of Engineering, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jason","family":"Li","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science, Faculty of Mathematics, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0548-6068","authenticated-orcid":false,"given":"Hongyang","family":"Zhang","sequence":"additional","affiliation":[{"name":"David R. Cheriton School of Computer Science, Faculty of Mathematics, University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"On polynomial approximations for privacy-preserving and verifiable ReLU networks","author":"Ali","year":"2020","journal-title":"arXiv:2011.05530"},{"key":"ref2","article-title":"Gemini: A family of highly capable multimodal models","author":"Team","year":"2023","journal-title":"arXiv:2312.11805"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-022-09424-4"},{"key":"ref4","first-page":"1536","article-title":"Halo infinite: Recursive zk-SNARKs from any additive polynomial commitment scheme","volume":"2020","author":"Boneh","year":"2020","journal-title":"IACR"},{"key":"ref5","first-page":"1","article-title":"Language models are few-shot learners","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Brown"},{"key":"ref6","volume-title":"A Zero Knowledge Sumcheck and its Applications","author":"Chiesa","year":"2017"},{"key":"ref7","first-page":"2401","article-title":"PaLM: Scaling language modeling with pathways","volume":"24","author":"Chowdhery","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"ref9","first-page":"257","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume-title":"Proc. 23rd Conf. Learn. Theory","volume":"12","author":"Duchi"},{"key":"ref10","article-title":"Verifiable and provably secure machine unlearning","author":"Eisenhofer","year":"2022","journal-title":"arXiv:2210.09126"},{"key":"ref11","article-title":"Proof-of-learning is currently more broken than you think","author":"Fang","year":"2022","journal-title":"arXiv:2208.03567"},{"key":"ref12","first-page":"87","article-title":"ZEN: Efficient zero-knowledge proofs for neural networks","volume":"2021","author":"Feng","year":"2021","journal-title":"IACR"},{"key":"ref13","volume-title":"EC-GPU","year":"2023"},{"key":"ref14","first-page":"953","article-title":"PLONK: Permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge","volume":"2019","author":"Gabizon","year":"2019","journal-title":"IACR"},{"key":"ref15","article-title":"VeriFi: Towards verifiable federated unlearning","author":"Gao","year":"2022","journal-title":"arXiv:2205.12709"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623202"},{"key":"ref17","first-page":"4672","article-title":"SafetyNets: Verifiable execution of deep neural networks on an untrusted cloud","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Ghodsi"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref20","first-page":"3832","article-title":"Certified data removal from machine learning models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Guo"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250794"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00106"},{"key":"ref23","article-title":"Scaling up trustless DNN inference with zero-knowledge proofs","author":"Kang","year":"2022","journal-title":"arXiv:2210.08674"},{"key":"ref24","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref25","first-page":"584","article-title":"VCNN: Verifiable convolutional neural network","volume":"2020","author":"Lee","year":"2020","journal-title":"IACR"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485379"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"ref28","article-title":"GPT-4 technical report","volume-title":"arXiv:2303.08774","author":"OpenAI","year":"2023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref31","article-title":"Towards probabilistic verification of machine unlearning","author":"Marco Sommer","year":"2020","journal-title":"arXiv:2003.04247"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"ref33","volume-title":"Divide the Gradient By a Running Average of Its Recent Magnitude","author":"Tieleman","year":"2012"},{"key":"ref34","article-title":"LLaMA: Open and efficient foundation language models","author":"Touvron","year":"2023","journal-title":"arXiv:2302.13971"},{"key":"ref35","article-title":"Llama 2: Open foundation and fine-tuned chat models","author":"Touvron","year":"2023","journal-title":"arXiv:2307.09288"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0061"},{"key":"ref38","first-page":"501","article-title":"Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning","volume-title":"Proc. 30th USENIX Secur. Symp.","author":"Weng"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3262932"},{"key":"ref40","article-title":"Proof of unlearning: Definitions and instantiation","author":"Weng","year":"2022","journal-title":"arXiv:2210.11334"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484767"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833596"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3068195"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/10810453.pdf?arnumber=10810453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T14:44:08Z","timestamp":1736865848000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10810453\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/tifs.2024.3520863","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}