{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:11:00Z","timestamp":1767337860129,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3548606.3560657","type":"proceedings-article","created":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T11:41:28Z","timestamp":1667821288000},"page":"1725-1737","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["RedShift"],"prefix":"10.1145","author":[{"given":"Assimakis A.","family":"Kattis","sequence":"first","affiliation":[{"name":"New York University, New York, NY, USA"}]},{"given":"Konstantin","family":"Panarin","sequence":"additional","affiliation":[{"name":"Matter Labs, Berlin, Germany"}]},{"given":"Alexander","family":"Vlasov","sequence":"additional","affiliation":[{"name":"Matter Labs, Berlin, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"[n. d.]. Plonky2: Fast Recursive Arguments with PLONK and FRI. https:\/\/github. com\/mir-protocol\/plonky2\/blob\/main\/plonky2\/plonky2.pdf. Accessed: 2022-08- 09.  [n. d.]. Plonky2: Fast Recursive Arguments with PLONK and FRI. https:\/\/github. com\/mir-protocol\/plonky2\/blob\/main\/plonky2\/plonky2.pdf. Accessed: 2022-08- 09."},{"key":"e_1_3_2_1_2_1","volume-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson , Iddo Bentov , Yinon Horesh , and Michael Riabzev . 2018 . Fast Reed-Solomon interactive oracle proofs of proximity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl- Leibniz-Zentrum fuer Informatik. Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Fast Reed-Solomon interactive oracle proofs of proximity. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Schloss Dagstuhl- Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"e_1_3_2_1_4_1","volume-title":"Proximity Gaps for Reed--Solomon Codes. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 900--909","author":"Ben-Sasson Eli","year":"2020","unstructured":"Eli Ben-Sasson , Dan Carmon , Yuval Ishai , Swastik Kopparty , and Shubhangi Saraf . 2020 . Proximity Gaps for Reed--Solomon Codes. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 900--909 . Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, and Shubhangi Saraf. 2020. Proximity Gaps for Reed--Solomon Codes. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 900--909."},{"key":"e_1_3_2_1_5_1","volume-title":"Ward","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Michael Riabzev , Nicholas Spooner , Madars Virza , and Nicholas P . Ward . 2018 . Aurora : Transparent Succinct Arguments for R1CS. Cryptology ePrint Archive, Report 2018\/828. https:\/\/eprint.iacr.org\/2018\/ 828. Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2018. Aurora: Transparent Succinct Arguments for R1CS. Cryptology ePrint Archive, Report 2018\/828. https:\/\/eprint.iacr.org\/2018\/ 828."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"volume-title":"23rd {USENIX} Security Symposium ({USENIX} Security 14). 781--796.","author":"Ben-Sasson Eli","key":"e_1_3_2_1_7_1","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Eran Tromer , and Madars Virza . 2014. Succinct non-interactive zero knowledge for a von Neumann architecture . In 23rd {USENIX} Security Symposium ({USENIX} Security 14). 781--796. Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. 2014. Succinct non-interactive zero knowledge for a von Neumann architecture. In 23rd {USENIX} Security Symposium ({USENIX} Security 14). 781--796."},{"key":"e_1_3_2_1_8_1","volume-title":"DEEP-FRI: Sampling outside the box improves soundness. arXiv preprint arXiv:1903.12243","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson , Lior Goldberg , Swastik Kopparty , and Shubhangi Saraf . 2019. DEEP-FRI: Sampling outside the box improves soundness. arXiv preprint arXiv:1903.12243 ( 2019 ). Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, and Shubhangi Saraf. 2019. DEEP-FRI: Sampling outside the box improves soundness. arXiv preprint arXiv:1903.12243 (2019)."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3235586.3235610"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"e_1_3_2_1_11_1","volume-title":"Halo infinite: Recursive zk-snarks from any additive polynomial commitment scheme. Cryptology ePrint Archive","author":"Boneh Dan","year":"2020","unstructured":"Dan Boneh , Justin Drake , Ben Fisch , and Ariel Gabizon . 2020. Halo infinite: Recursive zk-snarks from any additive polynomial commitment scheme. Cryptology ePrint Archive ( 2020 ). Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon. 2020. Halo infinite: Recursive zk-snarks from any additive polynomial commitment scheme. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_12_1","first-page":"1050","article-title":"Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model","volume":"2017","author":"Bowe Sean","year":"2017","unstructured":"Sean Bowe , Ariel Gabizon , and Ian Miers . 2017 . Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model . IACR Cryptology ePrint Archive 2017 (2017), 1050 . Sean Bowe, Ariel Gabizon, and Ian Miers. 2017. Scalable Multi-party Computation for zk-SNARK Parameters in the Random Beacon Model. IACR Cryptology ePrint Archive 2017 (2017), 1050.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_15_1","volume-title":"Fiat-Shamir from simpler assumptions. Cryptology ePrint Archive","author":"Canetti Ran","year":"2018","unstructured":"Ran Canetti , Yilei Chen , Justin Holmgren , Alex Lombardi , Guy N Rothblum , and Ron D Rothblum . 2018. Fiat-Shamir from simpler assumptions. Cryptology ePrint Archive ( 2018 ). Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N Rothblum, and Ron D Rothblum. 2018. Fiat-Shamir from simpler assumptions. Cryptology ePrint Archive (2018)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978337"},{"key":"e_1_3_2_1_17_1","volume-title":"Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. Cryptology ePrint Archive, Report 2019\/1047. https:\/\/eprint.iacr. org\/2019\/1047.","author":"Chiesa Alessandro","year":"2019","unstructured":"Alessandro Chiesa , Yuncong Hu , Mary Maller , Pratyush Mishra , Noah Vesely , and Nicholas Ward . 2019 . Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. Cryptology ePrint Archive, Report 2019\/1047. https:\/\/eprint.iacr. org\/2019\/1047. Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas Ward. 2019. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. Cryptology ePrint Archive, Report 2019\/1047. https:\/\/eprint.iacr. org\/2019\/1047."},{"key":"e_1_3_2_1_18_1","volume-title":"Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. Cryptology ePrint Archive, Report 2019\/1047. https:\/\/eprint.iacr. org\/2019\/1047.","author":"Chiesa Alessandro","year":"2019","unstructured":"Alessandro Chiesa , Yuncong Hu , Mary Maller , Pratyush Mishra , Noah Vesely , and Nicholas Ward . 2019 . Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. Cryptology ePrint Archive, Report 2019\/1047. https:\/\/eprint.iacr. org\/2019\/1047. Alessandro Chiesa, Yuncong Hu, Mary Maller, Pratyush Mishra, Noah Vesely, and Nicholas Ward. 2019. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. Cryptology ePrint Archive, Report 2019\/1047. https:\/\/eprint.iacr. org\/2019\/1047."},{"key":"e_1_3_2_1_19_1","volume-title":"Fractal: Post-Quantum and Transparent Recursive Proofs from Holography. Cryptology ePrint Archive, Report 2019\/1076. https:\/\/eprint.iacr.org\/2019\/1076.","author":"Chiesa Alessandro","year":"2019","unstructured":"Alessandro Chiesa , Dev Ojha , and Nicholas Spooner . 2019 . Fractal: Post-Quantum and Transparent Recursive Proofs from Holography. Cryptology ePrint Archive, Report 2019\/1076. https:\/\/eprint.iacr.org\/2019\/1076. Alessandro Chiesa, Dev Ojha, and Nicholas Spooner. 2019. Fractal: Post-Quantum and Transparent Recursive Proofs from Holography. Cryptology ePrint Archive, Report 2019\/1076. https:\/\/eprint.iacr.org\/2019\/1076."},{"key":"e_1_3_2_1_20_1","unstructured":"Pergament Evgenya. 2017. Algebraic RAM. Master's thesis. Technion.  Pergament Evgenya. 2017. Algebraic RAM. Master's thesis. Technion."},{"key":"e_1_3_2_1_21_1","unstructured":"Ariel Gabizon and Zachary J. Williamson. [n. d.]. Proposal: The Turbo-PLONK program syntax for specifying SNARK programs. https:\/\/docs.zkproof.org\/pages\/ standards\/accepted-workshop3\/proposal-turbo_plonk.pdf. Accessed: 2022-08- 09.  Ariel Gabizon and Zachary J. Williamson. [n. d.]. Proposal: The Turbo-PLONK program syntax for specifying SNARK programs. https:\/\/docs.zkproof.org\/pages\/ standards\/accepted-workshop3\/proposal-turbo_plonk.pdf. Accessed: 2022-08- 09."},{"key":"e_1_3_2_1_22_1","volume-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Technical Report. Cryptology ePrint Archive, Report 2019\/953.","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. Technical Report. Cryptology ePrint Archive, Report 2019\/953. Ariel Gabizon, Zachary J Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Technical Report. Cryptology ePrint Archive, Report 2019\/953."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_3_2_1_26_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. 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_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"volume-title":"Fundamentals of error-correcting codes","author":"Cary Huffman W","key":"e_1_3_2_1_29_1","unstructured":"W Cary Huffman and Vera Pless . 2003. Fundamentals of error-correcting codes . Cambridge Univ. Press , Cambridge . https:\/\/cds.cern.ch\/record\/1139892 W Cary Huffman and Vera Pless. 2003. Fundamentals of error-correcting codes. Cambridge Univ. Press, Cambridge. https:\/\/cds.cern.ch\/record\/1139892"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_1_31_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 Cryptology ePrint Archive 2019 (2019), 99 . Mary Maller, Sean Bowe, Markulf Kohlweiss, and Sarah Meiklejohn. 2019. Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings. IACR Cryptology ePrint Archive 2019 (2019), 99.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.34"},{"key":"e_1_3_2_1_34_1","unstructured":"Srinath Setty. [n. d.]. Spartan: Efficient and general-purpose zkSNARKs without trusted setup. ([n. d.]).  Srinath Setty. [n. d.]. Spartan: Efficient and general-purpose zkSNARKs without trusted setup. ([n. d.])."},{"volume-title":"13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 339-- 356.","author":"Setty Srinath","key":"e_1_3_2_1_35_1","unstructured":"Srinath Setty , Sebastian Angel , Trinabh Gupta , and Jonathan Lee . 2018. Proving the correct execution of concurrent services in zero-knowledge . In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 339-- 356. Srinath Setty, Sebastian Angel, Trinabh Gupta, and Jonathan Lee. 2018. Proving the correct execution of concurrent services in zero-knowledge. In 13th {USENIX} Symposium on Operating Systems Design and Implementation ({OSDI} 18). 339-- 356."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_1_39_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151","author":"GavinWood","year":"2014","unstructured":"GavinWood et al. 2014 . Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151 , 2014 (2014), 1--32. GavinWood et al. 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151, 2014 (2014), 1--32."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Los Angeles CA USA","acronym":"CCS '22"},"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.3560657","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3548606.3560657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:59Z","timestamp":1750182539000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3548606.3560657"}},"subtitle":["Transparent SNARKs from List Polynomial Commitments"],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":39,"alternative-id":["10.1145\/3548606.3560657","10.1145\/3548606"],"URL":"https:\/\/doi.org\/10.1145\/3548606.3560657","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"}}]}}