{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:00:32Z","timestamp":1783008032134,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA","award":["N66001-15-C-4066"],"award-info":[{"award-number":["N66001-15-C-4066"]}]},{"name":"DARPA","award":["HR001120C0087"],"award-info":[{"award-number":["HR001120C0087"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417893","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T18:27:04Z","timestamp":1604341624000},"page":"2025-2038","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":68,"title":["Ligero++: A New Optimized Sublinear IOP"],"prefix":"10.1145","author":[{"given":"Rishabh","family":"Bhadauria","sequence":"first","affiliation":[{"name":"Bar-Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiyong","family":"Fang","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[{"name":"Ligero Inc. & Bar-Ilan University, Rochester, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[{"name":"Ligero Inc. & University of Rochester, Rochester, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tiancheng","family":"Xie","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, College Station, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yupeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2014. libsnark. https:\/\/github.com\/scipr-lab\/libsnark. (2014).  2014. libsnark. https:\/\/github.com\/scipr-lab\/libsnark. (2014)."},{"key":"e_1_3_2_2_2_1","unstructured":"2019. libiop. https:\/\/github.com\/scipr-lab\/libiop. (2019).  2019. libiop. https:\/\/github.com\/scipr-lab\/libiop. (2019)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Martin R. Albrecht Lorenzo Grassi Christian Rechberger Arnab Roy and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT. 191--219.  Martin R. Albrecht Lorenzo Grassi Christian Rechberger Arnab Roy and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. In ASIACRYPT. 191--219.","DOI":"10.1007\/978-3-662-53887-6_7"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Martin R. Albrecht Christian Rechberger Thomas Schneider Tyge Tiessen and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT. 430--454.  Martin R. Albrecht Christian Rechberger Thomas Schneider Tyge Tiessen and Michael Zohner. 2015. Ciphers for MPC and FHE. In EUROCRYPT. 430--454.","DOI":"10.1007\/978-3-662-46800-5_17"},{"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":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai. 1985. Trading Group Theory for Randomness. In STOC. 421--429.  L\u00e1szl\u00f3 Babai. 1985. Trading Group Theory for Randomness. In STOC. 421--429.","DOI":"10.1145\/22145.22192"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"L\u00e1szl\u00f3 Babai Lance Fortnow Leonid A. Levin and Mario Szegedy. 1991. Checking Computations in Polylogarithmic Time. In STOC. 21--31.  L\u00e1szl\u00f3 Babai Lance Fortnow Leonid A. Levin and Mario Szegedy. 1991. Checking Computations in Polylogarithmic Time. In STOC. 21--31.","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_2_10_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.  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_11_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. 2017. Computational Integrity with a Public Random String from Quasi-Linear PCPs. In EUROCRYPT. 551--579.  Eli Ben-Sasson Iddo Bentov Alessandro Chiesa Ariel Gabizon Daniel Genkin Matan Hamilis Evgenya Pergament Michael Riabzev Mark Silberstein Eran Tromer and Madars Virza. 2017. 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_12_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 . 2018 a. Fast Reed-Solomon Interactive Oracle Proofs of Proximity . In ICALP. 14 : 1 -- 14 :17. 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_13_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 b. Scalable, transparent, and post-quantum secure computational integrity . IACR Cryptology ePrint Archive , Vol. 2018 (2018), 46 . Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018b. Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptology ePrint Archive, Vol. 2018 (2018), 46.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2019. Scalable Zero Knowledge with No Trusted Setup. In CRYPTO. 701--732.  Eli Ben-Sasson Iddo Bentov Yinon Horesh and Michael Riabzev. 2019. Scalable Zero Knowledge with No Trusted Setup. In CRYPTO. 701--732.","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"e_1_3_2_2_16_1","first-page":"324","article-title":"Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck","volume":"2016","author":"Ben-Sasson Eli","year":"2016","unstructured":"Eli Ben-Sasson , Alessandro Chiesa , Ariel Gabizon , Michael Riabzev , and Nicholas Spooner . 2016 b. Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck . IACR Cryptology ePrint Archive , Vol. 2016 (2016), 324 . Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, and Nicholas Spooner. 2016b. Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptology ePrint Archive, Vol. 2016 (2016), 324.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488681"},{"key":"e_1_3_2_2_19_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.  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_20_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. EUROCRYPT. 103--128. Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent Succinct Arguments for R1CS. EUROCRYPT. 103--128."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa and Nicholas Spooner. 2016a. Interactive Oracle Proofs. In TCC. 31--60.  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_22_1","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014a. Scalable Zero Knowledge via Cycles of Elliptic Curves. In CRYPTO. 276--294.  Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014a. 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_23_1","unstructured":"Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014b. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX. 781--796.  Eli Ben-Sasson Alessandro Chiesa Eran Tromer and Madars Virza. 2014b. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX. 781--796."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Nir Bitansky Ran Canetti Alessandro Chiesa and Eran Tromer. 2013. Recursive composition and bootstrapping for SNARKS and proof-carrying data. In STOC. 111--120.  Nir Bitansky Ran Canetti Alessandro Chiesa and Eran Tromer. 2013. 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_25_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.  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_26_1","volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In S&P. 315--334.","author":"Benedikt B\u00fc","year":"2018","unstructured":"Benedikt B\u00fc nz, Jonathan Bootle , Dan Boneh , Andrew Poelstra , Pieter Wuille , and Gregory Maxwell . 2018 . Bulletproofs: Short Proofs for Confidential Transactions and More. In S&P. 315--334. Benedikt B\u00fc nz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Gregory Maxwell. 2018. Bulletproofs: Short Proofs for Confidential Transactions and More. In S&P. 315--334."},{"key":"e_1_3_2_2_27_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 CCS. 1825--1842.  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 CCS. 1825--1842.","DOI":"10.1145\/3133956.3133997"},{"key":"e_1_3_2_2_28_1","volume-title":"Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy, SP. 253--270","author":"Costello Craig","year":"2015","unstructured":"Craig Costello , C\u00e9 dric Fournet , Jon Howell , Markulf Kohlweiss , Benjamin Kreuter , Michael Naehrig , Bryan Parno , and Samee Zahur . 2015 . Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy, SP. 253--270 . Craig Costello, C\u00e9 dric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, and Samee Zahur. 2015. Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy, SP. 253--270."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Yuval Ishai. 2006. Scalable Secure Multiparty Computation. In CRYPTO. 501--520.  Ivan Damg\u00e5rd and Yuval Ishai. 2006. Scalable Secure Multiparty Computation. In CRYPTO. 501--520.","DOI":"10.1007\/11818175_30"},{"key":"e_1_3_2_2_30_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.  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_31_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.  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_32_1","unstructured":"Irene Giacomelli Jesper Madsen and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. USENIX. 1069--1083.  Irene Giacomelli Jesper Madsen and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. USENIX. 1069--1083."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_3_2_2_35_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.  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_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2009. Linear Algebra with Sub-linear Zero-Knowledge Arguments. In CRYPTO. 192--208.  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_38_1","doi-asserted-by":"crossref","unstructured":"Jens Groth. 2010. Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In ASIACRYPT. 321--340.  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_39_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz and Rafail Ostrovsky. 2007 a. Efficient Arguments without Short PCPs. In CCC. 278--291.  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_40_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky and Amit Sahai. 2007 b. Zero-knowledge from secure multiparty computation. STOC. 21--30.  Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky and Amit Sahai. 2007 b. Zero-knowledge from secure multiparty computation. STOC. 21--30.","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_2_41_1","unstructured":"Yael Tauman Kalai and Ran Raz. 2008. Interactive PCP. In ICALP. 536--547.  Yael Tauman Kalai and Ran Raz. 2008. Interactive PCP. In ICALP. 536--547."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Jonathan Katz Vladimir Kolesnikov and Xiao Wang. 2018. Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures. In CCS. 525--537.  Jonathan Katz Vladimir Kolesnikov and Xiao Wang. 2018. Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures. In CCS. 525--537.","DOI":"10.1145\/3243734.3243805"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Joe Kilian. 1992. A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract). In STOC. 723--732.  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_44_1","doi-asserted-by":"crossref","unstructured":"Helger Lipmaa. 2012. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. In TCC. 169--189.  Helger Lipmaa. 2012. Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments. In TCC. 169--189.","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"e_1_3_2_2_45_1","unstructured":"Carsten Lund Lance Fortnow Howard J. Karloff and Noam Nisan. 1990. Algebraic Methods for Interactive Proof Systems. FOCS. 2--10.  Carsten Lund Lance Fortnow Howard J. Karloff and Noam Nisan. 1990. Algebraic Methods for Interactive Proof Systems. FOCS. 2--10."},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Ralph C. Merkle. 1989. A Certified Digital Signature. In CRYPTO. 218--238.  Ralph C. Merkle. 1989. A Certified Digital Signature. In CRYPTO. 218--238.","DOI":"10.1007\/0-387-34805-0_21"},{"key":"e_1_3_2_2_47_1","unstructured":"Silvio Micali. 1994. CS Proofs (Extended Abstracts). In FOCS. 436--453.  Silvio Micali. 1994. CS Proofs (Extended Abstracts). In FOCS. 436--453."},{"key":"e_1_3_2_2_48_1","volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In S&P. 238--252.","author":"Parno Bryan","year":"2013","unstructured":"Bryan Parno , Jon Howell , Craig Gentry , and Mariana Raykova . 2013 . Pinocchio: Nearly Practical Verifiable Computation. In S&P. 238--252. Bryan Parno, Jon Howell, Craig Gentry, and Mariana Raykova. 2013. Pinocchio: Nearly Practical Verifiable Computation. In S&P. 238--252."},{"key":"e_1_3_2_2_49_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. 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_50_1","unstructured":"Adi Shamir. 1990. IP=PSPACE. In FOCS. 11--15.  Adi Shamir. 1990. IP=PSPACE. In FOCS. 11--15."},{"key":"e_1_3_2_2_51_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 .  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_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_2_53_1","volume-title":"Raluca Ada Popa, and Ion Stoica","author":"Wu Howard","year":"2018","unstructured":"Howard Wu , Wenting Zheng , Alessandro Chiesa , Raluca Ada Popa, and Ion Stoica . 2018 . DIZK : A Distributed Zero Knowledge Proof System. In USENIX. 675--692. Howard Wu, Wenting Zheng, Alessandro Chiesa, Raluca Ada Popa, and Ion Stoica. 2018. DIZK: A Distributed Zero Knowledge Proof System. In USENIX. 675--692."},{"key":"e_1_3_2_2_54_1","volume-title":"Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In Advances in Cryptology (CRYPTO) .","author":"Xie Tiacheng","year":"2019","unstructured":"Tiacheng Xie , Jiaheng Zhang , Yupeng Zhang , Charalampos Papamanthou , and Dawn Song . 2019 . Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In Advances in Cryptology (CRYPTO) . Tiacheng Xie, Jiaheng Zhang, Yupeng Zhang, Charalampos Papamanthou, and Dawn Song. 2019. Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In Advances in Cryptology (CRYPTO) ."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Jiaheng Zhang Tiancheng Xie Yupeng Zhang and Dawn Song. 2020. Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof. In S&P 2020 .  Jiaheng Zhang Tiancheng Xie Yupeng Zhang and Dawn Song. 2020. Transparent Polynomial Delegation and Its Applications to Zero Knowledge Proof. In S&P 2020 .","DOI":"10.1109\/SP40000.2020.00052"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"},{"key":"e_1_3_2_2_57_1","volume-title":"A Zero-Knowledge Version of vSQL. Cryptology ePrint","author":"Zhang Yupeng","year":"2017","unstructured":"Yupeng Zhang , Daniel Genkin , Jonathan Katz , Dimitrios Papadopoulos , and Charalampos Papamanthou . 2017b. A Zero-Knowledge Version of vSQL. Cryptology ePrint , 2017 . (2017). Yupeng Zhang, Daniel Genkin, Jonathan Katz, Dimitrios Papadopoulos, and Charalampos Papamanthou. 2017b. A Zero-Knowledge Version of vSQL. Cryptology ePrint, 2017. (2017)."}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417893","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:32Z","timestamp":1750197692000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":56,"alternative-id":["10.1145\/3372297.3417893","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417893","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}