{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T10:14:40Z","timestamp":1772878480007,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519956","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1353-1363","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Proving as fast as computing: succinct arguments with constant prover overhead"],"prefix":"10.1145","author":[{"given":"Noga","family":"Ron-Zewi","sequence":"first","affiliation":[{"name":"University of Haifa, Israel"}]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[{"name":"Technion, Israel"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2017.7"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9232-x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.06.013"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2017.40"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488681"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20120"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646445"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70700-6_12"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"e_1_3_2_1_17_1","unstructured":"Jonathan Bootle Alessandro Chiesa and Siqi Liu. 2020. Zero-Knowledge Succinct Arguments with a Linear-Time Prover. IACR Cryptol. ePrint Arch. 2020 ( 2020 ) 1527. https:\/\/eprint.iacr.org\/ 2020 \/1527   Jonathan Bootle Alessandro Chiesa and Siqi Liu. 2020. Zero-Knowledge Succinct Arguments with a Linear-Time Prover. IACR Cryptol. ePrint Arch. 2020 ( 2020 ) 1527. https:\/\/eprint.iacr.org\/ 2020 \/1527"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316380"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_31"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_29"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITC.2021.5"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554815"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_28_1","volume-title":"Constant-Overhead Zero-Knowledge for RAM Programs. IACR Cryptol. ePrint Arch. ( 2021 ), 979. https:\/\/eprint.iacr.org\/ 2021 \/979 To Appear in CCS","author":"Franzese Nicholas","year":"2021","unstructured":"Nicholas Franzese , Jonathan Katz , Steve Lu , Rafail Ostrovsky , Xiao Wang , and Chenkai Weng . 2021. Constant-Overhead Zero-Knowledge for RAM Programs. IACR Cryptol. ePrint Arch. ( 2021 ), 979. https:\/\/eprint.iacr.org\/ 2021 \/979 To Appear in CCS 2021 . Nicholas Franzese, Jonathan Katz, Steve Lu, Rafail Ostrovsky, Xiao Wang, and Chenkai Weng. 2021. Constant-Overhead Zero-Knowledge for RAM Programs. IACR Cryptol. ePrint Arch. ( 2021 ), 979. https:\/\/eprint.iacr.org\/ 2021 \/979 To Appear in CCS 2021."},{"key":"e_1_3_2_1_29_1","volume-title":"Wahby","author":"Golovnev Alexander","year":"2021","unstructured":"Alexander Golovnev , Jonathan Lee , Srinath Setty , Justin Thaler , and Riad S . Wahby . 2021 . Brakedown : Linear-time and post-quantum SNARKs for R1CS. Cryptology ePrint Archive, Report 2021 \/1043. https:\/\/ia.cr\/ 2021 \/1043. Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, and Riad S. Wahby. 2021. Brakedown: Linear-time and post-quantum SNARKs for R1CS. Cryptology ePrint Archive, Report 2021 \/1043. https:\/\/ia.cr\/ 2021 \/1043."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2018.27"},{"key":"e_1_3_2_1_31_1","unstructured":"Yuval Ishai. 2020. Zero-Knowledge Proofs from Information-Theoretic Proof Systems. https:\/\/zkproof.org\/ 2020 \/08\/12\/information-theoretic-proof-systems.   Yuval Ishai. 2020. Zero-Knowledge Proofs from Information-Theoretic Proof Systems. https:\/\/zkproof.org\/ 2020 \/08\/12\/information-theoretic-proof-systems."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725398"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/110829660"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057584"},{"key":"e_1_3_2_1_40_1","article-title":"Polynomial Codes over Certain Finite Fields","volume":"8","author":"Reed Irving S.","year":"1960","unstructured":"Irving S. Reed and Gustave Solomon . 1960 . Polynomial Codes over Certain Finite Fields . SIAM Journal of the Society for Industrial and Applied Mathematics 8 , 2 ( 1960 ), 300-304. Irving S. Reed and Gustave Solomon. 1960. Polynomial Codes over Certain Finite Fields. SIAM Journal of the Society for Industrial and Applied Mathematics 8, 2 ( 1960 ), 300-304.","journal-title":"SIAM Journal of the Society for Industrial and Applied Mathematics"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897652"},{"key":"e_1_3_2_1_42_1","unstructured":"Noga Ron-Zewi and Ron Rothblum. 2021. Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. Electron. Colloquium Comput. Complex. ( 2021 ) 180. https:\/\/eccc.weizmann. ac.il\/report\/2021\/180   Noga Ron-Zewi and Ron Rothblum. 2021. Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. Electron. Colloquium Comput. Complex. ( 2021 ) 180. https:\/\/eccc.weizmann. ac.il\/report\/2021\/180"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00083"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21944"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"e_1_3_2_1_47_1","unstructured":"Madhu Sudan. 2001. Algorithmic introduction to coding theory (Lecture notes).   Madhu Sudan. 2001. Algorithmic introduction to coding theory (Lecture notes)."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Justin Thaler. 2021. Proofs Arguments and Zero-Knowledge. https:\/\/people.cs. georgetown.edu\/jthaler\/ProofsArgsAndZK.html.   Justin Thaler. 2021. Proofs Arguments and Zero-Knowledge. https:\/\/people.cs. georgetown.edu\/jthaler\/ProofsArgsAndZK.html.","DOI":"10.1561\/9781638281252"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Michael Viderman. 2015. A combination of testability and decodability by tensor products. Random Structures and Algorithms 46 3 ( 2015 ) 572-598.   Michael Viderman. 2015. A combination of testability and decodability by tensor products. Random Structures and Algorithms 46 3 ( 2015 ) 572-598.","DOI":"10.1002\/rsa.20498"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_1_52_1","volume-title":"QuickSilver: Eficient and Afordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. IACR Cryptol. ePrint Arch. ( 2021 ), 76. https:\/\/eprint.iacr.org\/ 2021 \/076 To Appear in CCS","author":"Yang Kang","year":"2021","unstructured":"Kang Yang , Pratik Sarkar , Chenkai Weng , and Xiao Wang . 2021. QuickSilver: Eficient and Afordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. IACR Cryptol. ePrint Arch. ( 2021 ), 76. https:\/\/eprint.iacr.org\/ 2021 \/076 To Appear in CCS 2021 . Kang Yang, Pratik Sarkar, Chenkai Weng, and Xiao Wang. 2021. QuickSilver: Eficient and Afordable Zero-Knowledge Proofs for Circuits and Polynomials over Any Field. IACR Cryptol. ePrint Arch. ( 2021 ), 76. https:\/\/eprint.iacr.org\/ 2021 \/076 To Appear in CCS 2021."},{"key":"e_1_3_2_1_53_1","volume-title":"Doubly Eficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time. IACR Cryptol. ePrint Arch. 2020 ( 2020 ), 1247. https:\/\/eprint.iacr.org\/ 2020 \/ 1247 To Appear in CCS","author":"Zhang Jiaheng","year":"2021","unstructured":"Jiaheng Zhang , Weijie Wang , Yinuo Zhang , and Yupeng Zhang . 2020. Doubly Eficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time. IACR Cryptol. ePrint Arch. 2020 ( 2020 ), 1247. https:\/\/eprint.iacr.org\/ 2020 \/ 1247 To Appear in CCS 2021 . Jiaheng Zhang, Weijie Wang, Yinuo Zhang, and Yupeng Zhang. 2020. Doubly Eficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time. IACR Cryptol. ePrint Arch. 2020 ( 2020 ), 1247. https:\/\/eprint.iacr.org\/ 2020 \/ 1247 To Appear in CCS 2021."}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519956","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":52,"alternative-id":["10.1145\/3519935.3519956","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519956","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}