{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T12:57:25Z","timestamp":1765371445730,"version":"3.46.0"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032133007","type":"print"},{"value":"9783032133014","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T00:00:00Z","timestamp":1765411200000},"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-13301-4_5","type":"book-chapter","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:12:27Z","timestamp":1765357947000},"page":"95-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["BOIL: Proof-Carrying Data from\u00a0Accumulation of\u00a0Correlated Holographic IOPs"],"prefix":"10.1007","author":[{"given":"Tohru","family":"Kohrita","sequence":"first","affiliation":[]},{"given":"Maksim","family":"Nikolaev","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Silva","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,11]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: STIR: Reed-solomon proximity testing with fewer queries. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X. LNCS, vol. 14929, pp. 380\u2013413. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_12","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Arnon, G., Chiesa, A., Fenzi, G., Yogev, E.: Whir: Reed\u2013solomon proximity testing with super-fast verification. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) ICALP 2018, LIPIcs, vol.\u00a0107, pp. 1\u201317. Schloss Dagstuhl (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for reed-solomon codes. In: 61st FOCS, pp. 900\u2013909. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00088","DOI":"10.1109\/FOCS46700.2020.00088"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Hirt, M., Smith, A.D. (eds.) TCC\u00a02016-B, Part\u00a0II, LNCS, vol.\u00a09986, pp. 31\u201360. Springer, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_2","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"5_CR6","doi-asserted-by":"publisher","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\u00a02014, Part\u00a0II, LNCS, vol.\u00a08617, pp. 276\u2013294. Springer, Berlin (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"5_CR7","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKs and proof-carrying data. Cryptology ePrint Archive, Report 2012\/095 (2012). https:\/\/eprint.iacr.org\/2012\/095"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Block, A.R., Garreta, A., Katz, J., Thaler, J., Tiwari, P.R., Zajac, M.: Fiat-shamir security of FRI and related SNARKs. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0II, LNCS, vol. 14439, pp. 3\u201340. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_1","DOI":"10.1007\/978-981-99-8724-5_1"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: proof-carrying data from additive polynomial commitments. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I, LNCS, vol. 12825, pp. 649\u2013680. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_23","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"5_CR10","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chen, B.: Protostar: generic efficient accumulation\/folding for special-sound protocols. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT\u00a02023, Part\u00a0II, LNCS, vol. 14439, pp. 77\u2013110. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8724-5_3","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"5_CR12","doi-asserted-by":"publisher","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\u00a02021, Part\u00a0I, LNCS, vol. 12825, pp. 681\u2013710. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"5_CR13","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Proof-carrying data from accumulation schemes. Cryptology ePrint Archive, Report 2020\/499 (2020). https:\/\/eprint.iacr.org\/2020\/499"},{"key":"5_CR14","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. Cryptology ePrint Archive, Report 2024\/474 (2024). https:\/\/eprint.iacr.org\/2024\/474"},{"key":"5_CR15","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Arc: accumulation for reed\u2013solomon codes (2024). https:\/\/eprint.iacr.org\/2024\/1731, publication info: Preprint"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023, Part\u00a0II, LNCS, vol. 14005, pp. 499\u2013530. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"5_CR17","unstructured":"Chiesa, A.: Proof-carrying data (2010). https:\/\/dspace.mit.edu\/handle\/1721.1\/61151. accepted: 2011-02-23T14:20:59Z Journal Abbreviation: PCD"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT\u00a02020, Part\u00a0I, LNCS, vol. 12105, pp. 769\u2013793. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"5_CR19","unstructured":"Chiesa, A., Yogev, E.: Building cryptographic proofs from hash functions (2024). https:\/\/github.com\/hash-based-snargs-book"},{"key":"5_CR20","unstructured":"Deng, S., Du, B.: zkTree: a zk recursion tree with ZKP membership proofs. Cryptology ePrint Archive, Report 2023\/208 (2023). https:\/\/eprint.iacr.org\/2023\/208"},{"key":"5_CR21","unstructured":"Eagen, L., Gabizon, A.: ProtoGalaxy: efficient ProtoStar-style folding of multiple instances. Cryptology ePrint Archive, Report 2023\/1106 (2023). https:\/\/eprint.iacr.org\/2023\/1106"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO\u201986, LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Berlin (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"5_CR23","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Report 2020\/315 (2020). https:\/\/eprint.iacr.org\/2020\/315"},{"key":"5_CR24","unstructured":"Gabizon, A., Williamson, Z.J.: Proposal: the turbo-plonk program syntax for specifying snark programs (2020). https:\/\/docs.zkproof.org\/pages\/standards\/accepted-workshop3\/ proposal-turbo_plonk.pdf"},{"key":"5_CR25","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: PLONK: permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Report 2019\/953 (2019). https:\/\/eprint.iacr.org\/2019\/953"},{"key":"5_CR26","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019)"},{"key":"5_CR27","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: Poseidon: a new hash function for zero-knowledge proof systems. In: Bailey, M., Greenstadt, R. (eds.) USENIX Security 2021, pp. 519\u2013535. USENIX Association (2021)"},{"key":"5_CR28","unstructured":"Hab\u00f6ck, U.: A summary on the FRI low degree test. Cryptology ePrint Archive, Report 2022\/1216 (2022). https:\/\/eprint.iacr.org\/2022\/1216"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT\u00a02010, LNCS, vol.\u00a06477, pp. 177\u2013194. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Kattis, A.A., Panarin, K., Vlasov, A.: RedShift: transparent SNARKs from list polynomial commitments. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 1725\u20131737. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560657","DOI":"10.1145\/3548606.3560657"},{"key":"5_CR31","unstructured":"Kohrita, T., Nikolaev, M., Silva, J.: BOIL: proof-carrying data from accumulation of correlated holographic IOPs. https:\/\/eprint.iacr.org\/2024\/1993"},{"key":"5_CR32","unstructured":"Kothapalli, A., Setty, S.: SuperNova: proving universal machine executions without universal circuits. Cryptology ePrint Archive, Report 2022\/1758 (2022). https:\/\/eprint.iacr.org\/2022\/1758"},{"key":"5_CR33","unstructured":"Kothapalli, A., Setty, S.: CycleFold: folding-scheme-based recursive arguments over a cycle of elliptic curves. Cryptology ePrint Archive, Report 2023\/1192 (2023). https:\/\/eprint.iacr.org\/2023\/1192"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S., Tzialla, I.: Nova: recursive zero-knowledge arguments from folding schemes. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0IV, LNCS, vol. 13510, pp. 359\u2013388. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.T.V.: HyperNova: recursive arguments for customizable constraint systems. In: Reyzin, L., Stebila, D. (eds.) CRYPTO\u00a02024, Part\u00a0X, LNCS, vol. 14929, pp. 345\u2013379. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11","DOI":"10.1007\/978-3-031-68403-6_11"},{"issue":"4","key":"5_CR36","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":"5_CR37","unstructured":"Nguyen, W., Boneh, D., Setty, S.: Revisiting the nova proof system on a cycle of curves. Cryptology ePrint Archive, Report 2023\/969 (2023). https:\/\/eprint.iacr.org\/2023\/969"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., Srinivasan, S., Gailly, N., Hishon-Rezaizadeh, I., Salumets, A., Golemac, S.: Reckle trees: updatable merkle batch proofs with applications. Cryptology ePrint Archive, Report 2024\/493 (2024). https:\/\/eprint.iacr.org\/2024\/493","DOI":"10.1145\/3658644.3670354"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO\u201991, LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Berlin, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9","DOI":"10.1007\/3-540-46766-1_9"},{"key":"5_CR40","doi-asserted-by":"publisher","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer, U.M. (ed.) EUROCRYPT\u201996, LNCS, vol.\u00a01070, pp. 387\u2013398. Springer, Berlin, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_33","DOI":"10.1007\/3-540-68339-9_33"},{"key":"5_CR41","unstructured":"Soukhanov, L.: Reverie: an end-to-end accumulation scheme from cyclefold. Cryptology ePrint Archive, Report 2023\/1888 (2023). https:\/\/eprint.iacr.org\/2023\/1888"},{"key":"5_CR42","unstructured":"StarkWare: ethSTARK documentation. Cryptology ePrint Archive, Report 2021\/582 (2021). https:\/\/eprint.iacr.org\/2021\/582"},{"key":"5_CR43","unstructured":"Szepieniec, A.: DEEP commitments and their applications (2024). https:\/\/eprint.iacr.org\/2024\/1752. publication info: Preprint"},{"key":"5_CR44","unstructured":"Team, P.Z.: Plonky2: fast recursive arguments with PLONK and FRI. https:\/\/github.com\/ mir-protocol\/plonky2\/tree\/main\/plonky2"},{"key":"5_CR45","unstructured":"Team, R.Z.: Zero-knowledge verifiable general computing platform based on zk-STARKs and the RISC-V microarchitecture. https:\/\/github.com\/risc0"},{"key":"5_CR46","doi-asserted-by":"publisher","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC\u00a02008, LNCS, vol.\u00a04948, pp. 1\u201318. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1","DOI":"10.1007\/978-3-540-78524-8_1"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13301-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T10:01:52Z","timestamp":1765360912000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13301-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,11]]},"ISBN":["9783032133007","9783032133014"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13301-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,11]]},"assertion":[{"value":"11 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneshwar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"14 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}