{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:07:17Z","timestamp":1786979237523,"version":"3.56.0"},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551217","type":"print"},{"value":"9789819551224","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5122-4_11","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:28:57Z","timestamp":1765103337000},"page":"333-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["IVC in\u00a0the\u00a0Open-and-Sign Random Oracle Model"],"prefix":"10.1007","author":[{"given":"Mary","family":"Maller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Mohnblatt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aranxta","family":"Zapico","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Arun, A., Setty, S.T.V., Thaler, J.: Jolt: SNARKs for virtual machines via lookups. In: Joye, M., Leander, G. (eds.) Advances in Cryptology - EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zurich, Switzerland, May 26-30, 2024, Proceedings, Part VI, volume 14656 of Lecture Notes in Computer Science, pp. 3\u201333. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_1","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"11_CR2","unstructured":"Barbara, A., Chiesa, A., Guan, Z.: Relativized succinct arguments in the ROM do not exist. Cryptology ePrint Archive, Paper 2024\/728 (2024). https:\/\/eprint.iacr.org\/2024\/728"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A.D. (eds.) Theory of Cryptography - 14th International Conference, TCC 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part II, volume 9986 of Lecture Notes in Computer Science, pp. 31\u201360 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. Algorithmica 79, 1102\u20131160 (2014). https:\/\/api.semanticscholar.org\/CorpusID:8825569","DOI":"10.1007\/s00453-016-0221-0"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for snarks and proof-carrying data. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 111\u2013120 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"11_CR6","unstructured":"Boneh, D., Chen, B.: LatticeFold: A lattice-based folding scheme and its applications to succinct proof systems. IACR Cryptol. ePrint Arch., p. 257 (2024). https:\/\/eprint.iacr.org\/2024\/257"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Chen, B.: LatticeFold+: Faster, simpler, shorter lattice-based folding for succinct proof systems. IACR Cryptol. ePrint Arch., page 247 (2025). https:\/\/eprint.iacr.org\/2025\/247","DOI":"10.1007\/978-3-032-01907-3_11"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Boneh, D., Drake, J. Fisch, B., Gabizon, A.: Halo infinite: proof-carrying data from additive polynomial commitments. In: Advances in Cryptology\u2013CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16\u201320, 2021, Proceedings, Part I 41, pp. 649\u2013680. Springer (2021)","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"11_CR9","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Recursive proof composition without a trusted setup. Cryptology ePrint Archive, Paper 2019\/1021 (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chen, B.: ProtoStar: generic efficient accumulation\/folding for special sound protocols. In: Advances in Cryptology - ASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4-8, 2023, Proceedings, Part IV, Lecture Notes in Computer Science. Springer (2023)","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: Proof-carrying data without succinct arguments. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021, Cham: Springer International Publishing, pp. 681\u2013710 (2021). ISBN: 978-3-030-84242-0","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: Pass, R., Pietrzak, K. (eds.) Theory of Cryptography, pp. 1\u201318. Cham (2020). Springer International Publishing. ISBN 978-3-030-64378-2","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"11_CR13","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. IACR Cryptol. ePrint Arch., page 474 (2024). https:\/\/eprint.iacr.org\/2024\/474"},{"key":"11_CR14","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Arc: Accumulation for reed-solomon codes. IACR Cryptol. ePrint Arch., page 1731 (2024). https:\/\/eprint.iacr.org\/2024\/1731"},{"key":"11_CR15","unstructured":"B\u00fcnz, B., Chiesa, A., Fenzi, G., Wang, W.: Linear-time accumulation schemes. Cryptology ePrint Archive, Paper 2025\/753 (2025). https:\/\/eprint.iacr.org\/2025\/753"},{"key":"11_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisite. J. ACM 51(4), 557\u2013594 (2004). https:\/\/doi.org\/10.1145\/1008731.1008734","DOI":"10.1145\/1008731.1008734"},{"key":"11_CR17","doi-asserted-by":"publisher","unstructured":"Chen, M., Chiesa, A., Gur, T., O\u2019Connor, J., Spooner, N.: Proof-carrying data from arithmetized random oracles. In: Hazay, C., Stam, M., (eds.) Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part II, volume 14005 of Lecture Notes in Computer Science, pp. 379\u2013404. Springer, (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_13","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Chen, M., Chiesa, A., Spooner, N.: On succinct non-interactive arguments in relativized worlds. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part II, volume 13276 of Lecture Notes in Computer Science, pp. 336\u2013366. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_12","DOI":"10.1007\/978-3-031-07085-3_12"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ojha, D., Spooner, N..: Fractal: post-quantum and transparent recursive proofs from holography. In: Advances in Cryptology\u2013EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10\u201314, 2020, Proceedings, Part I 39, pp. 769\u2013793. Springer (2020)","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"11_CR20","first-page":"310","volume":"10","author":"A Chiesa","year":"2010","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. ICS 10, 310\u2013331 (2010)","journal-title":"ICS"},{"key":"11_CR21","doi-asserted-by":"publisher","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-np and applications. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pp. 1057\u20131068. IEEE (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00103","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"11_CR22","unstructured":"Eagen, L., Gabizon, A.: Protogalaxy: Efficient protostar-style folding of multiple instances. Cryptology ePrint Archive (2023)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Vol. 10992. LNCS, pp. 33\u201362. Springer (2018)","DOI":"10.1007\/978-3-319-96881-0_2"},{"key":"11_CR24","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: POSEIDON: a new hash function for zero-knowledge proof systems. In: Bailey, M.D., Greenstadt, R. (eds.) 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021, pp. 519\u2013535. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/grassi"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Wichs, D.: Boosting batch arguments and RAM delegation. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 1545\u20131552. ACM (2023). https:\/\/doi.org\/10.1145\/3564246.3585200","DOI":"10.1145\/3564246.3585200"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, pp. 669\u2013701, Cham (2023). Springer Nature Switzerland. ISBN 978-3-031-38551-3","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, pp. 359\u2013388. Cham (2022). Springer Nature Switzerland","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.T.V.: HyperNova: recursive arguments for customizable constraint systems. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part X, volume 14929 of Lecture Notes in Computer Science, pp. 345\u2013379. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"11_CR29","unstructured":"Lee, H., Seo, J.H.: On the security of nova recursive proof system. IACR Cryptol. ePrint Arch., page 232 (2024). https:\/\/eprint.iacr.org\/2024\/232"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), pp. 859\u2013868 (1992). https:\/\/doi.org\/10.1145\/146585.146605","DOI":"10.1145\/146585.146605"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge snarks from linear-size universal and updatable structured reference strings. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11-15, 2019, pp. 2111\u20132128. ACM (2019). https:\/\/doi.org\/10.1145\/3319535.3339817","DOI":"10.1145\/3319535.3339817"},{"key":"11_CR32","unstructured":"Marin, D., Abdalla, M., Govereau, P., Groth, J., Judson, S., Sosnin, K., Vamsi, G.: Nexus 1.0: Enabling verifiable computation (2024)"},{"key":"11_CR33","unstructured":"Mohnblatt, N.: Sangria: a folding scheme for PLONK (2023). https:\/\/geometry.xyz\/notebook\/sangria-a-folding-scheme-for-plonk"},{"key":"11_CR34","unstructured":"Nguyen, W., Boneh, D., Setty, S.: Revisiting the nova proof system on a cycle of curves. Cryptology ePrint Archive, Paper 2023\/969 (2023). https:\/\/eprint.iacr.org\/2023\/969"},{"key":"11_CR35","unstructured":"Nguyen, W.D., Setty, S.T.V.: Neo: Lattice-based folding scheme for CCS over small fields and pay-per-bit commitments. IACR Cryptol. ePrint Arch., page 294 (2025). https:\/\/eprint.iacr.org\/2025\/294"},{"key":"11_CR36","doi-asserted-by":"publisher","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pp. 1045\u20131056. IEEE (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00102","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"11_CR37","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive, Paper 2023\/552 (2023). https:\/\/eprint.iacr.org\/2023\/552"},{"key":"11_CR38","doi-asserted-by":"publisher","unstructured":"Smart, N.P.: The discrete logarithm problem on elliptic curves of trace one. J. Cryptol. 12(3), pp. 193\u2013196 (1999). https:\/\/doi.org\/10.1007\/S001459900052","DOI":"10.1007\/S001459900052"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Proceedings 5, pp. 1\u201318. Springer (2008)","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: To label, or not to label (in generic groups). In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part III, volume 13509 of Lecture Notes in Computer Science, pp. 66\u201396. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_3","DOI":"10.1007\/978-3-031-15982-4_3"},{"key":"11_CR41","unstructured":"Zheng, T., Gao, S., Guo, Y., Xiao, B.: KiloNova: Non-uniform PCD with zero-knowledge property from generic folding schemes. IACR Cryptol. ePrint Arch., page 1579 (2023). https:\/\/eprint.iacr.org\/2023\/1579"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5122-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T10:29:00Z","timestamp":1765103340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5122-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551217","9789819551224"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5122-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}