{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:05:26Z","timestamp":1755907526058,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":86,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"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":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690213","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"869-883","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Dora: A Simple Approach to Zero-Knowledge for RAM Programs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8903-6354","authenticated-orcid":false,"given":"Aarushi","family":"Goel","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0195-6659","authenticated-orcid":false,"given":"Mathias","family":"Hall-Andersen","sequence":"additional","affiliation":[{"name":"Aarhus University & Galois, Aarhus, Denmark"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8886-4748","authenticated-orcid":false,"given":"Gabriel","family":"Kaptchuk","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Sieve intermediate representation. https:\/\/github.com\/sieve-zk\/ir."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Masayuki Abe Miyako Ohkubo and Koutarou Suzuki. 1-out-of-n signatures from a variety of keys. In Yuliang Zheng editor ASIACRYPT 2002 volume 2501 of LNCS pages 415--432. Springer Berlin Heidelberg December 2002.","DOI":"10.1007\/3-540-36178-2_26"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Thomas Attema Ronald Cramer and Serge Fehr. Compressing proofs of k-out-of-n partial knowledge. In Tal Malkin and Chris Peikert editors CRYPTO 2021 Part IV volume 12828 of LNCS pages 65--91 Virtual Event August 2021. Springer Cham.","DOI":"10.1007\/978-3-030-84259-8_3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Thomas Attema Serge Fehr and Michael Kloo\u00df. Fiat-shamir transformation of multi-round interactive proofs. In Eike Kiltz and Vinod Vaikuntanathan editors TCC 2022 Part I volume 13747 of LNCS pages 113--142. Springer Cham November 2022.","DOI":"10.1007\/978-3-031-22318-1_5"},{"issue":"1","key":"e_1_3_2_1_5_1","volume":"37","author":"Bamberger Kenneth A.","year":"2022","unstructured":"Kenneth A. Bamberger, Ran Canetti, Shafi Goldwasser, Rebecca Wexler, and Evan Joseph Zimmerman. Verification dilemmas, law, and the promise of zero-knowledge proofs. Berkeley Technology Law Journal, 37(1), 2022.","journal-title":"Berkeley Technology Law Journal"},{"key":"e_1_3_2_1_6_1","first-page":"192","volume-title":"ACM CCS 2021","author":"Baum Carsten","year":"2021","unstructured":"Carsten Baum, Lennart Braun, Alexander Munch-Hansen, Beno\u00eet Razet, and Peter Scholl. Appenzeller to brie: Efficient zero-knowledge proofs for mixed-mode arithmetic and Z2k. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 192--211. ACM Press, November 2021."},{"key":"e_1_3_2_1_7_1","first-page":"329","volume-title":"Advances in Cryptology -- CRYPTO","author":"Baum Carsten","year":"2022","unstructured":"Carsten Baum, Lennart Braun, Alexander Munch-Hansen, and Peter Scholl. MozZ2k arella: Efficient vector-ole and zero-knowledge proofs over Z2k. In Yevgeniy Dodis and Thomas Shrimpton, editors, Advances in Cryptology -- CRYPTO 2022, pages 329--358, Cham, 2022. Springer Nature Switzerland."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Carsten Baum Alex J. Malozemoff Marc B. Rosen and Peter Scholl. Mac 'n' cheese: Zero-knowledge proofs for boolean and arithmetic circuits with nested disjunctions. In Tal Malkin and Chris Peikert editors CRYPTO 2021 Part IV volume 12828 of LNCS pages 92--122 Virtual Event August 2021. Springer Cham.","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"e_1_3_2_1_9_1","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. Scalable transparent and post-quantum secure computational integrity. Cryptology ePrint Archive Report 2018\/046 2018."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_1_11_1","first-page":"401","volume-title":"ITCS 2013","author":"Ben-Sasson Eli","year":"2013","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, and Eran Tromer. Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. In Robert D. Kleinberg, editor, ITCS 2013, pages 401--414. ACM, January 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Daniel Genkin Eran Tromer and Madars Virza. SNARKs for C: Verifying program executions succinctly and in zero knowledge. In Ran Canetti and Juan A. Garay editors CRYPTO 2013 Part II volume 8043 of LNCS pages 90--108. Springer Berlin Heidelberg August 2013.","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Michael Riabzev Nicholas Spooner Madars Virza and Nicholas P. Ward. Aurora: Transparent succinct arguments for R1CS. In Yuval Ishai and Vincent Rijmen editors EUROCRYPT 2019 Part I volume 11476 of LNCS pages 103--128. Springer Cham May 2019.","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. Scalable zero knowledge via cycles of elliptic curves. In Juan A. Garay and Rosario Gennaro editors CRYPTO 2014 Part II volume 8617 of LNCS pages 276--294. Springer Berlin Heidelberg August 2014.","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"e_1_3_2_1_15_1","first-page":"781","volume-title":"Kevin Fu and Jaeyeon Jung","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 Kevin Fu and Jaeyeon Jung, editors, USENIX Security 2014, pages 781--796. USENIX Association, August 2014."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511265.3550452"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Justin Drake Ben Fisch and Ariel Gabizon. Halo infinite: Proof-carrying data from additive polynomial commitments. In Tal Malkin and Chris Peikert editors CRYPTO 2021 Part I volume 12825 of LNCS pages 649--680 Virtual Event August 2021. Springer Cham.","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle Andrea Cerulli Pyrros Chaidos Jens Groth and Christophe Petit. Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. In Marc Fischlin and Jean-S\u00e9bastien Coron editors EUROCRYPT 2016 Part II volume 9666 of LNCS pages 327--357. Springer Berlin Heidelberg May 2016.","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_1_19_1","unstructured":"Sean Bowe Jack Grigg and Daira Hopwood. Halo: Recursive proof composition without a trusted setup. Cryptology ePrint Archive Report 2019\/1021 2019."},{"key":"e_1_3_2_1_20_1","first-page":"896","volume-title":"ACM CCS 2018","author":"Boyle Elette","year":"2018","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, and Yuval Ishai. Compressing vector OLE. In David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors, ACM CCS 2018, pages 896--912. ACM Press, October 2018."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Benedikt B\u00fcnz Alessandro Chiesa William Lin Pratyush Mishra and Nicholas Spooner. Proof-carrying data without succinct arguments. In Tal Malkin and Chris Peikert editors CRYPTO 2021 Part I volume 12825 of LNCS pages 681--710 Virtual Event August 2021. Springer Cham.","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Benedikt B\u00fcnz Alessandro Chiesa Pratyush Mishra and Nicholas Spooner. Recursive proof composition from accumulation schemes. In Rafael Pass and Krzysztof Pietrzak editors TCC 2020 Part II volume 12551 of LNCS pages 1--18. Springer Cham November 2020.","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"e_1_3_2_1_24_1","first-page":"2075","volume-title":"ACM CCS 2019","author":"Campanelli Matteo","year":"2019","unstructured":"Matteo Campanelli, Dario Fiore, and Ana\u00efs Querol. LegoSNARK: Modular design and composition of succinct zero-knowledge proofs. In Lorenzo Cavallaro, Johannes Kinder, XiaoFeng Wang, and Jonathan Katz, editors, ACM CCS 2019, pages 2075--2092. ACM Press, November 2019."},{"key":"e_1_3_2_1_25_1","first-page":"1687","volume-title":"ACM CCS 2018","author":"Chen Quan","year":"2018","unstructured":"Quan Chen and Alexandros Kapravelos. Mystique: Uncovering information leakage from browser extensions. In David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors, ACM CCS 2018, pages 1687--1700. ACM Press, October 2018."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2024-0080"},{"key":"e_1_3_2_1_27_1","series-title":"LNCS","first-page":"63","volume-title":"Marc Fischlin and Jean-S\u00e9bastien Coron","author":"Ciampi Michele","year":"2016","unstructured":"Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, and Ivan Visconti. Online\/offline OR composition of sigma protocols. In Marc Fischlin and Jean-S\u00e9bastien Coron, editors, EUROCRYPT 2016, Part II, volume 9666 of LNCS, pages 63--92. Springer, Berlin, Heidelberg, May 2016."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Ivan Damg\u00e5rd and Berry Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Yvo Desmedt editor CRYPTO'94 volume 839 of LNCS pages 174--187. Springer Berlin Heidelberg August 1994.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"e_1_3_2_1_30_1","unstructured":"Santiago Cu\u00e9llar Bill Harris James Parker Stuart Pernsteiner and Eran Tromer. Cheesecloth:{Zero-Knowledge} proofs of real world vulnerabilities 2023."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Cyprien Delpech de Saint Guilhem Emmanuela Orsini Titouan Tanguy and Michiel Verbauwhede. Efficient proof of RAM programs from any public-coin zero-knowledge system. In Clemente Galdi and Stanislaw Jarecki editors SCN 22 volume 13409 of LNCS pages 615--638. Springer Cham September 2022.","DOI":"10.1007\/978-3-031-14791-3_27"},{"key":"e_1_3_2_1_32_1","volume-title":"Paper 2023\/974","author":"Di Zijing","year":"2023","unstructured":"Zijing Di, Lucas Xia, Wilson Nguyen, and Nirvan Tyagi. Muxproofs: Succinct arguments for machine computation from tuple lookups. Cryptology ePrint Archive, Paper 2023\/974, 2023. https:\/\/eprint.iacr.org\/2023\/974."},{"key":"e_1_3_2_1_33_1","first-page":"1","volume-title":"2nd Conference on Information-Theoretic Cryptography, ITC 2021, July 23--26, 2021, Virtual Conference","volume":"199","author":"Dittmer Samuel","year":"2021","unstructured":"Samuel Dittmer, Yuval Ishai, and Rafail Ostrovsky. Line-point zero knowledge and its applications. In Stefano Tessaro, editor, 2nd Conference on Information-Theoretic Cryptography, ITC 2021, July 23--26, 2021, Virtual Conference, volume 199 of LIPIcs, pages 5:1--5:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2021."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Andrew M. Odlyzko editor CRYPTO'86 volume 263 of LNCS pages 186--194. Springer Berlin Heidelberg August 1987.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_1_35_1","first-page":"178","volume-title":"ACM CCS 2021","author":"Franzese Nicholas","year":"2021","unstructured":"Nicholas Franzese, Jonathan Katz, Steve Lu, Rafail Ostrovsky, Xiao Wang, and Chenkai Weng. Constant-overhead zero-knowledge for RAM programs. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 178--191. ACM Press, November 2021."},{"key":"e_1_3_2_1_36_1","unstructured":"Ariel Gabizon Zachary J. Williamson and Oana Ciobotaru. PLONK: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive Report 2019\/953 2019."},{"key":"e_1_3_2_1_37_1","unstructured":"Galois Inc. swanky: A suite of rust libraries for secure computation. https:\/\/github.com\/GaloisInc\/swanky 2019."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Juan A. Garay Philip D. MacKenzie and Ke Yang. Strengthening zero-knowledge protocols using signatures. In Eli Biham editor EUROCRYPT 2003 volume 2656 of LNCS pages 177--194. Springer Berlin Heidelberg May 2003.","DOI":"10.1007\/3-540-39200-9_11"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. Quadratic span programs and succinct NIZKs without PCPs. In Thomas Johansson and Phong Q. Nguyen editors EUROCRYPT 2013 volume 7881 of LNCS pages 626--645. Springer Berlin Heidelberg May 2013.","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_1_40_1","volume-title":"https:\/\/github.com\/guildofweavers\/genstark","author":"STARK.","year":"2020","unstructured":"genSTARK. https:\/\/github.com\/guildofweavers\/genstark, 2020."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Aarushi Goel Matthew Green Mathias Hall-Andersen and Gabriel Kaptchuk. Stacking sigmas: A framework to compose \u03a3-protocols for disjunctions. In Orr Dunkelman and Stefan Dziembowski editors EUROCRYPT 2022 Part II volume 13276 of LNCS pages 458--487. Springer Cham May \/ June 2022.","DOI":"10.1007\/978-3-031-07085-3_16"},{"key":"e_1_3_2_1_42_1","unstructured":"Aarushi Goel Mathias Hall-Andersen and Gabriel Kaptchuk. Dora: Processor expressiveness is (nearly) free in zero-knowledge for RAM programs. Cryptology ePrint Archive Report 2023\/1749 2023."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Aarushi Goel Mathias Hall-Andersen Gabriel Kaptchuk and Nicholas Spooner. Speed-stacking: Fast sublinear zero-knowledge proofs for disjunctions. In Carmit Hazay and Martijn Stam editors EUROCRYPT 2023 Part II volume 14005 of LNCS pages 347--378. Springer Cham April 2023.","DOI":"10.1007\/978-3-031-30617-4_12"},{"key":"e_1_3_2_1_44_1","unstructured":"Lior Goldberg Shahar Papini and Michael Riabzev. Cairo -- a Turing-complete STARK-friendly CPU architecture. Cryptology ePrint Archive Report 2021\/1063 2021."},{"key":"e_1_3_2_1_45_1","first-page":"174","volume-title":"27th FOCS","author":"Goldreich Oded","year":"1986","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract). In 27th FOCS, pages 174--187. IEEE Computer Society Press, October 1986."},{"key":"e_1_3_2_1_46_1","first-page":"291","volume-title":"17th ACM STOC","author":"Goldwasser Shafi","year":"1985","unstructured":"Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof-systems (extended abstract). In 17th ACM STOC, pages 291--304. ACM Press, May 1985."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0036"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. On the size of pairing-based non-interactive arguments. In Marc Fischlin and Jean-S\u00e9bastien Coron editors EUROCRYPT 2016 Part II volume 9666 of LNCS pages 305--326. Springer Berlin Heidelberg May 2016.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"crossref","unstructured":"Jens Groth and Markulf Kohlweiss. One-out-of-many proofs: Or how to leak a secret and spend a coin. In Elisabeth Oswald and Marc Fischlin editors EUROCRYPT 2015 Part II volume 9057 of LNCS pages 253--280. Springer Berlin Heidelberg April 2015.","DOI":"10.1007\/978-3-662-46803-6_9"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Jens Groth and Amit Sahai. Efficient non-interactive proof systems for bilinear groups. In Nigel P. Smart editor EUROCRYPT 2008 volume 4965 of LNCS pages 415--432. Springer Berlin Heidelberg April 2008.","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"e_1_3_2_1_51_1","first-page":"2055","volume-title":"ACM CCS 2020","author":"Heath David","year":"2020","unstructured":"David Heath and Vladimir Kolesnikov. A 2.1 KHz zero-knowledge processor with BubbleRAM. In Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna, editors, ACM CCS 2020, pages 2055--2074. ACM Press, November 2020."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"crossref","unstructured":"David Heath and Vladimir Kolesnikov. Stacked garbling for disjunctive zero-knowledge proofs. In Anne Canteaut and Yuval Ishai editors EUROCRYPT 2020 Part III volume 12107 of LNCS pages 569--598. Springer Cham May 2020.","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"David Heath and Vladimir Kolesnikov. PrORAM - fast P (log n) authenticated shares ZK ORAM. In Mehdi Tibouchi and Huaxiong Wang editors ASIACRYPT 2021 Part IV volume 13093 of LNCS pages 495--525. Springer Cham December 2021.","DOI":"10.1007\/978-3-030-92068-5_17"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00089"},{"volume-title":"https:\/\/github.com\/matter-labs\/hodor","year":"2021","key":"e_1_3_2_1_55_1","unstructured":"hodor. https:\/\/github.com\/matter-labs\/hodor, 2021."},{"key":"e_1_3_2_1_56_1","first-page":"955","volume-title":"ACM CCS 2013","author":"Jawurek Marek","year":"2013","unstructured":"Marek Jawurek, Florian Kerschbaum, and Claudio Orlandi. Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 955--966. ACM Press, November 2013."},{"key":"e_1_3_2_1_57_1","first-page":"525","volume-title":"ACM CCS 2018","author":"Katz Jonathan","year":"2018","unstructured":"Jonathan Katz, Vladimir Kolesnikov, and Xiao Wang. Improved non-interactive zero knowledge with applications to post-quantum signatures. In David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors, ACM CCS 2018, pages 525--537. ACM Press, October 2018."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Marcel Keller Emmanuela Orsini and Peter Scholl. Actively secure OT extension with optimal overhead. In Rosario Gennaro and Matthew J. B. Robshaw editors CRYPTO 2015 Part I volume 9215 of LNCS pages 724--741. Springer Berlin Heidelberg August 2015.","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov. Free IF: How to omit inactive branches and implement S-universal garbled circuit (almost) for free. In Thomas Peyrin and Steven Galbraith editors ASIACRYPT 2018 Part III volume 11274 of LNCS pages 34--58. Springer Cham December 2018.","DOI":"10.1007\/978-3-030-03332-3_2"},{"key":"e_1_3_2_1_60_1","first-page":"2129","volume-title":"MIRAGE: Succinct arguments for randomized algorithms with applications to universal zk-SNARKs","author":"Kosba Ahmed E.","year":"2020","unstructured":"Ahmed E. Kosba, Dimitrios Papadopoulos, Charalampos Papamanthou, and Dawn Song. MIRAGE: Succinct arguments for randomized algorithms with applications to universal zk-SNARKs. In Srdjan Capkun and Franziska Roesner, editors, USENIX Security 2020, pages 2129--2146. USENIX Association, August 2020."},{"key":"e_1_3_2_1_61_1","unstructured":"Abhiram Kothapalli and Srinath Setty. SuperNova: Proving universal machine executions without universal circuits. Cryptology ePrint Archive Report 2022\/1758 2022."},{"key":"e_1_3_2_1_62_1","volume-title":"Paper 2023\/573","author":"Kothapalli Abhiram","year":"2023","unstructured":"Abhiram Kothapalli and Srinath Setty. Hypernova: Recursive arguments for customizable constraint systems. Cryptology ePrint Archive, Paper 2023\/573, 2023. https:\/\/eprint.iacr.org\/2023\/573."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"crossref","unstructured":"Abhiram Kothapalli Srinath Setty and Ioanna Tzialla. Nova: Recursive zero-knowledge arguments from folding schemes. In Yevgeniy Dodis and Thomas Shrimpton editors CRYPTO 2022 Part IV volume 13510 of LNCS pages 359--388. Springer Cham August 2022.","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"e_1_3_2_1_64_1","volume-title":"https:\/\/github.com\/elibensasson\/libstark","author":"STARK.","year":"2018","unstructured":"libSTARK. https:\/\/github.com\/elibensasson\/libstark, 2018."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Helger Lipmaa. Prover-efficient commit-and-prove zero-knowledge SNARKs. In David Pointcheval Abderrahmane Nitaj and Tajjeeddine Rachidi editors AFRICACRYPT 16 volume 9646 of LNCS pages 185--206. Springer Cham April 2016.","DOI":"10.1007\/978-3-319-31517-1_10"},{"key":"e_1_3_2_1_66_1","unstructured":"H\u00e9ctor Masip-Ardevol Marc Guzm\u00e1n-Albiol Jordi Baylina-Mel\u00e9 and Jose Luis Munoz-Tapia. eSTARK: Extending STARKs with arguments. Cryptology ePrint Archive Report 2023\/474 2023."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"crossref","unstructured":"Payman Mohassel Mike Rosulek and Alessandra Scafuro. Sublinear zero-knowledge arguments for RAM programs. In Jean-S\u00e9bastien Coron and Jesper Buus Nielsen editors EUROCRYPT 2017 Part I volume 10210 of LNCS pages 501--531. Springer Cham April \/ May 2017.","DOI":"10.1007\/978-3-319-56620-7_18"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.20"},{"key":"e_1_3_2_1_69_1","first-page":"116","volume-title":"ACM CCS 2001","author":"Neff C. Andrew","year":"2001","unstructured":"C. Andrew Neff. A verifiable secret shuffle and its application to e-voting. In Michael K. Reiter and Pierangela Samarati, editors, ACM CCS 2001, pages 116--125. ACM Press, November 2001."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"crossref","unstructured":"Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Joan Feigenbaum editor CRYPTO'91 volume 576 of LNCS pages 129--140. Springer Berlin Heidelberg August 1992.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"crossref","unstructured":"Srinath Setty. Spartan: Efficient and general-purpose zkSNARKs without trusted setup. In Daniele Micciancio and Thomas Ristenpart editors CRYPTO 2020 Part III volume 12172 of LNCS pages 704--737. Springer Cham August 2020.","DOI":"10.1007\/978-3-030-56877-1_25"},{"volume-title":"E-voting system","year":"2019","key":"e_1_3_2_1_72_1","unstructured":"swisspost evoting. E-voting system 2019. https:\/\/gitlab.com\/swisspost-evoting\/e-voting-system-2019, 2019."},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23097"},{"key":"e_1_3_2_1_74_1","unstructured":"Xiao Wang. emp-tool. https:\/\/github.com\/emp-toolkit\/emp-tool."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_1_76_1","first-page":"501","volume-title":"Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning","author":"Weng Chenkai","year":"2021","unstructured":"Chenkai Weng, Kang Yang, Xiang Xie, Jonathan Katz, and Xiao Wang. Mystique: Efficient conversions for zero-knowledge proofs with applications to machine learning. In Michael Bailey and Rachel Greenstadt, editors, USENIX Security 2021, pages 501--518. USENIX Association, August 2021."},{"key":"e_1_3_2_1_77_1","first-page":"2901","volume-title":"ACM CCS 2022","author":"Weng Chenkai","year":"2022","unstructured":"Chenkai Weng, Kang Yang, Zhaomin Yang, Xiang Xie, and Xiao Wang. AntMan: Interactive zero-knowledge proofs with sublinear communication. In Heng Yin, Angelos Stavrou, Cas Cremers, and Elaine Shi, editors, ACM CCS 2022, pages 2901--2914. ACM Press, November 2022."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"crossref","unstructured":"Tiancheng Xie Yupeng Zhang and Dawn Song. Orion: Zero knowledge proof with linear prover time. In Yevgeniy Dodis and Thomas Shrimpton editors CRYPTO 2022 Part IV volume 13510 of LNCS pages 299--328. Springer Cham August 2022.","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"e_1_3_2_1_79_1","first-page":"2986","volume-title":"ACM CCS 2021","author":"Yang Kang","year":"2021","unstructured":"Kang Yang, Pratik Sarkar, Chenkai Weng, and Xiao Wang. QuickSilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 2986--3001. ACM Press, November 2021."},{"key":"e_1_3_2_1_80_1","first-page":"1607","volume-title":"ACM CCS 2020","author":"Yang Kang","year":"2020","unstructured":"Kang Yang, Chenkai Weng, Xiao Lan, Jiang Zhang, and Xiao Wang. Ferret: Fast extension for correlated OT with small communication. In Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna, editors, ACM CCS 2020, pages 1607--1626. ACM Press, November 2020."},{"key":"e_1_3_2_1_81_1","volume-title":"Paper 2023\/1115","author":"Yang Yibin","year":"2023","unstructured":"Yibin Yang and David Heath. Two shuffles make a ram: Improved constant overhead zero knowledge ram. Cryptology ePrint Archive, Paper 2023\/1115, 2023. https:\/\/eprint.iacr.org\/2023\/1115."},{"key":"e_1_3_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623169"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"crossref","unstructured":"Yibin Yang David Heath Carmit Hazay Vladimir Kolesnikov and Muthuramakrishnan Venkitasubramaniam. Tight ZK CPU: Batched ZK branching with cost proportional to evaluated instruction. Cryptology ePrint Archive Report 2024\/456 2024.","DOI":"10.1145\/3658644.3690289"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00015"},{"key":"e_1_3_2_1_85_1","volume-title":"The picnic signature algorithm. Technical report","author":"Zaverucha Greg","year":"2020","unstructured":"Greg Zaverucha. The picnic signature algorithm. Technical report, 2020. https:\/\/github.com\/microsoft\/Picnic\/raw\/master\/spec\/spec-v3.0.pdf."},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00013"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Salt Lake City UT USA","acronym":"CCS '24"},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690213","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:12:32Z","timestamp":1755843152000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":86,"alternative-id":["10.1145\/3658644.3690213","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690213","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}