{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:02:37Z","timestamp":1778292157057,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key Research and Development Project","award":["2020YFA0712300"],"award-info":[{"award-number":["2020YFA0712300"]}]},{"name":"Shandong Key Research and Development Program","award":["2020ZLYS09"],"award-info":[{"award-number":["2020ZLYS09"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3559387","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"3195-3208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["VOProof"],"prefix":"10.1145","author":[{"given":"Yuncong","family":"Zhang","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Szepeniec","sequence":"additional","affiliation":[{"name":"Nervos, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren","family":"Zhang","sequence":"additional","affiliation":[{"name":"Cryptape Co. Ltd. & Nervos, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Feng","family":"Sun","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geng","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"https:\/\/zk.money","year":"2021","unstructured":"2021. Aztec. ( 2021 ). https:\/\/zk.money . 2021. Aztec. (2021). https:\/\/zk.money."},{"key":"e_1_3_2_2_2_1","unstructured":"2021. ZK-Rollup development experience sharing. (2021). https:\/\/www.fluidex. io\/en\/blog\/zkrollup-intro1\/.  2021. ZK-Rollup development experience sharing. (2021). https:\/\/www.fluidex. io\/en\/blog\/zkrollup-intro1\/."},{"key":"e_1_3_2_2_3_1","unstructured":"2021. zkSync. (2021). https:\/\/zksync.io.  2021. zkSync. (2021). https:\/\/zksync.io."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_23"},{"key":"e_1_3_2_2_5_1","first-page":"46","article-title":"Scalable, transparent, and post-quantum secure computational integrity","volume":"2018","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson , Iddo Bentov , Yinon Horesh , and Michael Riabzev . 2018 . Scalable, transparent, and post-quantum secure computational integrity . IACR Cryptol. ePrint Arch. 2018 (2018), 46 . http:\/\/eprint.iacr.org\/2018\/046 Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. 2018 (2018), 46. http:\/\/eprint.iacr.org\/2018\/046","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_7_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Michael Riabzev , Nicholas Spooner , Madars Virza , and Nicholas P . Ward . 2019 . Aurora : Transparent Succinct Arguments for R1CS. In Advances in Cryptology - EUROCRYPT 2019 (LNCS), Vol. 11476 . Springer , 103--128. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4 10.1007\/978-3-030-17653-2_4 Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. In Advances in Cryptology - EUROCRYPT 2019 (LNCS), Vol. 11476. Springer, 103--128. https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090263"},{"key":"e_1_3_2_2_9_1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM, 103--112","author":"Blum Manuel","year":"1988","unstructured":"Manuel Blum , Paul Feldman , and Silvio Micali . 1988 . Non-Interactive Zero- Knowledge and Its Applications (Extended Abstract) . In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM, 103--112 . https:\/\/doi. org\/10.1145\/62212.62222 Manuel Blum, Paul Feldman, and Silvio Micali. 1988. Non-Interactive Zero- Knowledge and Its Applications (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing. ACM, 103--112. https:\/\/doi. org\/10.1145\/62212.62222"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_2_11_1","volume-title":"Jakobsen","author":"Bootle Jonathan","year":"2017","unstructured":"Jonathan Bootle , Andrea Cerulli , Essam Ghadafi , Jens Groth , Mohammad Hajiabadi , and Sune K . Jakobsen . 2017 . Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In International Conference on the Theory and Application of Cryptology and Information Security. Springer , 336--365. Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, and Sune K. Jakobsen. 2017. Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In International Conference on the Theory and Application of Cryptology and Information Security. Springer, 336--365."},{"key":"e_1_3_2_2_12_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy, SP 2018","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz , Jonathan Bootle , Dan Boneh , Andrew Poelstra , Pieter Wuille , and Gregory Maxwell . 2018 . Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy, SP 2018 . IEEE Computer Society, 315--334. https:\/\/doi.org\/10.1109\/SP. 2018.00020 10.1109\/SP.2018.00020 Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Gregory Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy, SP 2018. IEEE Computer Society, 315--334. https:\/\/doi.org\/10.1109\/SP.2018.00020"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_2_14_1","volume-title":"Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. In Advances in Cryptology - ASIACRYPT","author":"Campanelli Matteo","year":"2021","unstructured":"Matteo Campanelli , Antonio Faonio , Dario Fiore , Ana\u00efs Querol , and Hadri\u00e1n Rodr\u00edguez . 2021 . Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. In Advances in Cryptology - ASIACRYPT 2021, Proceedings, Part III (Lecture Notes in Computer Science), Mehdi Tibouchi and Huaxiong Wang (Eds.), Vol. 13092 . Springer , 3--33. https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1 10.1007\/978-3-030-92078-4_1 Matteo Campanelli, Antonio Faonio, Dario Fiore, Ana\u00efs Querol, and Hadri\u00e1n Rodr\u00edguez. 2021. Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove Extensions. In Advances in Cryptology - ASIACRYPT 2021, Proceedings, Part III (Lecture Notes in Computer Science), Mehdi Tibouchi and Huaxiong Wang (Eds.), Vol. 13092. Springer, 3--33. https:\/\/doi.org\/10.1007\/978-3-030-92078-4_1"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_2_16_1","volume-title":"Ward","author":"Chiesa Alessandro","year":"2020","unstructured":"Alessandro Chiesa , Yuncong Hu , Mary Maller , Pratyush Mishra , Noah Vesely , and Nicholas P . Ward . 2020 . Marlin : Preprocessing zkSNARKs with Universal and Updatable SRS. In Advances in Cryptology - EUROCRYPT 2020 (LNCS), Vol. 12105 . Springer , 738--768. https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26 10.1007\/978-3-030-45721-1_26 Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas P.Ward. 2020. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In Advances in Cryptology - EUROCRYPT 2020 (LNCS), Vol. 12105. Springer, 738--768. https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"e_1_3_2_2_19_1","volume-title":"Advances in Cryptology - CRYPTO '86 (LNCS)","volume":"263","author":"Fiat Amos","year":"1986","unstructured":"Amos Fiat and Adi Shamir . 1986 . How to Prove Yourself: Practical Solutions to Identification and Signature Problems . In Advances in Cryptology - CRYPTO '86 (LNCS) , Vol. 263 . Springer, 186--194. https:\/\/doi.org\/10.1007\/3-540-47721-7_12 https:\/\/doi.org\/10.1007\/3-540-47721-7_12. 10.1007\/3-540-47721-7_12 Amos Fiat and Adi Shamir. 1986. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In Advances in Cryptology - CRYPTO '86 (LNCS), Vol. 263. Springer, 186--194. https:\/\/doi.org\/10.1007\/3-540-47721-7_12 https:\/\/doi.org\/10.1007\/3-540-47721-7_12."},{"key":"e_1_3_2_2_20_1","first-page":"315","article-title":"plookup: A simplified polynomial protocol for lookup tables","volume":"2020","author":"Gabizon Ariel","year":"2020","unstructured":"Ariel Gabizon and Zachary J. Williamson . 2020 . plookup: A simplified polynomial protocol for lookup tables . IACR Cryptol. ePrint Arch. 2020 (2020), 315 . https: \/\/eprint.iacr.org\/2020\/315 Ariel Gabizon and Zachary J. Williamson. 2020. plookup: A simplified polynomial protocol for lookup tables. IACR Cryptol. ePrint Arch. 2020 (2020), 315. https: \/\/eprint.iacr.org\/2020\/315","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_21_1","first-page":"953","article-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge","volume":"2019","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon , Zachary J. Williamson , and Oana Ciobotaru . 2019 . PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge . IACR Cryptol. ePrint Arch. 2019 (2019), 953 . https:\/\/eprint.iacr.org\/2019\/953 Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. IACR Cryptol. ePrint Arch. 2019 (2019), 953. https:\/\/eprint.iacr.org\/2019\/953","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_22_1","volume-title":"Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In 30th USENIX Security Symposium, USENIX Security 2021","author":"Grassi Lorenzo","year":"2021","unstructured":"Lorenzo Grassi , Dmitry Khovratovich , Christian Rechberger , Arnab Roy , and Markus Schofnegger . 2021 . Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In 30th USENIX Security Symposium, USENIX Security 2021 , August 11-13, 2021, Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association, 519--535. Lorenzo Grassi, Dmitry Khovratovich, Christian Rechberger, Arnab Roy, and Markus Schofnegger. 2021. Poseidon: A New Hash Function for Zero-Knowledge Proof Systems. In 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, Michael Bailey and Rachel Greenstadt (Eds.). USENIX Association, 519--535."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_2_25_1","first-page":"99","article-title":"Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings","volume":"2019","author":"Maller Mary","year":"2019","unstructured":"Mary Maller , Sean Bowe , Markulf Kohlweiss , and Sarah Meiklejohn . 2019 . Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings . IACR Cryptol. ePrint Arch. 2019 (2019), 99 . https:\/\/eprint.iacr. org\/2019\/099 Mary Maller, Sean Bowe, Markulf Kohlweiss, and Sarah Meiklejohn. 2019. Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings. IACR Cryptol. ePrint Arch. 2019 (2019), 99. https:\/\/eprint.iacr. org\/2019\/099","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_26_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy, SP 2013","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno , Jon Howell , Craig Gentry , and Mariana Raykova . 2013 . Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy, SP 2013 . IEEE Computer Society, 238--252. https:\/\/doi.org\/10.1109\/SP. 2013.47 10.1109\/SP Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy, SP 2013. IEEE Computer Society, 238--252. https:\/\/doi.org\/10.1109\/SP. 2013.47"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_27"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-97121-2_19"},{"key":"e_1_3_2_2_30_1","unstructured":"Justin Thaler. 2020. Proofs arguments and zero-knowledge. (2020).  Justin Thaler. 2020. Proofs arguments and zero-knowledge. (2020)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00013"},{"key":"e_1_3_2_2_33_1","volume-title":"Paper 2021\/710.","author":"Zhang Yuncong","year":"2021","unstructured":"Yuncong Zhang , Alan Szepieniec , Ren Zhang , Shifeng Sun , Geng Wang , and Dawu Gu. 2021. VOProof: Efficient zkSNARKs from Vector Oracle Compilers. Cryptology ePrint Archive , Paper 2021\/710. ( 2021 ). https:\/\/eprint.iacr.org\/2021\/ 710 https:\/\/eprint.iacr.org\/2021\/710. Yuncong Zhang, Alan Szepieniec, Ren Zhang, Shifeng Sun, Geng Wang, and Dawu Gu. 2021. VOProof: Efficient zkSNARKs from Vector Oracle Compilers. Cryptology ePrint Archive, Paper 2021\/710. (2021). https:\/\/eprint.iacr.org\/2021\/ 710 https:\/\/eprint.iacr.org\/2021\/710."}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","location":"Los Angeles CA USA","acronym":"CCS '22","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559387","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3559387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:50:57Z","timestamp":1750182657000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3559387"}},"subtitle":["Efficient zkSNARKs from Vector Oracle Compilers"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":32,"alternative-id":["10.1145\/3548606.3559387","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3559387","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}