{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:17Z","timestamp":1781078237895,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T00:00:00Z","timestamp":1509321600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1618884, CNS-1526377, 1413955, 1619348, 1228984, 1136174, 1065276"],"award-info":[{"award-number":["CNS-1618884, CNS-1526377, 1413955, 1619348, 1228984, 1136174, 1065276"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["742754, 615172"],"award-info":[{"award-number":["742754, 615172"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006502","name":"Defense Sciences Office, DARPA","doi-asserted-by":"publisher","award":["N66001-15-C-4065"],"award-info":[{"award-number":["N66001-15-C-4065"]}],"id":[{"id":"10.13039\/100006502","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2015782"],"award-info":[{"award-number":["2015782"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,30]]},"DOI":"10.1145\/3133956.3134104","type":"proceedings-article","created":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T12:48:18Z","timestamp":1509108498000},"page":"2087-2104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":269,"title":["Ligero"],"prefix":"10.1145","author":[{"given":"Scott","family":"Ames","sequence":"first","affiliation":[{"name":"University of Rochester, Rochester, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[{"name":"Bar-Ilan University, Ramat-Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[{"name":"Technion and University of California, Los Angeles, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[{"name":"University of Rochester, Rochester, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,10,30]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","unstructured":"L\u00e1szl\u00f3 Babai Lance Fortnow Leonid A. Levin and Mario Szegedy. 1991. Checking Computations in Polylogarithmic Time. In STOC. 21--31. 10.1145\/103418.103428","DOI":"10.1145\/103418.103428"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","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. 10.1007\/978-3-319-56617-7_19","DOI":"10.1007\/978-3-319-56617-7_19"},{"key":"e_1_3_2_2_5_1","unstructured":"Eli Ben-Sasson Iddo Bentov Ynon Horesh and Michael Riabzev. 2017. Scalable transparent and post-quantum secure computational integrity. Manuscript. (2017). Slides at https:\/\/people.eecs.berkeley.edu\/~alexch\/docs\/pcpip_bensasson. pdf."},{"key":"e_1_3_2_2_6_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. Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptology ePrint Archive 2016 (2016), 324.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488681"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","unstructured":"Eli Ben-Sasson Alessandro Chiesa and Nicholas Spooner. 2016. Interactive Oracle Proofs. In TCC. 31--60. 10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925426.2926259"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","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. 10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Nir Bitansky Alessandro Chiesa Yuval Ishai Rafail Ostrovsky and Omer Paneth. 2013. 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_13_1","first-page":"279","article-title":"PostQuantum Zero-Knowledge and Signatures from Symmetric-Key Primitives","volume":"2017","author":"Chase Melissa","year":"2017","unstructured":"Melissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi, Sebastian Ramacher, Christian Rechberger, Daniel Slamanig, and Greg Zaverucha. 2017. PostQuantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. IACR Cryptology ePrint Archive 2017 (2017), 279.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","unstructured":"Hao Chen and Ronald Cramer. 2006. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. In CRYPTO. 521--536. 10.1007\/11818175_31","DOI":"10.1007\/11818175_31"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","unstructured":"Ivan Damg\u00e5rd Yuval Ishai and Mikkel Kr\u00f8igaard. 2010. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. In EUROCRYPT. 445--465. 10.1007\/978-3-642-13190-5_23","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517872.2517878"},{"key":"e_1_3_2_2_18_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_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2079016"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","unstructured":"Rosario Gennaro Craig Gentry Bryan Parno and Mariana Raykova. 2013. Quadratic Span Programs and Succinct NIZKs without PCPs. In EUROCRYPT. 626--645. 10.1007\/978-3-642-38348-9_37","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_2_21_1","unstructured":"Irene Giacomelli Jesper Madsen and Claudio Orlandi. 2016. ZKBoo: Faster Zero-Knowledge for Boolean Circuits. In USENIX. 1069--1083."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_3_2_2_23_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_24_1","doi-asserted-by":"crossref","unstructured":"Vipul Goyal Yuval Ishai Mohammad Mahmoody and Amit Sahai. 2010. Interactive Locking Zero-Knowledge PCPs and Unconditional Cryptography. In CRYPTO. 173--190.","DOI":"10.1007\/978-3-642-14623-7_10"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","unstructured":"Jens Groth. 2009. Linear Algebra with Sub-linear Zero-Knowledge Arguments. In CRYPTO. 192--208. 10.1007\/978-3-642-03356-8_12","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","unstructured":"Jens Groth. 2010. Short Pairing-Based Non-interactive Zero-Knowledge Arguments. In ASIACRYPT. 321--340. 10.1007\/978-3-642-17373-8_19","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","unstructured":"Yuval Ishai Eyal Kushilevitz and Rafail Ostrovsky. 2007. Efficient Arguments without Short PCPs. In CCC. 278--291. 10.1109\/CCC.2007.10","DOI":"10.1109\/CCC.2007.10"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Eyal Kushilevitz Rafail Ostrovsky and Amit Sahai. 2007. Zeroknowledge from secure multiparty computation. In STOC. 21--30.","DOI":"10.1145\/1250790.1250794"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/080725398"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Mohammad Mahmoody and Amit Sahai. 2012. On Efficient ZeroKnowledge PCPs. In TCC. 151--168.","DOI":"10.1007\/978-3-642-28914-9_9"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Yuval Ishai Manoj Prabhakaran and Amit Sahai. 2008. Founding Cryptography on Oblivious Transfer - Efficiently. In CRYPTO. 572--591.","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","unstructured":"Yuval Ishai and Mor Weiss. 2014. Probabilistically Checkable Proofs of Proximity with Zero-Knowledge. In TCC. 121--145. 10.1007\/978-3-642-54242-8_6","DOI":"10.1007\/978-3-642-54242-8_6"},{"key":"e_1_3_2_2_34_1","unstructured":"Yael Tauman Kalai and Ran Raz. 2008. Interactive PCP. In ICALP. 536--547."},{"key":"e_1_3_2_2_35_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_36_1","doi-asserted-by":"crossref","unstructured":"Carsten Lund Lance Fortnow Howard J. Karloff and Noam Nisan. 1990. Algebraic Methods for Interactive Proof Systems. 2--10.","DOI":"10.1109\/FSCS.1990.89518"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"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_38_1","doi-asserted-by":"crossref","unstructured":"Silvio Micali. 1994. CS Proofs (Extended Abstracts). In FOCS. 436--453.","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195132"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897652"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"e_1_3_2_2_42_1","volume-title":"19th Annual Network and Distributed System Security Symposium, NDSS 2012","author":"Setty Srinath T. V.","year":"2012","unstructured":"Srinath T. V. Setty, Richard McPherson, Andrew J. Blumberg, and Michael Wal-fish. 2012. Making argument systems for outsourced computation practical (sometimes). In 19th Annual Network and Distributed System Security Symposium, NDSS 2012, San Diego, California, USA, February 5--8, 2012."},{"key":"e_1_3_2_2_43_1","unstructured":"Adi Shamir. 1990. IP=PSPACE. 11--15."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","unstructured":"Justin Thaler. 2013. Time-Optimal Interactive Proofs for Circuit Evaluation. In CRYPTO. 71--89. 10.1007\/978-3-642-40084-1_5","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","unstructured":"Victor Vu Srinath T. V. Setty Andrew J. Blumberg and Michael Walfish. 2013. A Hybrid Architecture for Interactive Verifiable Computation. In SP. 223--237. 10.1109\/SP.2013.48","DOI":"10.1109\/SP.2013.48"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2641562"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"}],"event":{"name":"CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security","location":"Dallas Texas USA","acronym":"CCS '17","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134104","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134104","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3133956.3134104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T19:35:03Z","timestamp":1750966503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3133956.3134104"}},"subtitle":["Lightweight Sublinear Arguments Without a Trusted Setup"],"short-title":[],"issued":{"date-parts":[[2017,10,30]]},"references-count":47,"alternative-id":["10.1145\/3133956.3134104","10.1145\/3133956"],"URL":"https:\/\/doi.org\/10.1145\/3133956.3134104","relation":{},"subject":[],"published":{"date-parts":[[2017,10,30]]},"assertion":[{"value":"2017-10-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}