{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:13Z","timestamp":1778249413741,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253354","type":"print"},{"value":"9783032253361","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-25336-1_14","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:13:54Z","timestamp":1778246034000},"page":"389-415","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How to\u00a0Prove Post-quantum Security for\u00a0Succinct Non-interactive Reductions"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Chiesa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1055-0442","authenticated-orcid":false,"given":"Zijing","family":"Di","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7005-9220","authenticated-orcid":false,"given":"Zihan","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxi","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"14_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-031-68403-6_12","volume-title":"CRYPTO 2024","author":"G Arnon","year":"2024","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: Reed-Solomon proximity testing with fewer queries. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 380\u2013413. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_12"},{"key":"14_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-031-91134-7_8","volume-title":"EUROCRYPT 2025","author":"G Arnon","year":"2025","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: WHIR: Reed-Solomon proximity testing with super-fast verification. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT 2025. LNCS, vol. 15604, pp. 214\u2013243. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91134-7_8"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS 2017 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.V.: Strengths and weaknesses of quantum computing. SIAM J. Comput. (1997)","DOI":"10.1137\/S0097539796300933"},{"key":"14_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-981-99-8724-5_3","volume-title":"ASIACRYPT 2023","author":"B B\u00fcnz","year":"2023","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: generic efficient accumulation\/folding for special-sound protocols. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023. LNCS, vol. 14439, pp. 77\u2013110. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_3"},{"key":"14_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-981-95-5099-9_11","volume-title":"ASIACRYPT 2025","author":"D Boneh","year":"2026","unstructured":"Boneh, D., Chen, B.: LatticeFold: a lattice-based folding scheme and its applications to succinct proof systems. In: Hanaoka, G., Yang, B.Y. (eds.) ASIACRYPT 2025. LNCS, vol. 16247, pp. 330\u2013362. Springer, Singapore (2026). https:\/\/doi.org\/10.1007\/978-981-95-5099-9_11"},{"key":"14_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-032-01907-3_11","volume-title":"CRYPTO 2025","author":"D Boneh","year":"2025","unstructured":"Boneh, D., Chen, B.: LatticeFold+: faster, simpler, shorter lattice-based folding for succinct proof systems. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16006, pp. 327\u2013361. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_11"},{"key":"14_CR8","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 2013 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"14_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-032-12287-2_13","volume-title":"TCC 2025","author":"B B\u00fcnz","year":"2026","unstructured":"B\u00fcnz, B., Chiesa, A., Fenzi, G., Wang, W.: Linear-time accumulation schemes. In: Applebaum, B., Lin, H. (eds.) TCC 2025. LNCS, vol. 16268, pp. 369\u2013399. Springer, Cham (2026). https:\/\/doi.org\/10.1007\/978-3-032-12287-2_13"},{"key":"14_CR10","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":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-030-84242-0_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"B B\u00fcnz","year":"2021","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 681\u2013710. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-64378-2_1","volume-title":"Theory of Cryptography","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 1\u201318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1"},{"key":"14_CR13","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":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-662-44381-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 276\u2013294. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16"},{"key":"14_CR15","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Paper 2019\/1021"},{"key":"14_CR16","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: ITCS 2020 (2020)"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Baweja, A., Mishra, P., Mopuri, T., Shtepel, M.: Query-optimal IOPPs for linear-time encodable codes. In: Daemen, J., Thom\u00e9, E. (eds.) EUROCRYPT 2026. LNCS, vol. 16547, pp. 95\u2013120. Springer, Cham (2026). https:\/\/doi.org\/10.1007\/978-3-032-25336-1_4","DOI":"10.1007\/978-3-032-25336-1_4"},{"key":"14_CR18","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. In: ITCS 2025 (2025)"},{"key":"14_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-032-01907-3_5","volume-title":"CRYPTO 2025","author":"B B\u00fcnz","year":"2025","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Arc: accumulation for Reed-Solomon codes. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16006, pp. 128\u2013160. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_5"},{"key":"14_CR20","unstructured":"Canetti, R., Chen, Y., Holmgren, J., Lombardi, A., Rothblum, G.N., Rothblum, R.D.: Fiat\u2013Shamir from simpler assumptions. Cryptology ePrint Archive, Paper 2018\/1004"},{"key":"14_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-032-12296-4_16","volume-title":"TCC 2025","author":"A Chiesa","year":"2026","unstructured":"Chiesa, A., Dall\u2019Agnol, M., Di, Z., Guan, Z., Spooner, N.: Quantum rewinding for IOP-based succinct arguments. In: Applebaum, B., Lin, H. (eds.) TCC 2025. LNCS, vol. 16270, pp. 460\u2013479. Springer, Cham (2026). https:\/\/doi.org\/10.1007\/978-3-032-12296-4_16"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-030-77886-6_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"K-M Chung","year":"2021","unstructured":"Chung, K.-M., Fehr, S., Huang, Y.-H., Liao, T.-N.: On the compressed-oracle technique, and post-quantum security of proofs of sequential work. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 598\u2013629. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_21"},{"key":"14_CR23","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":"14_CR24","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: FOCS 2021 (2021)","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"14_CR25","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: ICS 2010 (2010)"},{"key":"14_CR26","unstructured":"Chiesa, A., Yogev, E.: Building Cryptographic Proofs from Hash Functions (2024). https:\/\/github.com\/hash-based-snargs-book"},{"key":"14_CR27","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-031-07082-2_24","volume-title":"EUROCRYPT 2022","author":"J Don","year":"2022","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Online-extractability in the quantum random-oracle model. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 677\u2013706. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_24"},{"key":"14_CR28","unstructured":"Eagen, L., Gabizon, A.: ProtoGalaxy: efficient ProtoStar-style folding of multiple instances. Cryptology ePrint Archive, Paper 2023\/1106"},{"key":"14_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-981-96-0894-2_10","volume-title":"ASIACRYPT 2024","author":"G Fenzi","year":"2025","unstructured":"Fenzi, G., Knabenhans, C., Nguyen, N.K., Pham, D.T.: Lova: lattice-based folding scheme from unstructured lattices. In: Chung, K.M., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15487, pp. 303\u2013326. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_10"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC 1996 (1996)","DOI":"10.1145\/237814.237866"},{"key":"14_CR31","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-031-68403-6_11","volume-title":"CRYPTO 2024","author":"A Kothapalli","year":"2024","unstructured":"Kothapalli, A., Setty, S.: HyperNova: recursive arguments for customizable constraint systems. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 345\u2013379. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11"},{"key":"14_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-031-15985-5_13","volume-title":"CRYPTO 2022","author":"A Kothapalli","year":"2022","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 359\u2013388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably. In: FOCS 2022 (2022)","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"14_CR34","unstructured":"Nguyen, W., Setty, S.: Neo: lattice-based folding scheme for CCS over small fields and pay-per-bit commitments. Cryptology ePrint Archive, Paper 2025\/294"},{"key":"14_CR35","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-032-01907-3_4","volume-title":"CRYPTO 2025","author":"L Rotem","year":"2025","unstructured":"Rotem, L., Tessaro, S.: Straight-line knowledge extraction for multi-round protocols. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16006, pp. 95\u2013127. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01907-3_4"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78524-8_1","volume-title":"Theory of Cryptography","author":"P Valiant","year":"2008","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: A note on the quantum collision and set equality problems. In: Quantum Information Computation (2015)","DOI":"10.26421\/QIC15.7-8-2"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-26951-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:14:12Z","timestamp":1778246052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","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":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}