{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:29:05Z","timestamp":1771468145167,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T00:00:00Z","timestamp":1636761600000},"content-version":"vor","delay-in-days":1,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["TWC-1518899"],"award-info":[{"award-number":["TWC-1518899"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DARPA","award":["N66001-15-C-4066"],"award-info":[{"award-number":["N66001-15-C-4066"]}]},{"name":"Center for Long-Term Cybersecurity (CLTC)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484767","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"159-177","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":44,"title":["Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time"],"prefix":"10.1145","author":[{"given":"Jiaheng","family":"Zhang","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"Tianyi","family":"Liu","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}]},{"given":"Weijie","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"given":"Yinuo","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"Dawn","family":"Song","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"given":"Xiang","family":"Xie","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Privacy-Preserving Computation, Shangha, China"}]},{"given":"Yupeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2014. Buffet. https:\/\/github.com\/pepper-project\/releases. (2014)."},{"key":"e_1_3_2_2_2_1","unstructured":"2015. jsnark. https:\/\/github.com\/akosba\/jsnark. (2015)."},{"key":"e_1_3_2_2_3_1","unstructured":"2017. Oasis Labs. https:\/\/www.oasislabs.com\/. (2017)."},{"key":"e_1_3_2_2_4_1","unstructured":"2018. Bristol Circuits. https:\/\/homes.esat.kuleuven.be\/~nsmart\/MPC\/. (2018)."},{"key":"e_1_3_2_2_5_1","unstructured":"2019. DARPA SIEVE program. https:\/\/www.darpa.mil\/news-events\/2019-07--18. (2019)."},{"key":"e_1_3_2_2_6_1","unstructured":"2020. libiop. https:\/\/github.com\/scipr-lab\/libiop. (2020)."},{"key":"e_1_3_2_2_7_1","unstructured":"2020. Spartan. https:\/\/github.com\/microsoft\/Spartan. (2020)."},{"key":"e_1_3_2_2_8_1","unstructured":"2020. STARK implementation. https:\/\/github.com\/novifinancial\/winterfell. (2020)."},{"key":"e_1_3_2_2_9_1","unstructured":"2020. Virgo implementation. https:\/\/github.com\/sunblaze-ucb\/Virgo. (2020)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_11_1","volume-title":"Non-deterministic exponential time has two-prover interactive protocols. Computational complexity 1, 1","author":"Babai L\u00e1szl\u00f3","year":"1991","unstructured":"L\u00e1szl\u00f3 Babai, Lance Fortnow, and Carsten Lund. 1991. Non-deterministic exponential time has two-prover interactive protocols. Computational complexity 1, 1 (1991), 3--40."},{"key":"e_1_3_2_2_12_1","volume-title":"Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. In Annual International Cryptology Conference. Springer, 669--699","author":"Baum Carsten","year":"2018","unstructured":"Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafa\u00ebl Del Pino, Jens Groth, and Vadim Lyubashevsky. 2018. Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. In Annual International Cryptology Conference. Springer, 669--699."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"e_1_3_2_2_17_1","volume-title":"Proceedings of the USENIX Security Symposium","author":"Ben-Sasson Eli","year":"2014","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In Proceedings of the USENIX Security Symposium, 2014."},{"key":"e_1_3_2_2_18_1","unstructured":"Andrew J. Blumberg Justin Thaler Victor Vu and Michael Walfish. 2014. Verifiable computation using multiple provers. Cryptology ePrint Archive Report 2014\/846. (2014). https:\/\/eprint.iacr.org\/2014\/846."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133997"},{"key":"e_1_3_2_2_23_1","volume-title":"A Zero Knowledge Sumcheck and its Applications. CoRR abs\/1704.02086","author":"Chiesa Alessandro","year":"2017","unstructured":"Alessandro Chiesa, Michael A. Forbes, and Nicholas Spooner. 2017. A Zero Knowledge Sumcheck and its Applications. CoRR abs\/1704.02086 (2017). arXiv:1704.02086 http:\/\/arxiv.org\/abs\/1704.02086"},{"key":"e_1_3_2_2_24_1","volume-title":"Justin Thaler. Practical Verified Computation with Streaming Interactive Proofs. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS '12)","author":"Cormode Graham","unstructured":"Graham Cormode, Michael Mitzenmacher, and Justin Thaler. Practical Verified Computation with Streaming Interactive Proofs. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS '12)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"e_1_3_2_2_28_1","volume-title":"ZEN: Efficient Zero-Knowledge Proofs for Neural Networks. Cryptology ePrint Archive, Report 2021\/087.","author":"Feng Boyuan","year":"2021","unstructured":"Boyuan Feng, Lianke Qin, Zhenfei Zhang, Yufei Ding, and Shumo Chu. 2021. ZEN: Efficient Zero-Knowledge Proofs for Neural Networks. Cryptology ePrint Archive, Report 2021\/087. (2021). https:\/\/eprint.iacr.org\/2021\/087."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978368"},{"key":"e_1_3_2_2_30_1","volume-title":"Safetynets: Verifiable execution of deep neural networks on an untrusted cloud. In Advances in Neural Information Processing Systems. 4672--4681.","author":"Ghodsi Zahra","year":"2017","unstructured":"Zahra Ghodsi, Tianyu Gu, and Siddharth Garg. 2017. Safetynets: Verifiable execution of deep neural networks on an untrusted cloud. In Advances in Neural Information Processing Systems. 4672--4681."},{"key":"e_1_3_2_2_31_1","volume-title":"USENIX Security Symposium. 1069--1083","author":"Giacomelli Irene","year":"2016","unstructured":"Irene Giacomelli, Jesper Madsen, and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits.. In USENIX Security Symposium. 1069--1083."},{"key":"e_1_3_2_2_32_1","volume-title":"International conference on machine learning. PMLR, 201--210","author":"Gilad-Bachrach Ran","year":"2016","unstructured":"Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin Lauter, Michael Naehrig, and John Wernsing. 2016. Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy. In International conference on machine learning. PMLR, 201--210."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_3_2_2_34_1","series-title":"SIAM Journal on computing 18, 1","volume-title":"The knowledge complexity of interactive proof systems","author":"Goldwasser Shafi","year":"1989","unstructured":"Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1989. The knowledge complexity of interactive proof systems. SIAM Journal on computing 18, 1 (1989), 186--208."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_2_37_1","unstructured":"Seunghwa Lee Hankyung Ko Jihye Kim and Hyunok Oh. 2020. vCNN: Verifiable Convolutional Neural Network based on zk-SNARKs. Cryptology ePrint Archive Report 2020\/584. (2020). https:\/\/eprint.iacr.org\/2020\/584."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.23"},{"key":"e_1_3_2_2_40_1","volume-title":"Pinocchio: Nearly practical verifiable computation. In S&P","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly practical verifiable computation. In S&P 2013. 238--252."},{"key":"e_1_3_2_2_41_1","unstructured":"Ben Perez. 2020. Reinventing Vulnerability Disclosure using Zero-knowledge Proofs. https:\/\/securityboulevard.com\/2020\/05\/reinventing-vulnerability-disclosure-using-zero-knowledge-proofs\/. (2020)."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_2_43_1","volume-title":"Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275.","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty and Jonathan Lee. 2020. Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275. (2020). https:\/\/eprint.iacr.org\/2020\/1275."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146609"},{"key":"e_1_3_2_2_45_1","volume-title":"Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556","author":"Simonyan Karen","year":"2014","unstructured":"Karen Simonyan and Andrew Zisserman. 2014. Very deep convolutional networks for large-scale image recognition. arXiv preprint arXiv:1409.1556 (2014)."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.51"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133984"},{"key":"e_1_3_2_2_49_1","volume-title":"Zuocheng Ren, Andrew J Blumberg, and Michael Walfish.","author":"Wahby Riad S","year":"2015","unstructured":"Riad S Wahby, Srinath TV Setty, Zuocheng Ren, Andrew J Blumberg, and Michael Walfish. 2015. Efficient RAM and control flow in verifiable outsourced computation.. In NDSS."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2641562"},{"key":"e_1_3_2_2_52_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2020. EMP-toolkit: Efficient Multiparty computation toolkit. https:\/\/github.com\/emp-toolkit. (2020)."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417278"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"},{"key":"e_1_3_2_2_57_1","unstructured":"Yupeng Zhang Daniel Genkin Jonathan Katz Dimitrios Papadopoulos and Charalampos Papamanthou. 2017. A Zero-Knowledge Version of vSQL. Cryptology ePrint. (2017)."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00013"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484767","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484767","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:51:23Z","timestamp":1763499083000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":58,"alternative-id":["10.1145\/3460120.3484767","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484767","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}