{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:53:28Z","timestamp":1767848008243,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":112,"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":["CNS-1917414,CNS-2045180"],"award-info":[{"award-number":["CNS-1917414,CNS-2045180"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["NTSC (742754)"],"award-info":[{"award-number":["NTSC (742754)"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2774\/20"],"award-info":[{"award-number":["2774\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S-Israel Binational Science Foundation","award":["2018393"],"award-info":[{"award-number":["2018393"]}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484572","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:27Z","timestamp":1636805127000},"page":"212-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices"],"prefix":"10.1145","author":[{"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Hang","family":"Su","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"David J.","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Jacob Alperin-Sheriff and Chris Peikert. 2013. Practical Bootstrapping in Quasilinear Time. In CRYPTO. 1--20.","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Jacob Alperin-Sheriff and Chris Peikert. 2014. Faster Bootstrapping with Polynomial Error. In CRYPTO. 297--314.","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.46586\/tosc.v2020.i3.1-45"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Benny Applebaum David Cash Chris Peikert and Amit Sahai. 2009. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. In CRYPTO. 595--618.","DOI":"10.1007\/978-3-642-03356-8_35"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Gilad Asharov Abhishek Jain Adriana L\u00f3pez-Alt Eran Tromer Vinod Vaikuntanathan and Daniel Wichs. 2012. Multiparty Computation with Low Communication Computation and Interaction via Threshold FHE. In EUROCRYPT. 483--501.","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Yonatan Aumann and Yehuda Lindell. 2007. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In TCC. 137--156.","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"e_1_3_2_2_9_1","volume-title":"ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. In IEEE Symposium on Security and Privacy. 271--286","author":"Backes Michael","unstructured":"Michael Backes, Manuel Barbosa, Dario Fiore, and Raphael M. Reischuk. 2015. ADSNARK: Nearly Practical and Privacy-Preserving Proofs on Authenticated Data. In IEEE Symposium on Security and Privacy. 271--286."},{"key":"e_1_3_2_2_10_1","volume-title":"Wu","author":"Barta Ohad","year":"2020","unstructured":"Ohad Barta, Yuval Ishai, Rafail Ostrovsky, and David J. Wu. 2020. On Succinct Arguments and Witness Encryption from Groups. In CRYPTO. 776--806."},{"key":"e_1_3_2_2_11_1","volume-title":"Jens Groth, and Vadim Lyubashevsky.","author":"Baum Carsten","year":"2018","unstructured":"Carsten Baum, Jonathan Bootle, Andrea Cerulli, Rafa\u00eb l del Pino, Jens Groth, and Vadim Lyubashevsky. 2018. Sub-linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. In CRYPTO. 669--699."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Stephanie Bayer and Jens Groth. 2012. Efficient Zero-Knowledge Argument for Correctness of a Shuffle. In EUROCRYPT. 263--280.","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Iddo Bentov Alessandro Chiesa Ariel Gabizon Daniel Genkin Matan Hamilis Evgenya Pergament Michael Riabzev Mark Silberstein Eran Tromer and Madars Virza. 2017a. Computational Integrity with a Public Random String from Quasi-Linear PCPs. In EUROCRYPT. 551--579.","DOI":"10.1007\/978-3-319-56617-7_19"},{"key":"e_1_3_2_2_14_1","first-page":"1","article-title":"Fast Reed-Solomon Interactive Oracle Proofs of Proximity","volume":"14","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018a. Fast Reed-Solomon Interactive Oracle Proofs of Proximity. In ICALP. 14:1--14:17.","journal-title":"ICALP."},{"key":"e_1_3_2_2_15_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. 2018b. Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch., Vol. 2018 (2018), 46.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Michael A. Forbes Ariel Gabizon Michael Riabzev and Nicholas Spooner. 2017b. Zero Knowledge Protocols from Succinct Constraint Detection. In TCC. 172--206.","DOI":"10.1007\/978-3-319-70503-3_6"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Ariel Gabizon and Madars Virza. 2016b. Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. In TCC. 33--64.","DOI":"10.1007\/978-3-662-49099-0_2"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Daniel Genkin and Eran Tromer. 2013a. Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. In ITCS. 401--414.","DOI":"10.1145\/2422436.2422481"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Daniel Genkin Eran Tromer and Madars Virza. 2013b. SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. In CRYPTO. 90--108.","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_2_21_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 EUROCRYPT. 103--128."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa and Nicholas Spooner. 2016a. Interactive Oracle Proofs. In TCC. 31--60.","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014b. Scalable Zero Knowledge via Cycles of Elliptic Curves. In CRYPTO. 276--294.","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"e_1_3_2_2_24_1","volume-title":"USENIX Security Symposium. 781--796","author":"Ben-Sasson Eli","year":"2014","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. 2014c. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX Security Symposium. 781--796."},{"key":"e_1_3_2_2_25_1","first-page":"948","article-title":"STARK Friendly Hash - Survey and Recommendation","volume":"2020","author":"Ben-Sasson Eli","year":"2020","unstructured":"Eli Ben-Sasson, Lior Goldberg, and David Levit. 2020. STARK Friendly Hash - Survey and Recommendation. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 948.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/050646445"},{"key":"e_1_3_2_2_27_1","volume-title":"Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider, Peter Schwabe, and Zooko Wilcox-O'Hearn.","author":"Bernstein Daniel J.","year":"2015","unstructured":"Daniel J. Bernstein, Daira Hopwood, Andreas H\u00fc lsing, Tanja Lange, Ruben Niederhagen, Louiza Papachristodoulou, Michael Schneider, Peter Schwabe, and Zooko Wilcox-O'Hearn. 2015. SPHINCS: Practical Stateless Hash-Based Signatures. In EUROCRYPT. 368--397."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Rishabh Bhadauria Zhiyong Fang Carmit Hazay Muthuramakrishnan Venkitasubramaniam Tiancheng Xie and Yupeng Zhang. 2020. Ligero+: A New Optimized Sublinear IOP. In ACM CCS. 2025----2038.","DOI":"10.1145\/3372297.3417893"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Nir Bitansky Ran Canetti Alessandro Chiesa and Eran Tromer. 2013a. Recursive composition and bootstrapping for SNARKS and proof-carrying data. In STOC. 111--120.","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Nir Bitansky Alessandro Chiesa Yuval Ishai Rafail Ostrovsky and Omer Paneth. 2013b. Succinct Non-interactive Arguments via Linear Interactive Proofs. In TCC. 315--333.","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_2_31_1","volume-title":"Wu","author":"Boneh Dan","year":"2017","unstructured":"Dan Boneh, Yuval Ishai, Amit Sahai, and David J. Wu. 2017. Lattice-Based SNARGs and Their Application to More Efficient Obfuscation. In EUROCRYPT. 247--277."},{"key":"e_1_3_2_2_32_1","volume-title":"Wu","author":"Boneh Dan","year":"2018","unstructured":"Dan Boneh, Yuval Ishai, Amit Sahai, and David J. Wu. 2018. Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs. In EUROCRYPT. 222--255."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Ben Lynn and Hovav Shacham. 2001. Short Signatures from the Weil Pairing. In ASIACRYPT. 514--532.","DOI":"10.1007\/3-540-45682-1_30"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle Andrea Cerulli Pyrros Chaidos Jens Groth and Christophe Petit. 2016. Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting. In EUROCRYPT. 327--357.","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle Alessandro Chiesa and Jens Groth. 2020 a. Linear-Time Arguments with Sublinear Verification from Tensor Codes. In TCC. 19--46.","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"e_1_3_2_2_36_1","first-page":"1527","article-title":"b. Zero-Knowledge Succinct Arguments with a Linear-Time Prover","volume":"2020","author":"Bootle Jonathan","year":"2020","unstructured":"Jonathan Bootle, Alessandro Chiesa, and Siqi Liu. 2020 b. Zero-Knowledge Succinct Arguments with a Linear-Time Prover. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 1527.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Jonathan Bootle Vadim Lyubashevsky Ngoc Khanh Nguyen and Gregor Seiler. 2020 c. A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. In CRYPTO. 441--469.","DOI":"10.1007\/978-3-030-56880-1_16"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978425"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1108638.1716344"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski Craig Gentry and Vinod Vaikuntanathan. 2012. (Leveled) fully homomorphic encryption without bootstrapping. In ITCS. 309--325.","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Zvika Brakerski and Vinod Vaikuntanathan. 2011. Efficient Fully Homomorphic Encryption from (Standard) LWE. In FOCS. 97--106.","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Benjamin Braun Ariel J. Feldman Zuocheng Ren Srinath T. V. Setty Andrew J. Blumberg and Michael Walfish. 2013. Verifying computations with state. In SOSP. 341--357.","DOI":"10.1145\/2517349.2522733"},{"key":"e_1_3_2_2_43_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In IEEE Symposium on Security and Privacy. 315--334","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 IEEE Symposium on Security and Privacy. 315--334."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Benedikt B\u00fcnz Ben Fisch and Alan Szepieniec. 2020. Transparent SNARKs from DARK Compilers. In EUROCRYPT. 677--706.","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Melissa Chase David Derler Steven Goldfeder Claudio Orlandi Sebastian Ramacher Christian Rechberger Daniel Slamanig and Greg Zaverucha. 2017. Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. In ACM CCS. 1825--1842.","DOI":"10.1145\/3133956.3133997"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa Yuncong Hu Mary Maller Pratyush Mishra Noah Vesely and Nicholas P. Ward. 2020 a. Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS. In EUROCRYPT. 738--768.","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa Dev Ojha and Nicholas Spooner. 2020 b. Fractal: Post-quantum and Transparent Recursive Proofs from Holography. In EUROCRYPT. 769--793.","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa Eran Tromer and Madars Virza. 2015. Cluster Computing in Zero Knowledge. In EUROCRYPT. 371--403.","DOI":"10.1007\/978-3-662-46803-6_13"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Alessandro Chiesa and Eylon Yogev. 2021. Subquadratic SNARGs in the Random Oracle Model. (2021).","DOI":"10.1007\/978-3-030-84242-0_25"},{"key":"e_1_3_2_2_50_1","volume-title":"An algorithm for the machine calculation of complex Fourier series. Mathematics of computation","author":"Cooley James W","year":"1965","unstructured":"James W Cooley and John W Tukey. 1965. An algorithm for the machine calculation of complex Fourier series. Mathematics of computation, Vol. 19, 90 (1965), 297--301."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Graham Cormode Michael Mitzenmacher and Justin Thaler. 2012. Practical verified computation with streaming interactive proofs. In ITCS. 90--112.","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Jean-S\u00e9bastien Coron David Naccache and Mehdi Tibouchi. 2012. Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers. In EUROCRYPT. 446--464.","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"e_1_3_2_2_53_1","volume-title":"Jens Groth, and Markulf Kohlweiss.","author":"Danezis George","year":"2014","unstructured":"George Danezis, C\u00e9 dric Fournet, Jens Groth, and Markulf Kohlweiss. 2014. Square Span Programs with Applications to Succinct NIZK Arguments. In ASIACRYPT. 532--550."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.22"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2018.i1.238-268"},{"key":"e_1_3_2_2_56_1","volume-title":"FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT. 617--640.","author":"Ducas L\u00e9o","year":"2015","unstructured":"L\u00e9o Ducas and Daniele Micciancio. 2015. FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second. In EUROCRYPT. 617--640."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Amos Fiat and Adi Shamir. 1986. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In CRYPTO. 186--194.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"e_1_3_2_2_58_1","volume-title":"Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, and Bryan Parno.","author":"Fiore Dario","year":"2016","unstructured":"Dario Fiore, C\u00e9 dric Fournet, Esha Ghosh, Markulf Kohlweiss, Olga Ohrimenko, and Bryan Parno. 2016. Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data. In ACM CCS. 1304--1316."},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"crossref","unstructured":"Dario Fiore Rosario Gennaro and Valerio Pastro. 2014. Efficiently Verifiable Computation on Encrypted Data. In ACM CCS. 844--855.","DOI":"10.1145\/2660267.2660366"},{"key":"e_1_3_2_2_60_1","volume-title":"Falcon: Fast-Fourier Lattice-based Compact Signatures over NTRU (Specification v1.2).","author":"Fouque Pierre-Alain","year":"2020","unstructured":"Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Prest, Thomas Ricosset, Gregor Seiler, William Whyte, and Zhenfei Zhang. 2020. Falcon: Fast-Fourier Lattice-based Compact Signatures over NTRU (Specification v1.2). (2020)."},{"key":"e_1_3_2_2_61_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., Vol. 2019 (2019), 953.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_62_1","unstructured":"Steven D Galbraith. 2013. Space-efficient variants of cryptosystems based on learning with errors. (2013)."},{"key":"e_1_3_2_2_63_1","first-page":"322","article-title":"Rinocchio: SNARKs for Ring Arithmetic","volume":"2021","author":"Ganesh Chaya","year":"2021","unstructured":"Chaya Ganesh, Anca Nitulescu, and Eduardo Soria-Vazquez. 2021. Rinocchio: SNARKs for Ring Arithmetic. IACR Cryptol. ePrint Arch., Vol. 2021 (2021), 322.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT. 626--645.","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"crossref","unstructured":"Rosario Gennaro Michele Minelli Anca Nitulescu and Michele Orr\u00f9. 2018. Lattice-Based zk-SNARKs from Square Span Programs. In ACM CCS. 556--573.","DOI":"10.1145\/3243734.3243845"},{"key":"e_1_3_2_2_66_1","unstructured":"Craig Gentry. 2009. A fully homomorphic encryption scheme. Ph.D. Dissertation. Stanford University. crypto.stanford.edu\/craig."},{"key":"e_1_3_2_2_67_1","volume-title":"Smart","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012a. Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT. 465--482."},{"key":"e_1_3_2_2_68_1","volume-title":"Smart","author":"Gentry Craig","year":"2012","unstructured":"Craig Gentry, Shai Halevi, and Nigel P. Smart. 2012b. Homomorphic Evaluation of the AES Circuit. In CRYPTO. 850--867."},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Craig Gentry and Daniel Wichs. 2011. Separating succinct non-interactive arguments from all falsifiable assumptions. In STOC. 99--108.","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_2_70_1","volume-title":"Yael Tauman Kalai, and Guy N. Rothblum","author":"Goldwasser Shafi","year":"2008","unstructured":"Shafi Goldwasser, Yael Tauman Kalai, and Guy N. Rothblum. 2008. Delegating computation: interactive proofs for muggles.. In STOC. 113--122."},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"crossref","unstructured":"Shafi Goldwasser Silvio Micali and Charles Rackoff. 1985. The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract). In STOC. 291--304.","DOI":"10.1145\/22145.22178"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1958.tb00300.x"},{"key":"e_1_3_2_2_73_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2009. Linear Algebra with Sub-linear Zero-Knowledge Arguments. In CRYPTO. 192--208.","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2010. Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In ASIACRYPT. 321--340.","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_2_75_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. In EUROCRYPT. 305--326.","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz and Rafail Ostrovsky. 2007 a. Efficient Arguments without Short PCPs. In CCC. 278--291.","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_3_2_2_77_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky and Amit Sahai. 2007 b. Zero-knowledge from secure multiparty computation. In STOC. 21--30.","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_2_78_1","volume-title":"Wu","author":"Ishai Yuval","year":"2021","unstructured":"Yuval Ishai, Hang Su, and David J. Wu. 2021. Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices. IACR Cryptol. ePrint Arch., Vol. 2021 (2021)."},{"key":"e_1_3_2_2_79_1","doi-asserted-by":"crossref","unstructured":"Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In STOC. 723--732.","DOI":"10.1145\/129712.129782"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-014-9938-4"},{"key":"e_1_3_2_2_81_1","first-page":"30","article-title":"Linear-time zero-knowledge SNARKs for R1CS","volume":"2021","author":"Lee Jonathan","year":"2021","unstructured":"Jonathan Lee, Srinath Setty, Justin Thaler, and Riad Wahby. 2021. Linear-time zero-knowledge SNARKs for R1CS. IACR Cryptol. ePrint Arch., Vol. 2021 (2021), 30.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_82_1","doi-asserted-by":"crossref","unstructured":"Vadim Lyubashevsky Chris Peikert and Oded Regev. 2010. On Ideal Lattices and Learning with Errors over Rings. In EUROCRYPT. 1--23.","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_2_83_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., Vol. 2019 (2019), 99.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"e_1_3_2_2_85_1","doi-asserted-by":"crossref","unstructured":"Pratyay Mukherjee and Daniel Wichs. 2016. Two Round Multiparty Computation via Multi-key FHE. In EUROCRYPT. 735--763.","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"e_1_3_2_2_86_1","doi-asserted-by":"crossref","unstructured":"Anca Nitulescu. 2019. Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits. In LATINCRYPT. 217--236.","DOI":"10.1007\/978-3-030-30530-7_11"},{"key":"e_1_3_2_2_87_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In IEEE Symposium on Security and Privacy. 238--252","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In IEEE Symposium on Security and Privacy. 238--252."},{"key":"e_1_3_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000074"},{"key":"e_1_3_2_2_89_1","doi-asserted-by":"crossref","unstructured":"Chris Peikert Vinod Vaikuntanathan and Brent Waters. 2008. A Framework for Efficient and Composable Oblivious Transfer. In CRYPTO. 554--571.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"e_1_3_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1968.6477"},{"key":"e_1_3_2_2_91_1","doi-asserted-by":"crossref","unstructured":"Oded Regev. 2005. On lattices learning with errors random linear codes and cryptography. In STOC. 84--93.","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_2_92_1","volume-title":"Rothblum","author":"Reingold Omer","year":"2016","unstructured":"Omer Reingold, Guy N. Rothblum, and Ron D. Rothblum. 2016. Constant-round interactive proofs for delegating computation. In STOC. 49--62."},{"key":"e_1_3_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_2_94_1","unstructured":"SCIPR Lab. 2021 a. textttlibfqfft: C+ library for FFTs in finite fields. https:\/\/github.com\/scipr-lab\/libfqfft\/."},{"key":"e_1_3_2_2_95_1","unstructured":"SCIPR Lab. 2021 b. textttlibiop: a C+ library for IOP-based zkSNARKs. https:\/\/github.com\/scipr-lab\/libiop ."},{"key":"e_1_3_2_2_96_1","unstructured":"SCIPR Lab. 2021 c. textttlibsnark: a C+ library for zkSNARK proofs. https:\/\/github.com\/scipr-lab\/libsnark\/."},{"key":"e_1_3_2_2_97_1","volume-title":"Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO. 704--737.","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty. 2020. Spartan: Efficient and General-Purpose zkSNARKs Without Trusted Setup. In CRYPTO. 704--737."},{"key":"e_1_3_2_2_98_1","doi-asserted-by":"crossref","unstructured":"Srinath T. V. Setty Benjamin Braun Victor Vu Andrew J. Blumberg Bryan Parno and Michael Walfish. 2013. Resolving the conflict between generality and plausibility in verified computation. In EuroSys. 71--84.","DOI":"10.1145\/2465351.2465359"},{"key":"e_1_3_2_2_99_1","volume-title":"Setty and Jonathan Lee","author":"Srinath T.","year":"2020","unstructured":"Srinath T. V. Setty and Jonathan Lee. 2020. Quarks: Quadruple-efficient transparent zkSNARKs. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 1275."},{"key":"e_1_3_2_2_100_1","unstructured":"Srinath T. V. Setty Victor Vu Nikhil Panpalia Benjamin Braun Andrew J. Blumberg and Michael Walfish. 2012. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality. In USENIX. 253--268."},{"key":"e_1_3_2_2_101_1","first-page":"582","article-title":"a. ethSTARK Documentation","volume":"2021","author":"Team StarkWare","year":"2021","unstructured":"StarkWare Team. 2021 a. ethSTARK Documentation. IACR Cryptol. ePrint Arch., Vol. 2021 (2021), 582.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_102_1","unstructured":"StarkWare Team. 2021 b. textttethSTARK. https:\/\/github.com\/starkware-libs\/ethSTARK ."},{"key":"e_1_3_2_2_103_1","doi-asserted-by":"crossref","unstructured":"Justin Thaler. 2013. Time-Optimal Interactive Proofs for Circuit Evaluation. In CRYPTO. 71--89.","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_2_104_1","volume-title":"Using a computer to solve problems in physics. Applications of digital computers","author":"Thomas Llewellyn H","year":"1963","unstructured":"Llewellyn H Thomas. 1963. Using a computer to solve problems in physics. Applications of digital computers (1963), 44--45."},{"key":"e_1_3_2_2_105_1","doi-asserted-by":"crossref","unstructured":"Riad S. Wahby Srinath T. V. Setty Zuocheng Ren Andrew J. Blumberg and Michael Walfish. 2015. Efficient RAM and control flow in verifiable outsourced computation. In NDSS.","DOI":"10.14722\/ndss.2015.23097"},{"key":"e_1_3_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/2641562"},{"key":"e_1_3_2_2_108_1","volume-title":"Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO. 733--764.","author":"Xie Tiancheng","year":"2019","unstructured":"Tiancheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO. 733--764."},{"key":"e_1_3_2_2_109_1","first-page":"1247","article-title":"a. Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time","volume":"2020","author":"Zhang Jiaheng","year":"2020","unstructured":"Jiaheng Zhang, Weijie Wang, Yinuo Zhang, and Yupeng Zhang. 2020 a. Doubly Efficient Interactive Proofs for General Arithmetic Circuits with Linear Prover Time. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 1247.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_110_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"},{"key":"e_1_3_2_2_111_1","first-page":"1146","article-title":"A Zero-Knowledge Version of vSQL","volume":"2017","author":"Zhang Yupeng","year":"2017","unstructured":"Yupeng Zhang, Daniel Genkin, Jonathan Katz, Dimitrios Papadopoulos, and Charalampos Papamanthou. 2017. A Zero-Knowledge Version of vSQL. IACR Cryptol. ePrint Arch., Vol. 2017 (2017), 1146.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_112_1","doi-asserted-by":"crossref","unstructured":"Richard Zippel. 1979. Probabilistic algorithms for sparse polynomials. In EUROSAM.","DOI":"10.1007\/3-540-09519-5_73"}],"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.3484572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484572","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:43:57Z","timestamp":1763498637000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":112,"alternative-id":["10.1145\/3460120.3484572","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484572","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"}}]}}