{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T08:46:32Z","timestamp":1780044392372,"version":"3.53.1"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019066","type":"print"},{"value":"9783032019073","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01907-3_5","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:31Z","timestamp":1755383251000},"page":"128-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Arc: Accumulation for\u00a0Reed\u2013Solomon Codes"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"B\u00fcnz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pratyush","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wilson","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"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 2024. 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":"publisher","unstructured":"Bell\u00e9s-Mu\u00f1oz, M., Jim\u00e9nez Urroz, J., Silva, J.: Revisiting cycles of pairing-friendly elliptic curves. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 3\u201337. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_1","DOI":"10.1007\/978-3-031-38545-2_1"},{"key":"5_CR3","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, pp. 14:1\u201314:17 (2018)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Carmon, D., Ishai, Y., Kopparty, S., Saraf, S.: Proximity gaps for Reed- Solomon codes. J. ACM 70(5), 31:1\u201331:57 (2023)","DOI":"10.1145\/3614423"},{"key":"5_CR5","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 2017, pp. 40:1\u201340:15 (2017)"},{"key":"5_CR6","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Scalable zero knowledge via cycles of elliptic curves. Algorithmica 79(4), 1102\u20131160 (2017)","DOI":"10.1007\/s00453-016-0221-0"},{"key":"5_CR8","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 2014. LNCS, vol. 8617, pp. 276\u2013294. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"5_CR9","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: Proceedings of the 11th Innovations in Theoretical Computer Science Conference. ITCS 2020, pp. 5:1\u20135:32 (2020)"},{"key":"5_CR10","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 45th ACM Symposium on the Theory of Computing, STOC 2013, pp. 111\u2013120 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"5_CR11","unstructured":"Boneh, D., Chen, B.: LatticeFold: a lattice-based folding scheme and its applications to succinct proof systems (2024). https:\/\/eprint.iacr.org\/2024\/257"},{"key":"5_CR12","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 2021. 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_CR13","unstructured":"Bonneau, J., Meckler, I., Rao, V., Shapiro, E.: Coda: decentralized cryptocurrency at scale (2020). https:\/\/eprint.iacr.org\/2020\/352"},{"key":"5_CR14","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: recursive proof composition without a trusted setup (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Boyle, E., Cohen, R., Goel, A.: Breaking the $$O(\\sqrt{n})$$-bit barrier: Byzantine agreement with polylog bits per party. J. Cryptol. 37(1), 2 (2024). https:\/\/arxiv.org\/abs\/2002.02516v5","DOI":"10.1007\/s00145-023-09484-0"},{"key":"5_CR16","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 2023. 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_CR17","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chiesa, A., Lin, W., Mishra, P., Spooner, N.: \u201cProof-Carrying Data Without Succinct Arguments\u201d. 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","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"5_CR18","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Proof-carrying data from accumulation schemes. In: Proceedings of the 18th Theory of Cryptography Conference, TCC 2020 (2020)"},{"key":"5_CR19","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism (2024). https:\/\/eprint.iacr.org\/2024\/474"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557\u2013594 (2004)","DOI":"10.1145\/1008731.1008734"},{"key":"5_CR21","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 2023. 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_CR22","unstructured":"Chen, W., Chiesa, A., Dauterman, E., Ward, N.P.: Reducing participation costs via incremental verification for ledger systems (2020). https:\/\/eprint.iacr.org\/2020\/1522"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Chua, L., Weidner, M.: On cycles of pairing-friendly elliptic curves. SIAM J. Appl. Algebra Geom. 3(2), 175\u2013192 (2019)","DOI":"10.1137\/18M1173708"},{"key":"5_CR24","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 2020. 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_CR25","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: Proceedings of the 1st Symposium on Innovations in Computer Science, ICS 2010, pp. 310\u2013331 (2010)"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Tromer, E., Virza, M.: Cluster computing in zero knowledge. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 371\u2013403. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_13","DOI":"10.1007\/978-3-662-46803-6_13"},{"key":"5_CR27","unstructured":"Chiesa, A., Yogev, E.: Building Cryptographic Proofs from Hash Functions (2024)"},{"key":"5_CR28","unstructured":"Chong, S., Tromer, E., Vaughan, J.A.: Enforcing language semantics using proof-carrying data (2013). http:\/\/eprint.iacr.org\/2013\/513"},{"key":"5_CR29","unstructured":"Dellepere, M., Mishra, P., Shirzad, A.: Garuda and Pari: faster and smaller SNARKs via equifficient polynomial commitments (2024). https:\/\/eprint.iacr.org\/2024\/1245"},{"key":"5_CR30","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields (2023). https:\/\/eprint.iacr.org\/2023\/1784"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the Gilbert-Varshamov bound and their cryptographic applications. In: Proceedings of the 5th Innovations in Theoretical Computer Science Conference, ITCS 2014, pp. 169\u2013182 (2014)","DOI":"10.1145\/2554797.2554815"},{"key":"5_CR32","unstructured":"Eagen, L., Gabizon, A.: ProtoGalaxy: efficient ProtoStar-style folding of multiple instances (2023). https:\/\/eprint.iacr.org\/2023\/1106"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"Fenzi, G., Knabenhans, C., Nguyen, N.K., Pham, D.T.: Lova: lattice-based folding scheme from unstructured lattices. In: Chung, KM., Sasaki, Y. (eds.) ASIACRYPT 2024. LNCS, vol. 15487, pp. 303\u2013326. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_10","DOI":"10.1007\/978-981-96-0894-2_10"},{"key":"5_CR34","unstructured":"Gabizon, A., Williamson, Z.J.: The turbo-plonk program syntax for specifying snark programs. In: ZKProof Workshop 3 (2019)"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (In)security of the Fiat-Shamir paradigm. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, pp. 102\u2013113 (2003)","DOI":"10.1109\/SFCS.2003.1238185"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic SNARKs for R1CS. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14082, pp. 193\u2013226. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"5_CR37","unstructured":"Grassi, L., Khovratovich, D., Rechberger, C., Roy, A., Schofnegger, M.: POSEIDON: a new hash function for zero-knowledge proof systems. In: Proceedings of the 30th USENIX Security Symposium. USENIX Security 2021, pp. 519\u2013535 (2021)"},{"key":"5_CR38","unstructured":"Guillevic, A.: Pairing-friendly curves. https:\/\/members.loria.fr\/AGuillevic\/pairing-friendly-curves\/#mnt-curves"},{"key":"5_CR39","unstructured":"Hab\u00f6ck, U., Levit, D., Papini, S.: Circle STARKs (2024). https:\/\/eprint.iacr.org\/2024\/278"},{"key":"5_CR40","unstructured":"Kattis, A., Bonneau, J.: Proof of NecessaryWork: succinct state verification with fairness guarantees (2020). https:\/\/eprint.iacr.org\/2020\/190"},{"key":"5_CR41","unstructured":"Kohrita, T., Nikolaev, M., Silva, J.: BOIL: proof-carrying data from accumulation of correlated holographic IOPs (2024). https:\/\/eprint.iacr.org\/2024\/1993"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Parno, B.: Algebraic reductions of knowledge. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14084, pp. 669\u2013701. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_21","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"5_CR43","unstructured":"Kothapalli, A., Setty, S.: CycleFold: folding-scheme-based recursive arguments over a cycle of elliptic curves (2023). https:\/\/eprint.iacr.org\/2023\/1192"},{"key":"5_CR44","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 2024. 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"},{"key":"5_CR45","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.T.V., 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","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Naveh, A., Tromer, E.: PhotoProof: cryptographic image authentication for any set of permissible transformations. In: Proceedings of the 37th IEEE Symposium on Security and Privacy, S &P 2016, pp. 255\u2013271 (2016)","DOI":"10.1109\/SP.2016.23"},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Nguyen, W.D., Boneh, D., Setty, S.T.V.: Revisiting the nova proof system on a cycle of curves. In: Proceedings of the 5th Conference on Advances in Financial Technologies, AFT 2023, pp. 18:1\u201318:22 (2023)","DOI":"10.60079\/acsr.v1i1.51"},{"key":"5_CR48","doi-asserted-by":"publisher","unstructured":"Nguyen, W.D., Datta, T., Chen, B., Tyagi, N., Boneh, D.: Mangrove: a scalable framework for folding-based SNARKs. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14929, pp. 308\u2013344. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_10","DOI":"10.1007\/978-3-031-68403-6_10"},{"key":"5_CR49","unstructured":"O(1) Labs: Mina Cryptocurrency (2020). minaprotocol.org"},{"key":"5_CR50","unstructured":"Polygon Zero Team: Plonky2: Fast Recursive Arguments with PLONK and FRI. https:\/\/github.com\/0xPolygonZero\/plonky2\/blob\/main\/plonky2\/plonky2.pdf"},{"key":"5_CR51","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 2016, pp. 49\u201362 (2016)","DOI":"10.1145\/2897518.2897652"},{"key":"5_CR52","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments (2023). https:\/\/eprint.iacr.org\/2023\/552"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Trans. Inf. Theor. 42(6), 1723\u20131731 (1996)","DOI":"10.1109\/18.556668"},{"key":"5_CR54","unstructured":"Szepieniec, A.: DEEP commitments and their applications (2024). https:\/\/eprint.iacr.org\/2024\/1752"},{"key":"5_CR55","unstructured":"Xiong, A.L., et al.: VeriZexe: decentralized private computation with universal setup. In: Proceedings of the 32nd USENIX Security Symposium, USENIX Security 2023, pp. 4445\u20134462 (2023)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:40Z","timestamp":1755383260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}