{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:20:38Z","timestamp":1764645638647,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031158018"},{"type":"electronic","value":"9783031158025"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15802-5_17","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T16:59:52Z","timestamp":1665507592000},"page":"474-503","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Faster Sounder Succinct Arguments and\u00a0$$\\textsf{IOP}$$s"],"prefix":"10.1007","author":[{"given":"Justin","family":"Holmgren","sequence":"first","affiliation":[]},{"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"key":"17_CR1","unstructured":"Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: Papadimitriou, C.H. (ed.) ITCS 2017. LIPIcs, vol. 67. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 7:1\u20137:31 (2017)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-32009-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"N Bitansky","year":"2012","unstructured":"Bitansky, N., Chiesa, A.: Succinct arguments from multi-prover interactive proofs and their efficiency benefits. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 255\u2013272. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_16"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-319-70700-6_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"J Bootle","year":"2017","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 336\u2013365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_12"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-030-36033-7_19","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Goldberg, L., Gur, T., Riabzev, M., Spooner, N.: Linear-size constant-query IOPs for delegating computation. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 494\u2013521. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_19"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-64378-2_2","volume-title":"Theory of Cryptography","author":"J Bootle","year":"2020","unstructured":"Bootle, J., Chiesa, A., Groth, J.: Linear-time arguments with sublinear verification from tensor codes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 19\u201346. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_2"},{"key":"17_CR6","unstructured":"Bootle, J., Chiesa, A., Liu, S.: Zero-knowledge succinct arguments with a linear-time prover. ePrint 2020, 1527 (2020)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-53644-5_2","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A. (eds.) TCC 2016, Part II. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"M Ben-Or","year":"1990","unstructured":"Ben-Or, M., et al.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 37\u201356. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_4"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-030-64378-2_7","volume-title":"Theory of Cryptography","author":"AR Block","year":"2020","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: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 168\u2013197. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_7"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-84259-8_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Block","year":"2021","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 123\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-030-84259-8_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"C Baum","year":"2021","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime }n^{\\prime }Cheese$$: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"17_CR14","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: 2nd Conference on Information-Theoretic Cryptography, ITC 2021, 23\u201326 July 2021, Virtual Conference. LIPIcs, vol. 199. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 5:1\u20135:24 (2021)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/11830924_29","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I Dinur","year":"2006","unstructured":"Dinur, I., Sudan, M., Wigderson, A.: Robust local testability of tensor products of LDPC codes. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX\/RANDOM -2006. LNCS, vol. 4110, pp. 304\u2013315. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11830924_29"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-030-45721-1_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"N Ephraim","year":"2020","unstructured":"Ephraim, N., Freitag, C., Komargodski, I., Pass, R.: SPARKs: succinct parallelizable arguments of knowledge. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 707\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_25"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Franzese, N., Katz, J., Lu, S., Ostrovsky, R., Wang, X., Weng, C.: Constant-overhead zero-knowledge for RAM programs. ePrint 979 (2021)","DOI":"10.1145\/3460120.3484800"},{"key":"17_CR18","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: linear-time and post-quantum snarks for R1CS, Cryptology ePrint Archive, Report 2021\/1043 (2021). https:\/\/ia.cr\/2021\/1043"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR20","unstructured":"Gur, T., Ramnarayan, G., Rothblum, R.D.: Relaxed locally correctable codes. In: ITCS 2018, pp. 27:1\u201327:11 (2018)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Rothblum, R.: Delegating computations with (almost) minimal time and space overhead. In: Thorup, M. (ed.) FOCS 2018. IEEE Computer Society, pp. 124\u2013135 (2018)","DOI":"10.1109\/FOCS.2018.00021"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: Dwork, C. (ed.) STOC 2008. ACM, pp. 433\u2013442 (2008)","DOI":"10.1145\/1374376.1374438"},{"issue":"3","key":"17_CR23","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":"17_CR24","unstructured":"Ishai, Y.: Zero-knowledge proofs from information-theoretic proof systems (2020). https:\/\/zkproof.org\/2020\/08\/12\/information-theoretic-proof-systems"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: STOC 1992, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"17_CR26","unstructured":"Lee, J., Setty, S., Thaler, J., Wahby, R.: Linear-time zero-knowledge snarks for R1CS. Cryptology ePrint Archive, Report 2021\/030 (2021). https:\/\/eprint.iacr.org\/2021\/030"},{"issue":"4","key":"17_CR27","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. ePrint 1673 (2021)","DOI":"10.1145\/3519935.3519956"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. SIAM J. Comput. 50(3) (2021)","DOI":"10.1137\/16M1096773"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Shoup, V.: New algorithms for finding irreducible polynomials over finite fields. In: FOCS 1988, pp. 283\u2013290 (1988)","DOI":"10.1109\/SFCS.1988.21944"},{"issue":"6","key":"17_CR31","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"A Daniel","year":"1996","unstructured":"Daniel, A.: Spielman, Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theory 42(6), 1723\u20131731 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"17_CR32","unstructured":"Sudan, M.: Algorithmic introduction to coding theory (lecture notes) (2001)"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge (2021). https:\/\/people.cs.georgetown.edu\/jthaler\/ProofsArgsAndZK.html","DOI":"10.1561\/9781638281252"},{"issue":"3","key":"17_CR34","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1002\/rsa.20498","volume":"46","author":"M Viderman","year":"2015","unstructured":"Viderman, M.: A combination of testability and decodability by tensor products. Random Struct. Algorithms 46(3), 572\u2013598 (2015)","journal-title":"Random Struct. Algorithms"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. In: SP 2021, pp. 1074\u20131091. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00056"},{"key":"17_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Xie","year":"2019","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: QuickSilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. ePrint 76 (2021)","DOI":"10.1145\/3460120.3484556"},{"key":"17_CR38","unstructured":"Zhang, J., Wang, W., Zhang, Y., Zhang, Y.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. ePrint 2020, 1247 (2020)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15802-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:06:29Z","timestamp":1760133989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15802-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158018","9783031158025"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15802-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}