{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:05:27Z","timestamp":1790499927267,"version":"4.1.0"},"reference-count":96,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T00:00:00Z","timestamp":1689206400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1526377"],"award-info":[{"award-number":["1526377"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1618884"],"award-info":[{"award-number":["1618884"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019180","name":"HORIZON EUROPE European Research Council","doi-asserted-by":"publisher","award":["615172"],"award-info":[{"award-number":["615172"]}],"id":[{"id":"10.13039\/100019180","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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1413955"],"award-info":[{"award-number":["1413955"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10623-023-01222-8","type":"journal-article","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T13:01:51Z","timestamp":1689253311000},"page":"3379-3424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Ligero: lightweight sublinear arguments without a trusted setup"],"prefix":"10.1007","volume":"91","author":[{"given":"Scott","family":"Ames","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9765-7911","authenticated-orcid":false,"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,13]]},"reference":[{"key":"1222_CR1","unstructured":"Applebaum B., Haramaty-Krasne N., Ishai Y., Kushilevitz E., Vaikuntananthan V.: Low-complexity cryptographic hash functions. In: ITCS, pp. 7:1\u20137:31. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)."},{"key":"1222_CR2","doi-asserted-by":"crossref","unstructured":"Ames S., Hazay C., Ishai Y., Venkitasubramaniam M.: Ligero: Lightweight sublinear arguments without a trusted setup. In: CCS, pp. 2087\u20132104 (2017).","DOI":"10.1145\/3133956.3134104"},{"issue":"3","key":"1222_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S., Lund C., Motwani R., Sudan M., Szegedy M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501\u2013555 (1998).","journal-title":"J. ACM"},{"issue":"3","key":"1222_CR4","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/s00145-016-9232-x","volume":"30","author":"B Applebaum","year":"2017","unstructured":"Applebaum B., Moses Y.: Locally computable UOWHF with linear shrinkage. J. Cryptol. 30(3), 672\u2013698 (2017).","journal-title":"J. Cryptol."},{"issue":"1","key":"1222_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S., Safra S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70\u2013122 (1998).","journal-title":"J. ACM"},{"key":"1222_CR6","doi-asserted-by":"crossref","unstructured":"Babai L.: Trading group theory for randomness. In: STOC, pp. 421\u2013429 (1985).","DOI":"10.1145\/22145.22192"},{"key":"1222_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcnz B., Bootle J., Boneh D., Poelstra A., Wuille P., Maxwell G.: Bulletproofs: Short proofs for confidential transactions and more. In: S &P, pp. 315\u2013334. IEEE Computer Society (2018).","DOI":"10.1109\/SP.2018.00020"},{"key":"1222_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Bentov I., Chiesa A., Gabizon A., Genkin D., Hamilis M., Pergament E., Riabzev M., Silberstein M., Tromer E., Virza M.: Computational integrity with a public random string from quasi-linear pcps. In: EUROCRYPT, pp. 551\u2013579 (2017).","DOI":"10.1007\/978-3-319-56617-7_19"},{"key":"1222_CR9","unstructured":"Ben-Sasson E., Bentov I., Horesh Y., Riabzev M.: Fast reed-solomon interactive oracle proofs of proximity. In: ICALP, pp. 14:1\u201314:17 (2018)."},{"key":"1222_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Bentov I., Horesh Y., Riabzev M.: Scalable zero knowledge with no trusted setup. In: Boldyreva A., Micciancio D. (eds.) CRYPTO, pp. 701\u2013732 (2019).","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"1222_CR11","doi-asserted-by":"crossref","unstructured":"Bhadauria R., Bangalore L., Hazay C., Venkitasubramaniam M.: On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives. In: TCC (2022).","DOI":"10.1007\/978-3-031-22318-1_15"},{"key":"1222_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky N., Chiesa A.: Succinct arguments from multi-prover interactive proofs and their efficiency benefits. In: CRYPTO, pp. 255\u2013272 (2012).","DOI":"10.1007\/978-3-642-32009-5_16"},{"key":"1222_CR13","doi-asserted-by":"crossref","unstructured":"Bitansky N., Canetti R., Chiesa A., Tromer E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: STOC, pp. 111\u2013120 (2013).","DOI":"10.1145\/2488608.2488623"},{"key":"1222_CR14","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Chiesa A., Garman C., Green M., Miers I., Tromer E., Virza M.: Zerocash: decentralized anonymous payments from bitcoin. In: IEEE Symposium on Security and Privacy, pp. 459\u2013474 (2014).","DOI":"10.1109\/SP.2014.36"},{"key":"1222_CR15","first-page":"324","volume":"2016","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson E., Chiesa A., Gabizon A., Riabzev M., Spooner N.: Short interactive oracle proofs with constant query complexity, via composition and sumcheck. IACR Cryptology ePrint Archive 2016, 324 (2016).","journal-title":"IACR Cryptology ePrint Archive"},{"key":"1222_CR16","doi-asserted-by":"crossref","unstructured":"Bootle J., Cerulli A., Ghadafi E., Groth J., Hajiabadi M., Jakobsen S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: ASIACRYPT, pp. 336\u2013365 (2017).","DOI":"10.1007\/978-3-319-70700-6_12"},{"key":"1222_CR17","doi-asserted-by":"crossref","unstructured":"Bootle J., Chiesa A., Groth J.: Linear-time arguments with sublinear verification from tensor codes. In: Pass R., Pietrzak K. (eds.) TCC, pp. 19\u201346. Springer (2020).","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"1222_CR18","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Chiesa A., Genkin D., Tromer E., Virza M.: On the concrete efficiency of probabilistically-checkable proofs. In: Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1\u20134, 2013, pp. 585\u2013594 (2013).","DOI":"10.1145\/2488608.2488681"},{"key":"1222_CR19","doi-asserted-by":"crossref","unstructured":"Bitansky N., Chiesa A., Ishai Y., Ostrovsky R., Paneth O.: Succinct non-interactive arguments via linear interactive proofs. In: TCC, pp. 315\u2013333 (2013).","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"1222_CR20","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Carmon D., Ishai Y., Kopparty S., Saraf S.: Proximity gaps for reed-solomon codes. In: FOCS (2020).","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"1222_CR21","doi-asserted-by":"crossref","unstructured":"Bootle J., Chiesa A., Liu S.: Zero-knowledge iops with linear-time prover and polylogarithmic-time verifier. In: EUROCRYPT, pp. 275\u2013304. Springer (2022).","DOI":"10.1007\/978-3-031-07085-3_10"},{"key":"1222_CR22","doi-asserted-by":"crossref","unstructured":"B\u00fcnz B., Chiesa A., Mishra P., Spooner N.: Recursive proof composition from accumulation schemes. In: TCC, pp. 1\u201318 (2020).","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"1222_CR23","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Chiesa A., Riabzev M., Spooner N., Virza M., Ward N.P.: Aurora: transparent succinct arguments for R1CS. In: EUROCRYPT, pp. 103\u2013128 (2019).","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"1222_CR24","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Chiesa A., Spooner N.: Interactive oracle proofs. In: TCC, pp. 31\u201360 (2016).","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"1222_CR25","doi-asserted-by":"crossref","unstructured":"Bhadauria R., Fang Z., Hazay C., Venkitasubramaniam M., Xie T., Zhang Y.: Ligero++: a new optimized sublinear IOP. In: CCS, pp. 2025\u20132038 (2020).","DOI":"10.1145\/3372297.3417893"},{"key":"1222_CR26","doi-asserted-by":"crossref","unstructured":"Babai L., Fortnow L., Levin L.A., Szegedy M.: Checking computations in polylogarithmic time. In: STOC, pp. 21\u201331 (1991).","DOI":"10.1145\/103418.103428"},{"key":"1222_CR27","unstructured":"Bowe S., Grigg J., Hopwood D.: Halo: recursive proof composition without a trusted setup. IACR Cryptol. ePrint Arch., p. 1021 (2019)."},{"key":"1222_CR28","unstructured":"Ben-Sasson E., Goldberg L., Kopparty S., Saraf S.: DEEP-FRI: sampling outside the box improves soundness. In: ITCS, pp. 5:1\u20135:32 (2020)."},{"key":"1222_CR29","doi-asserted-by":"crossref","unstructured":"Block A.R., Holmgren J., Rosen A., Rothblum R.D., Soni P.: Public-coin zero-knowledge arguments with (almost) minimal time and space overheads. In: TCC, pp. 168\u2013197 (2020).","DOI":"10.1007\/978-3-030-64378-2_7"},{"key":"1222_CR30","doi-asserted-by":"crossref","unstructured":"Block A.R., Holmgren J., Rosen A., Rothblum R.D., Soni P.: Time- and space-efficient arguments from groups of unknown order. In: CRYPTO, pp. 123\u2013152 (2021).","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"1222_CR31","doi-asserted-by":"crossref","unstructured":"Ben-Sasson E., Hamilis M., Silberstein M., Tromer E.: Fast multiplication in binary fields on gpus via register cache. In: International Conference on Supercomputing, pp. 35:1\u201335:12 (2016).","DOI":"10.1145\/2925426.2926259"},{"key":"1222_CR32","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2014.06.013","volume":"554","author":"J Baron","year":"2014","unstructured":"Baron J., Ishai Y., Ostrovsky R.: On linear-size pseudorandom generators and hardcore functions. Theor. Comput. Sci. 554, 50\u201363 (2014).","journal-title":"Theor. Comput. Sci."},{"key":"1222_CR33","doi-asserted-by":"crossref","unstructured":"Boneh D., Ishai Y., Passel\u00e8gue A., Sahai A., Wu D.J.: Exploring crypto dark matter:\u2014new simple PRF candidates and their applications. In: TCC, pp. 699\u2013729 (2018).","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"1222_CR34","doi-asserted-by":"crossref","unstructured":"Baum C., Nof A.: Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography. In: PLC, pp. 495\u2013526 (2020).","DOI":"10.1007\/978-3-030-45374-9_17"},{"key":"1222_CR35","doi-asserted-by":"crossref","unstructured":"Chen H., Cramer R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: CRYPTO, pp. 521\u2013536 (2006).","DOI":"10.1007\/11818175_31"},{"key":"1222_CR36","doi-asserted-by":"crossref","unstructured":"Canetti R., Chen Y., Holmgren J., Lombardi A., Rothblum G.N., Rothblum R.D., Wichs D.: Fiat-shamir: from practice to theory. In: STOC, pp. 1082\u20131090 (2019).","DOI":"10.1145\/3313276.3316380"},{"key":"1222_CR37","doi-asserted-by":"crossref","unstructured":"Chase M., Derler D., Goldfeder S., Orlandi C., Ramacher S., Rechberger C., Slamanig D., Zaverucha G.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: CCS, pp. 1825\u20131842 (2017).","DOI":"10.1145\/3133956.3133997"},{"key":"1222_CR38","doi-asserted-by":"crossref","unstructured":"Cormode G., Mitzenmacher M., Thaler J.: Practical verified computation with streaming interactive proofs. In: ITCS, pp. 90\u2013112 (2012).","DOI":"10.1145\/2090236.2090245"},{"key":"1222_CR39","doi-asserted-by":"crossref","unstructured":"Chiesa A., Ojha D., Spooner N.: Fractal: post-quantum and transparent recursive proofs from holography. In: EUROCRYPT, pp. 769\u2013793 (2020).","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"1222_CR40","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Ishai Y.: Scalable secure multiparty computation. In: CRYPTO, pp. 501\u2013520 (2006).","DOI":"10.1007\/11818175_30"},{"key":"1222_CR41","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I., Ishai Y., Kr\u00f8igaard M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: EUROCRYPT, pp. 445\u2013465 (2010).","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"1222_CR42","doi-asserted-by":"crossref","unstructured":"de Saint Guilhem C.D., De Meyer L., Orsini E., Smart N.P.: Smart. BBQ: using AES in picnic signatures. In: SAC, pp. 669\u2013692 (2019).","DOI":"10.1007\/978-3-030-38471-5_27"},{"key":"1222_CR43","unstructured":"de Saint Guilhem C.D., Orsini E., Tanguy T.: Efficient zero-knowledge mpcith-based arguments. In: CCS, Limbo (2021)."},{"key":"1222_CR44","doi-asserted-by":"crossref","unstructured":"Ephraim N., Freitag C., Komargodski I., Pass R.: Sparks: succinct parallelizable arguments of knowledge. In: EUROCRYPT, pp. 707\u2013737 (2020).","DOI":"10.1007\/978-3-030-45721-1_25"},{"key":"1222_CR45","doi-asserted-by":"crossref","unstructured":"Fiat A., Shamir A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO, pp. 186\u2013194 (1986).","DOI":"10.1007\/3-540-47721-7_12"},{"key":"1222_CR46","doi-asserted-by":"crossref","unstructured":"Gennaro R., Gentry C., Parno B., Raykova M.: Quadratic span programs and succinct nizks without pcps. In: EUROCRYPT, pp. 626\u2013645 (2013).","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"1222_CR47","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Kalai Y.T., Rothblum G.N.: Delegating computation: interactive proofs for muggles. In: STOC, pp. 113\u2013122 (2008).","DOI":"10.1145\/1374376.1374396"},{"key":"1222_CR48","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Kalai Y.T., Rothblum G.N.: Delegating computation: Interactive proofs for muggles. J. ACM, 62(4):27:1\u201327:64 (2015).","DOI":"10.1145\/2699436"},{"key":"1222_CR49","unstructured":"Golovnev A., Lee J., Setty S., Thaler J., Wahby R.S.: Brakedown: Linear-time and post-quantum snarks for R1CS. IACR Cryptol. ePrint Arch., p. 1043 (2021)."},{"issue":"12","key":"1222_CR50","doi-asserted-by":"publisher","first-page":"6265","DOI":"10.1109\/TIT.2010.2079016","volume":"56","author":"S Gao","year":"2010","unstructured":"Gao S., Mateer T.D.: Additive fast fourier transforms over finite fields. IEEE Trans. Inf. Theory 56(12), 6265\u20136272 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1222_CR51","unstructured":"Giacomelli I., Madsen J., Orlandi C.: Zkboo: faster zero-knowledge for boolean circuits. In: USENIX, pp. 1069\u20131083 (2016)."},{"key":"1222_CR52","doi-asserted-by":"crossref","unstructured":"Goldwasser S., Micali S., Rackoff C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC, pp. 291\u2013304 (1985).","DOI":"10.1145\/22145.22178"},{"key":"1222_CR53","doi-asserted-by":"crossref","unstructured":"Groth J.: Linear algebra with sub-linear zero-knowledge arguments. In: CRYPTO, pp. 192\u2013208 (2009).","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"1222_CR54","doi-asserted-by":"crossref","unstructured":"Groth J.: Short pairing-based non-interactive zero-knowledge arguments. In: ASIACRYPT, pp. 321\u2013340 (2010).","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"1222_CR55","doi-asserted-by":"crossref","unstructured":"Gvili Y., Scheffler S., Varia M.: Booligero: Improved sublinear zero knowledge proofs for Boolean circuits. In: FC, pp. 476\u2013496 (2021).","DOI":"10.1007\/978-3-662-64322-8_23"},{"key":"1222_CR56","doi-asserted-by":"crossref","unstructured":"Heath D., Kolesnikov V., Lu J.: Efficient generic arithmetic for KKW practical linear: Mpc-in-the-head NIZK on commodity hardware without trusted setup. IACR Cryptol. ePrint Arch., p. 795 (2022).","DOI":"10.1007\/978-3-030-78086-9_31"},{"key":"1222_CR57","doi-asserted-by":"crossref","unstructured":"Holmgren J., Rothblum R.: Delegating computations with (almost) minimal time and space overhead. In: Thorup M. (ed.) FOCS, pp. 124\u2013135 (2018).","DOI":"10.1109\/FOCS.2018.00021"},{"key":"1222_CR58","doi-asserted-by":"crossref","unstructured":"Holmgren J., Rothblum R.: Faster sounder succinct arguments and iops. IACR Cryptol. ePrint Arch., p. 994 (2022).","DOI":"10.1007\/978-3-031-15802-5_17"},{"key":"1222_CR59","doi-asserted-by":"crossref","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R.: Efficient arguments without short pcps. In: CCC, pp. 278\u2013291 (2007).","DOI":"10.1109\/CCC.2007.10"},{"key":"1222_CR60","doi-asserted-by":"crossref","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21\u201330 (2007).","DOI":"10.1145\/1250790.1250794"},{"key":"1222_CR61","doi-asserted-by":"crossref","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R., Sahai A.: Cryptography with constant computational overhead. In: Dwork C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17\u201320, 2008, pp. 433\u2013442. ACM (2008).","DOI":"10.1145\/1374376.1374438"},{"issue":"3","key":"1222_CR62","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Ishai Y., Kushilevitz E., Ostrovsky R.: Sahai A: Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121\u20131152 (2009).","journal-title":"SIAM J. Comput."},{"key":"1222_CR63","doi-asserted-by":"crossref","unstructured":"Ishai Y., Mahmoody M., Sahai A.: On efficient zero-knowledge PCPs. In: TCC, pp. 151\u2013168 (2012). Full version: https:\/\/www.cs.virginia.edu\/~mohammad\/files\/papers\/ZKPCPs-Full.pdf.","DOI":"10.1007\/978-3-642-28914-9_9"},{"key":"1222_CR64","doi-asserted-by":"crossref","unstructured":"Ishai Y., Prabhakaran M., Sahai A.: Founding cryptography on oblivious transfer - efficiently. In: CRYPTO, pp. 572\u2013591 (2008).","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"1222_CR65","doi-asserted-by":"crossref","unstructured":"Ishai Y., Prabhakaran M., Sahai A.: Secure arithmetic computation with no honest majority. In: TCC, pp. 294\u2013314 (2009).","DOI":"10.1007\/978-3-642-00457-5_18"},{"key":"1222_CR66","unstructured":"Ishai Y.: Zero-knowledge proofs from information-theoretic proof systems (2020). https:\/\/zkproof.org\/2020\/08\/12\/information-theoretic-proof-systems."},{"key":"1222_CR67","doi-asserted-by":"crossref","unstructured":"Ishai Y., Weiss M.: Probabilistically checkable proofs of proximity with zero-knowledge. In: TCC, pp. 121\u2013145 (2014).","DOI":"10.1007\/978-3-642-54242-8_6"},{"key":"1222_CR68","doi-asserted-by":"crossref","unstructured":"Kilian J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC, pp. 723\u2013732 (1992).","DOI":"10.1145\/129712.129782"},{"key":"1222_CR69","doi-asserted-by":"crossref","unstructured":"Katz J., Kolesnikov V., Wang X.: Improved non-interactive zero knowledge with applications to post-quantum signatures. In: CCS, pp. 525\u2013537 (2018).","DOI":"10.1145\/3243734.3243805"},{"key":"1222_CR70","unstructured":"Kothapalli A., Masserova E., Parno B.: A direct construction for asymptotically optimal zksnarks. IACR Cryptol. ePrint Arch., p. 1318 (2020)."},{"key":"1222_CR71","doi-asserted-by":"crossref","unstructured":"Kalai Y.T., Raz R.: Interactive PCP. In: ICALP, pp. 536\u2013547 (2008).","DOI":"10.1007\/978-3-540-70583-3_44"},{"key":"1222_CR72","doi-asserted-by":"crossref","unstructured":"Lund C., Fortnow L., Karloff H.J., Nisan N.: Algebraic methods for interactive proof systems. In: FOCS, pp. 2\u201310 (1990).","DOI":"10.1109\/FSCS.1990.89518"},{"key":"1222_CR73","unstructured":"Lee J., Setty S.T.V., Thaler J., Wahby R.S.: Linear-time zero-knowledge snarks for R1CS. IACR Cryptol. ePrint Arch., p. 30 (2021)."},{"key":"1222_CR74","doi-asserted-by":"crossref","unstructured":"Merkle R.C.: A certified digital signature. In: CRYPTO, pp. 218\u2013238 (1989).","DOI":"10.1007\/0-387-34805-0_21"},{"key":"1222_CR75","doi-asserted-by":"crossref","unstructured":"Micali S.: CS proofs (extended abstracts). In: FOCS, pp. 436\u2013453 (1994).","DOI":"10.1109\/SFCS.1994.365746"},{"key":"1222_CR76","doi-asserted-by":"crossref","unstructured":"Polishchuk A., Spielman D.A.: Nearly-linear size holographic proofs. In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, pp. 194\u2013203 (1994).","DOI":"10.1145\/195058.195132"},{"key":"1222_CR77","doi-asserted-by":"crossref","unstructured":"Pass R., Venkitasubramaniam M.: Is it easier to prove theorems that are guaranteed to be true? In FOCS, pp. 1255\u20131267 (2020).","DOI":"10.1109\/FOCS46700.2020.00119"},{"key":"1222_CR78","doi-asserted-by":"crossref","unstructured":"Ron-Zewi N., Rothblum R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. In: Leonardi S., Gupta A. (eds.) STOC \u201922: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20\u201324, 2022, pp. 1353\u20131363. ACM (2022).","DOI":"10.1145\/3519935.3519956"},{"key":"1222_CR79","doi-asserted-by":"crossref","unstructured":"Reingold O., Rothblum G.N., Rothblum R.D.: Constant-round interactive proofs for delegating computation. In: STOC, pp. 49\u201362 (2016).","DOI":"10.1145\/2897518.2897652"},{"key":"1222_CR80","unstructured":"Ronny R., Gilles Z.: Personal communication (2017)."},{"key":"1222_CR81","doi-asserted-by":"crossref","unstructured":"Setty S.T.V., Braun B., Andrew J.V.V., Bryan Parno B., Walfish M.: Resolving the conflict between generality and plausibility in verified computation. In: Eighth Eurosys Conference, pp. 71\u201384 (2013).","DOI":"10.1145\/2465351.2465359"},{"key":"1222_CR82","doi-asserted-by":"crossref","unstructured":"Setty S.T.V.: Spartan: efficient and general-purpose zksnarks without trusted setup. In: Micciancio D., Ristenpart T. (eds.) CRYPTO, pp. 704\u2013737 (2020).","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"1222_CR83","unstructured":"Shamir A.: Ip=pspace. In: FOCS, pp. 11\u201315 (1990)."},{"key":"1222_CR84","unstructured":"Setty S.T.V., Lee J.: Quarks: Quadruple-efficient transparent zksnarks. IACR Cryptol. ePrint Arch., p. 1275 (2020)."},{"key":"1222_CR85","unstructured":"Setty S.T., McPherson R., Blumberg A.J., Walfish M.: Making argument systems for outsourced computation practical (sometimes). In: NDSS (2012)."},{"key":"1222_CR86","doi-asserted-by":"crossref","unstructured":"Thaler J.: Time-optimal interactive proofs for circuit evaluation. In: CRYPTO, pp. 71\u201389 (2013).","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"1222_CR87","doi-asserted-by":"crossref","unstructured":"Thaler J.: Proofs, arguments, and zero-knowledge (2022). https:\/\/people.cs.georgetown.edu\/jthaler\/ProofsArgsAndZK.html.","DOI":"10.1561\/9781638281252"},{"key":"1222_CR88","doi-asserted-by":"crossref","unstructured":"Vu V., Setty S.T.V., Blumberg A.J., Walfish M.: A hybrid architecture for interactive verifiable computation. In: S &P, pp. 223\u2013237 (2013).","DOI":"10.1109\/SP.2013.48"},{"issue":"2","key":"1222_CR89","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2641562","volume":"58","author":"M Walfish","year":"2015","unstructured":"Walfish M., Blumberg A.J.: Verifying computations without reexecuting them. Commun. ACM 58(2), 74\u201384 (2015).","journal-title":"Commun. ACM"},{"key":"1222_CR90","doi-asserted-by":"crossref","unstructured":"Wahby R.S., Tzialla I., Shelat A., Thaler J., Walfish M.: Doubly-efficient zksnarks without trusted setup. In: S &P, pp. 926\u2013943 (2018).","DOI":"10.1109\/SP.2018.00060"},{"key":"1222_CR91","doi-asserted-by":"crossref","unstructured":"Xie T., Zhang J., Zhang Y., Papamanthou C., Song D.: Libra: Succinct zero-knowledge proofs with optimal prover computation. In: CRYPTO, pp. 733\u2013764 (2019).","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"1222_CR92","doi-asserted-by":"crossref","unstructured":"Xie T., Zhang J., Zhang Y., Papamanthou C., Song D.: Libra: Succinct zero-knowledge proofs with optimal prover computation. In: CRYPTO, pp. 733\u2013764. Springer (2019).","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"1222_CR93","doi-asserted-by":"crossref","unstructured":"Zhang Y., Genkin D., Katz J., Papadopoulos D., Papamanthou C.: vsql: Verifying arbitrary SQL queries over dynamic outsourced databases. In: IEEE Symposium on Security and Privacy, pp. 863\u2013880 (2017).","DOI":"10.1109\/SP.2017.43"},{"key":"1222_CR94","doi-asserted-by":"crossref","unstructured":"Zhang J., Liu T., Wang W., Zhang Y., Song D., Xie X., Zhang Y.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: CCS, pp. 159\u2013177 (2021).","DOI":"10.1145\/3460120.3484767"},{"key":"1222_CR95","doi-asserted-by":"crossref","unstructured":"Zhang J., Liu T., Wang W., Zhang Y., Song D., Xie X., Zhang Y.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: CCS, pp. 159\u2013177. ACM (2021).","DOI":"10.1145\/3460120.3484767"},{"key":"1222_CR96","doi-asserted-by":"crossref","unstructured":"Zhang J., Xie T., Zhang Y., Song D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: S &P, pp. 859\u2013876. IEEE (2020).","DOI":"10.1109\/SP40000.2020.00052"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01222-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01222-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01222-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T02:39:30Z","timestamp":1729737570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01222-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,13]]},"references-count":96,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1222"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01222-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,13]]},"assertion":[{"value":"30 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}