{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T16:31:43Z","timestamp":1783096303529,"version":"3.54.6"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/dac63849.2025.11132681","type":"proceedings-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:35:41Z","timestamp":1757957741000},"page":"1-7","source":"Crossref","is-referenced-by-count":3,"title":["zkVC: Fast Zero-Knowledge Proof for Private and Verifiable Computing"],"prefix":"10.1109","author":[{"given":"Yancheng","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Central Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengxin","family":"Zheng","sequence":"additional","affiliation":[{"name":"University of Central Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xun","family":"Chen","sequence":"additional","affiliation":[{"name":"Samsung Research America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingtong","family":"Hu","sequence":"additional","affiliation":[{"name":"University of Pittsburgh"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weidong","family":"Shi","sequence":"additional","affiliation":[{"name":"University of Houston"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lei","family":"Ju","sequence":"additional","affiliation":[{"name":"Shandong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yan","family":"Solihin","sequence":"additional","affiliation":[{"name":"University of Central Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qian","family":"Lou","sequence":"additional","affiliation":[{"name":"University of Central Florida"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2856449"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2010.11929"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2023.3348760"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3485379"},{"key":"ref8","article-title":"Scaling up trustless dnn inference with zero-knowledge proofs","author":"Kang","year":"2022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3262932"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"ref14","article-title":"Safetynets: Verifiable execution of deep neural networks on an untrusted cloud","volume":"30","author":"Ghodsi","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99073-6_8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3068195"},{"key":"ref17","article-title":"Zen: An optimizing compiler for verifiable, zero-knowledge neural network inferences","author":"Feng","year":"2021","journal-title":"Cryptology ePrint Archive, Paper 2021\/087"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"ref20","article-title":"She: A fast and accurate deep neural network for encrypted data","volume":"32","author":"Lou","year":"2019","journal-title":"Advances in neural information processing systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247719"},{"key":"ref22","article-title":"Safenet: A secure, accurate and fast neural network inference","volume-title":"International Conference on Learning Representations","author":"Lou"},{"key":"ref23","first-page":"7102","article-title":"Hemet: A homomorphic-encryption-friendly privacy-preserving mobile neural network architecture","volume-title":"International conference on machine learning.","author":"Lou"},{"key":"ref24","article-title":"vfhe: Verifiable fully homomorphic encryption with blind hash","author":"Lou","year":"2023","journal-title":"arXiv preprint arXiv:2303.08886"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SP61157.2025.00078"},{"key":"ref26","article-title":"Tfhe-coder: Evaluating llmagentic fully homomorphic encryption code generation","author":"Kumar","year":"2025","journal-title":"arXiv preprint arXiv:2503.12217"},{"key":"ref27","first-page":"51063","article-title":"Heprune: Fast private training of deep neural networks with encrypted data pruning","volume":"37","author":"Zhang","year":"2024","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref28","article-title":"Cipherprune: Efficient and scalable private transformer inference","author":"Zhang","year":"2025","journal-title":"arXiv preprint arXiv:2502.16782"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO61859.2024.00033"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"ref32","article-title":"Escaping the big data paradigm with compact transformers","author":"Hassani","year":"2021","journal-title":"arXiv preprint arXiv:2104.05704"},{"key":"ref33","article-title":"Mpcvit: Searching for mpc-friendly vision transformer with heterogeneous attention","author":"Zeng","year":"2022","journal-title":"arXiv preprint arXiv:2211.13955"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV48922.2021.00986"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01055"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W18-5446"},{"key":"ref37","article-title":"libsnark"},{"key":"ref38","article-title":"Efficient attention: Attention with linear complexities","author":"Shen","year":"2020"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00813"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.naacl-main.319"},{"key":"ref41","article-title":"Darts: Differentiable architecture search","author":"Liu","year":"2018","journal-title":"arXiv preprint arXiv:1806.09055"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3149787"},{"key":"ref43","article-title":"Recursive proof composition without a trusted setup","author":"Bowe","year":"2019","journal-title":"Cryptology ePrint Archive"}],"event":{"name":"2025 62nd ACM\/IEEE Design Automation Conference (DAC)","location":"San Francisco, CA, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,25]]}},"container-title":["2025 62nd ACM\/IEEE Design Automation Conference (DAC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11132383\/11132091\/11132681.pdf?arnumber=11132681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T05:24:12Z","timestamp":1758000252000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11132681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/dac63849.2025.11132681","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}