{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:58:16Z","timestamp":1778291896285,"version":"3.51.4"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122957","type":"print"},{"value":"9783032122964","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T00:00:00Z","timestamp":1764720000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12296-4_16","type":"book-chapter","created":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:08:04Z","timestamp":1764666484000},"page":"460-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum Rewinding for\u00a0IOP-Based Succinct Arguments"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Chiesa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Dall\u2019Agnol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijing","family":"Di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyi","family":"Guan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Spooner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,3]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: reed-solomon proximity testing with fewer queries. In: Proceedings of the 44th Annual International Cryptology Conference. CRYPTO\u00a02024, pp. 380\u2013413 (2024)","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.K.: Lattice-based snarks: publicly verifiable, preprocessing, and recursively composable. In: Proceedings of the 42nd Annual International Cryptology Conference. CRYPTO\u00a02022, pp. 102\u2013132 (2022)","DOI":"10.1007\/978-3-031-15979-4_4"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Yogev., E.: IOPs with inverse polynomial soundness error. In: Proceedings of the 64th Annual IEEE Symposium on Foundations of Computer Science. FOCS\u00a02023, pp.\u00a0752\u2013761 (2023)","DOI":"10.1109\/FOCS57990.2023.00050"},{"key":"16_CR4","unstructured":"Applebaum, B., Haramaty, N., Ishai, Y., Kushilevitz, E., Vaikuntanathan, V.: Low-complexity cryptographic hash functions. In: Proceedings of the 8th Innovations in Theoretical Computer Science Conference. ITCS\u00a02017, 7:1\u20137:31 (2017)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable Zero Knowledge with No Trusted Setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"16_CR6","unstructured":"Ben-Sasson, E., Chiesa, A., Gabizon, A., Riabzev, M., Spooner, N.: Interactive oracle proofs with constant rate and query complexity. In: Proceedings of the 44th International Colloquium on Automata, Languages and Programming. ICALP\u00a02017, 40:1\u201340:15 (2017)"},{"key":"16_CR7","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":"16_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. LNCS, vol. 9986, pp. 31\u201360. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. SIAM J. Comput. 38(5), 1661\u20131694 (2008). Preliminary version appeared in CCC\u00a0\u201902","DOI":"10.1137\/070709244"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Bartusek, J., et al.: Succinct classical verification of quantum computation. In: Proceedings of the 42nd Annual International Cryptology Conference. CRYPTO\u00a02022, pp. 195\u2013211 (2022)","DOI":"10.1007\/978-3-031-15979-4_7"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-030-56880-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"J Bootle","year":"2020","unstructured":"Bootle, J., Lyubashevsky, V., Nguyen, N.K., Seiler, G.: A Non-PCP Approach to Succinct Quantum-Safe Zero-Knowledge. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 441\u2013469. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_16"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Proceedings of the 42nd Annual International Conference on Theory and Application of Cryptographic Techniques. EUROCRYPT\u00a02023, pp.\u00a0499\u2013530 (2023)","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"16_CR13","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D.: Fiat\u2013Shamir From Simpler Assumptions. Cryptology ePrint Archive, Report 2018\/1004 (2018)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-84242-0_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"N-H Chia","year":"2021","unstructured":"Chia, N.-H., Chung, K.-M., Yamakawa, T.: A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 315\u2013345. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_12"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Dall\u2019Agnol, M., Guan, Z., Spooner, N., Yogev, E.: Untangling the security of Kilian\u2019s protocol: upper and lower bounds. In: Proceedings of the 22nd Theory of Cryptography Conference. TCC\u00a02024 (2024)","DOI":"10.1007\/978-3-031-78011-0_6"},{"key":"16_CR16","unstructured":"Chiesa, A., Dall\u2019Agnol, M., Guan, Z., Spooner, N.: On the Security of Succinct Interactive Arguments from Vector Commitments. Cryptology ePrint Archive, Report 2023\/1737 (2023)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector Commitments and Their Applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"16_CR18","unstructured":"Chiesa, A., Guan, Z., Knabenhans, C., Yu, Z.: On the Fiat\u2013Shamir Security of Succinct Arguments from Functional Commitments. Cryptology ePrint Archive, Paper 2025\/902 (2025). https:\/\/eprint.iacr.org\/2025\/902"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-36033-7_1","volume-title":"Theory of Cryptography","author":"A Chiesa","year":"2019","unstructured":"Chiesa, A., Manohar, P., Spooner, N.: Succinct Arguments in the Quantum Random Oracle Model. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 1\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_1"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: Proceedings of the 62nd Annual IEEE Symposium on Foundations of Computer Science. FOCS\u00a02021, pp. 49\u201358 (2021)","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Debris-Alazard, T., Fallahpour, P., Stehl\u00e9, D.: Quantum oblivious LWE sampling and insecurity of standard model lattice-based SNARKs. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. STOC 2024, pp. 423\u2013434 (2024)","DOI":"10.1145\/3618260.3649766"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Lee, J., Setty, S.T\/V., Thaler, J., Wahby, R.S.: Brakedown: Linear-time and field-agnostic SNARKs for R1CS. In: Proceedings of the 43rd Annual International Cryptology Conference. CRYPTO\u00a02023, pp. 193\u2013226 (2023)","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Minelli, M., Nitulescu, A., Orr\u00f9, M.: Lattice-based ZK-SNARKs from square span programs. In: Proceedings of the 25th ACM Conference on Computer and Communications Security. CCS\u00a02018, pp. 556\u2013573 (2018)","DOI":"10.1145\/3243734.3243845"},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s00145-023-09481-3","volume":"36","author":"C Ganesh","year":"2023","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: SNARKs for ring arithmetic. J. Cryptol. 36(4), 41 (2023)","journal-title":"J. Cryptol."},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing. STOC\u00a02011, pp.\u00a099\u2013108 (2011)","DOI":"10.1145\/1993636.1993651"},{"key":"16_CR26","unstructured":"Hab\u00f6ck, U., Levit, D., Papini, S.: Circle STARKs. Cryptology ePrint Archive, Report 2024\/278 (2024). https:\/\/eprint.iacr.org\/2024\/278"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Rothblum, R.D.: Faster sounder succinct arguments and IOPs. In: Proceedings of the 42nd Annual International Cryptology Conference. CRYPTO\u00a02022, pp. 474\u2013503 (2022)","DOI":"10.1007\/978-3-031-15802-5_17"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Su, H., Wu, D.J.: Shorter and faster post-quantum designated-verifier zkSNARKs from lattices. In: Proceedings of the 28th ACM Conference on Computer and Communications Security. CCS\u00a02021, pp. 212\u2013234 (2021)","DOI":"10.1145\/3460120.3484572"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing. STOC\u00a01992, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Lai, R.W.F., Malavolta, G., Spooner, N.: Quantum rewinding for many-round protocols. In: Proceedings of the 20th Theory of Cryptography Conference. TCC\u00a02022, pp. 80\u2013109 (2022)","DOI":"10.1007\/978-3-031-22318-1_4"},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably. In: Proceedings of the 63rd Annual IEEE Symposium on Foundations of Computer Science. FOCS\u00a02022, pp. 851\u2013859 (2022)","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Metger, T., Natarajan, A., Zhang, T.: Succinct arguments for QMA from standard assumptions via compiled nonlocal games. In: Proceedings of the 65th Annual IEEE Symposium on Foundations of Computer Science. FOCS\u00a02024, pp. 1193\u20131201 (2024)","DOI":"10.1109\/FOCS61266.2024.00078"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum, R.: Local proofs approaching the witness length. In: Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science. FOCS\u00a02020 (2020)","DOI":"10.1109\/FOCS46700.2020.00083"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Ron-Zewi, N., Rothblum, R.D.: Proving as fast as computing: succinct arguments with constant prover overhead. In: Proceedings of the 54th Annual ACM Symposium on Theory of Computing. STOC\u00a02022, pp. 1353\u20131363 (2022)","DOI":"10.1145\/3519935.3519956"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, R., Rothblum, G.: Constant-round interactive proofs for delegating computation. In: Proceedings of the 48th ACM Symposium on the Theory of Computing. STOC\u00a02016, pp.\u00a049\u201362 (2016)","DOI":"10.1145\/2897518.2897652"},{"key":"16_CR36","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive, Report 2023\/552 (2023). https:\/\/eprint.iacr.org\/2023\/552"},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Unruh","year":"2012","unstructured":"Unruh, D.: Quantum Proofs of Knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 135\u2013152. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10"},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-662-53890-6_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Collapse-Binding Quantum Commitments Without Random Oracles. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 166\u2013195. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_6"},{"key":"16_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Unruh","year":"2016","unstructured":"Unruh, D.: Computationally Binding Quantum Commitments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 497\u2013527. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18"},{"key":"16_CR40","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM J. Comput. 39(1), 25\u201358 (2009). Preliminary version appeared in STOC\u00a0\u201906","DOI":"10.1137\/060670997"},{"issue":"2","key":"16_CR41","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":"16_CR42","doi-asserted-by":"crossref","unstructured":"Wee, H., Wu, D.J.: Lattice-based functional commitments: fast verification and cryptanalysis. In: Proceedings of the 29th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT\u00a02023, pp. 201\u2013235 (2023)","DOI":"10.1007\/978-981-99-8733-7_7"},{"key":"16_CR43","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: Proceedings of the 44th Annual International Cryptology Conference. CRYPTO\u00a02024, pp. 138\u2013169 (2024)","DOI":"10.1007\/978-3-031-68403-6_5"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12296-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T09:08:13Z","timestamp":1764666493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12296-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,3]]},"ISBN":["9783032122957","9783032122964"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12296-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,3]]},"assertion":[{"value":"3 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}