{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:26:12Z","timestamp":1781519172859,"version":"3.54.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Institute for Information & Communications Technology Promotion","award":["2021-0-00518"],"award-info":[{"award-number":["2021-0-00518"]}]},{"name":"Blockchain privacy preserving techniques based on data encryption","award":["2021-0-00532"],"award-info":[{"award-number":["2021-0-00532"]}]},{"name":"Blockchain scalability solutions supporting high performance\/capacity transactions","award":["2021-0-00727"],"award-info":[{"award-number":["2021-0-00727"]}]},{"name":"A Study on Cryptographic Primitives for SNARK","award":["2021-0-00528"],"award-info":[{"award-number":["2021-0-00528"]}]},{"name":"Development of Hardware-centric Trusted Computing Base and Standard Protocol for Distributed Secure Data Box"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1109\/tdsc.2023.3348760","type":"journal-article","created":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T20:08:49Z","timestamp":1704139729000},"page":"4254-4270","source":"Crossref","is-referenced-by-count":62,"title":["vCNN: Verifiable Convolutional Neural Network Based on zk-SNARKs"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7336-1817","authenticated-orcid":false,"given":"Seunghwa","family":"Lee","sequence":"first","affiliation":[{"name":"Kookmin University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9430-1768","authenticated-orcid":false,"given":"Hankyung","family":"Ko","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2953-7883","authenticated-orcid":false,"given":"Jihye","family":"Kim","sequence":"additional","affiliation":[{"name":"Kookmin University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9044-7441","authenticated-orcid":false,"given":"Hyunok","family":"Oh","sequence":"additional","affiliation":[{"name":"Hanyang University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2856449"},{"key":"ref2","first-page":"305","article-title":"On the size of pairing-based non-interactive arguments","volume-title":"Proc. 35th Annu. Int. Conf. Theory Appl. Cryptographic Techn.","author":"Groth"},{"key":"ref3","first-page":"626","article-title":"Quadratic span programs and succinct NIZKs without PCPs","volume-title":"Proc. 32nd Annu. Int. Conf. Theory Appl. Cryptographic Techn.","author":"Gennaro"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1145\/1374376.1374396","article-title":"Delegating computation: Interactive proofs for muggles","volume-title":"Proc. Electron. Colloq. Comput. Complexity","author":"Goldwasser"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/sp.2018.00060"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"ref7","first-page":"129","article-title":"Non-interactive and information-theoretic secure verifiable secret sharing","volume-title":"Proc. 11th Annu. Int. Cryptol. Conf.","author":"Pedersen"},{"key":"ref8","article-title":"Very deep convolutional networks for large-scale image recognition","author":"Simonyan","year":"2014"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2017.8050588"},{"key":"ref10","article-title":"Fast training of convolutional networks through FFTs","volume-title":"Proc. 2nd Int. Conf. Learn. Representations","author":"Mathieu"},{"key":"ref11","first-page":"765","article-title":"TRUESET: Faster verifiable set computations","volume-title":"Proc. 23rd USENIX Secur. Symp.","author":"Kosba"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/sp.2018.00018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"ref14","first-page":"201","article-title":"CryptoNets: Applying neural networks to encrypted data with high throughput and accuracy","volume-title":"Proc. 33rd Int. Conf. Mach. Learn.","author":"Gilad-Bachrach"},{"key":"ref15","first-page":"1651","article-title":"GAZELLE: A low latency framework for secure neural network inference","volume-title":"Proc. 27th USENIX Secur. Symp.","author":"Juvekar"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243837"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363207"},{"key":"ref18","first-page":"4675","article-title":"SafetyNets: Verifiable execution of deep neural networks on an untrusted cloud","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ghodsi"},{"key":"ref19","article-title":"VeriML: Enabling integrity assurances and fair payments for machine learning as a service","author":"Zhao","year":"2019"},{"key":"ref20","first-page":"152","article-title":"Efficient proof composition for verifiable computation","volume-title":"Proc. 23rd Eur. Symp. Res. Comput. Secur.","author":"Keuffer"},{"key":"ref21","first-page":"315","article-title":"Succinct non-interactive arguments via linear interactive proofs","volume-title":"Proc. 10th Theory Cryptogr. Conf.","author":"Bitansky"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"ref23","first-page":"90","article-title":"SNARKs for C: Verifying program executions succinctly and in zero knowledge","volume-title":"Proc. 33rd Annu. Cryptol. Conf.","author":"Ben-Sasson"},{"key":"ref24","first-page":"781","article-title":"Succinct non-interactive zero knowledge for a von Neumann architecture","volume-title":"Proc. 23rd USENIX Secur. Symp.","author":"Ben-Sasson"},{"key":"ref25","first-page":"71","article-title":"Time-optimal interactive proofs for circuit evaluation","volume-title":"Proc. 33rd Annu. Cryptol. Conf.","author":"Thaler"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/sp.2014.36"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/cybermatics_2018.2018.00199"},{"key":"ref30","article-title":"Slalom: Fast, verifiable and private execution of neural networks in trusted hardware","volume-title":"Proc. 7th Int. Conf. Learn. Representations","author":"Tram\u00e8r"},{"key":"ref31","first-page":"839","article-title":"Probabilistic machines can use less running time","volume-title":"Proc. 7th IFIP Congr. Inf. Process.","author":"Freivalds"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3065386"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488623"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_3"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/10592103\/10379135.pdf?arnumber=10379135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T04:49:08Z","timestamp":1721191748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10379135\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2023.3348760","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}