{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:28:21Z","timestamp":1786753701485,"version":"3.56.0"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031684029","type":"print"},{"value":"9783031684036","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68403-6_5","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T19:02:37Z","timestamp":1723748557000},"page":"138-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from\u00a0Foldable Codes"],"prefix":"10.1007","author":[{"given":"Hadas","family":"Zeilberger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Fisch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. Cryptology ePrint Archive, Report 2019\/426 (2019). https:\/\/eprint.iacr.org\/2019\/426","DOI":"10.46586\/tosc.v2020.i3.1-45"},{"key":"5_CR2","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: Lightweight sublinear arguments without a trusted setup. Cryptology ePrint Archive, Report 2022\/1608 (2022). https:\/\/eprint.iacr.org\/2022\/1608"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Augot, D., Bordage, S., Nardi, J.: Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes. Des. Codes Cryptogr. 91 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01134-z","DOI":"10.1007\/s10623-022-01134-z"},{"key":"5_CR4","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. Electron. Colloquium Comput. Complex. (2017)"},{"key":"5_CR5","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. 107. Schloss Dagstuhl, July 2018, pp. 14:1\u201314:17 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"5_CR6","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive, Report 2018\/046 (2018). https:\/\/eprint.iacr.org\/2018\/046"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Carmon, D., Kopparty, S., Levit, D.: Scalable and transparent proofs over all large fields, via elliptic curves. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022. LNCS, vol. 13747, pp. 467\u2013496. Springer, Cham (2022). ISBN 978-3-031-22317-4. https:\/\/doi.org\/10.1007\/978-3-031-22318-1_17","DOI":"10.1007\/978-3-031-22318-1_17"},{"key":"5_CR8","unstructured":"Ben-Sasson, E., Chiesa, A., Gabizon, A., Riabzev, M., Spooner, N.: Short interactive oracle proofs with constant query complexity, via composition and sumcheck. Cryptology ePrint Archive, Report 2016\/324. https:\/\/eprint.iacr.org\/2016\/324 (2016)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Spooner, N.: Interactive oracle proofs. In: Theory of Cryptography Conference (2016). https:\/\/api.semanticscholar.org\/CorpusID:8363041","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"5_CR10","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 - TCC 2016","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":"5_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Goldberg, L., Kopparty, S., Saraf, S.: DEEP-FRI: sampling outside the box improves soundness. In: Vidick, T. (ed.) ITCS 2020, vol. 151, pp. 5:1\u20135:32. LIPIcs (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.5","DOI":"10.4230\/LIPIcs.ITCS.2020.5"},{"key":"5_CR12","unstructured":"Ben-Sasson, E., Kopparty, S., Saraf, S.: Worst-case to average case reductions for the distance to a code. In: Proceedings of the 33rd Computational Complexity Conference. CCC \u201918. San Diego, California: Schloss Dagstuhl\u2013Leibniz\u2013Zentrum fuer Informatik (2018). ISBN 9783959770699"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Block, A.R., Garreta, A., Katz, J., Thaler, J., Tiwari, P.R., Zajac, M.: Fiat-Shamir security of FRI and related SNARKs. Cryptology ePrint Archive, Paper 2023\/1071 (2023). https:\/\/eprint.iacr.org\/2023\/1071","DOI":"10.1007\/978-981-99-8724-5_1"},{"key":"5_CR14","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 - TCC 2020","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":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-031-07085-3_15","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"J Bootle","year":"2022","unstructured":"Bootle, J., Chiesa, A., Hu, Y., Orr\u00fa, M.: Gemini: elastic SNARKs for diverse environments. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 427\u2013457. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_15"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Bordage, S., Lhotel, M., Nardi, J., Randriam, H.: Interactive oracle proofs of proximity to algebraic geometry codes. In: Lovett, S. (ed.) 37th Computational Complexity Conference. CCC 2022, 20\u201323 July 2022, Philadelphia, PA, USA, vol. 234, pp. 30:1\u201330:45. LIPIcs (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2022.30","DOI":"10.4230\/LIPIcs.CCC.2022.30"},{"key":"5_CR17","unstructured":"B\u00fcnz, B., Fisch, B.: Schwartz-Zippel for multilinear polynomials mod N. Cryptology ePrint Archive, Report 2022\/458 (2022). https:\/\/eprint.iacr.org\/2022\/458"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-030-45721-1_24","volume-title":"Advances in Cryptology - EUROCRYPT 2020","author":"B B\u00fcnz","year":"2020","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 677\u2013706. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24"},{"key":"5_CR19","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: HyperPlonk: plonk with linear-time prover and high-degree custom gates. Cryptology ePrint Archive, Report 2022\/1355 (2022). https:\/\/eprint.iacr.org\/2022\/1355"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/978-3-031-30617-4_17","volume-title":"Advances in Cryptology - EUROCRYPT 2023","author":"B Chen","year":"2023","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"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science()","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Choc, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th FOCS, October 1985, pp. 383\u2013395. IEEE Computer Society Press (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.64","DOI":"10.1109\/SFCS.1985.64"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Diamond, B.E., Posen, J.: Proximity testing with logarithmic randomness. Cryptology ePrint Archive, Paper 2023\/630 (2023). https:\/\/eprint.iacr.org\/2023\/630","DOI":"10.62056\/aksdkp10"},{"key":"5_CR24","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_CR25","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM 62(4) (2015). ISSN 0004-5411. https:\/\/doi.org\/10.1145\/2699436","DOI":"10.1145\/2699436"},{"key":"5_CR26","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: linear-time and post-quantum SNARKs for R1CS. Cryptology ePrint Archive, Report 2021\/1043 (2021). https:\/\/eprint.iacr.org\/2021\/1043"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Jin, L., Xing, C.: Efficiently list- decodable punctured reed-muller codes. IEEE Trans. Inf. Theory 63, 4317\u20134324 (2015). https:\/\/api.semanticscholar.org\/CorpusID:14176561","DOI":"10.1109\/TIT.2017.2692212"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Mosheiff, J.: Punctured low-bias codes behave like random linear codes (2022). arXiv: 2109.11725 [cs.CC]","DOI":"10.1109\/FOCS54457.2022.00011"},{"key":"5_CR29","unstructured":"Hall-Andersen, M., Simkin, M., Wagner, B.: Foundations of data availability sampling. Cryptology ePrint Archive, Paper 2023\/1079 (2023). https:\/\/eprint.iacr.org\/2023\/1079"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Juels, A., Kaliski Jr., B.S.: Pors: proofs of retrievability for large files. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds). ACM CCS 2007, pp. 584\u2013597. ACM Press (2007). https:\/\/doi.org\/10.1145\/1315245.1315317","DOI":"10.1145\/1315245.1315317"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-17373-8_11","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCSd, vol. 6477, pp. 177\u2013194. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_11"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Kattis, A.A., Panarin, K., Vlasov, A.: Red- shift: 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_CR33","doi-asserted-by":"crossref","unstructured":"Kohrita, T., Towa, P.: Zeromorph: Zero-knowledge multilinear- evaluation proofs from homomorphic univariate commitments. Cryptology ePrint Archive 2023, p. 917 (2023)","DOI":"10.1007\/s00145-024-09519-0"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Kosba, A.E., Papamanthou, C., Shi, E.: xJsnark: A framework for efficient verifiable computation. In: 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, May 2018, pp. 944\u2013961. https:\/\/doi.org\/10.1109\/SP.2018.00018","DOI":"10.1109\/SP.2018.00018"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM (JACM) 39(4), 859\u2013868 (1992)","DOI":"10.1145\/146585.146605"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39 (1999). https:\/\/doi.org\/10.1145\/146585.146605","DOI":"10.1145\/146585.146605"},{"key":"5_CR37","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. Cryptology ePrint Archive, Report 2011\/587. https:\/\/eprint.iacr.org\/2011\/587 (2011)"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-36594-2_13","volume-title":"Theory of Cryptography - TCC 2013","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 222\u2013242. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_13"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constantround interactive proofs for delegating computation. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 49\u201362. ACM Press (2016). https:\/\/doi.org\/10.1145\/2897518.2897652","DOI":"10.1145\/2897518.2897652"},{"key":"5_CR40","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. Cryptology ePrint Archive, Report 2019\/550 (2019). https:\/\/eprint.iacr.org\/2019\/550"},{"key":"5_CR41","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":"5_CR42","unstructured":"Yi, S., Tony, L., Wen-Ding, L., Gubsheep: zk-ECDSA: zkSNARKs for ECDSA (Part 1). https:\/\/0xparc.org\/blog\/zk-ecdsa-1"},{"key":"5_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-031-15985-5_11","volume-title":"Advances in Cryptology - CRYPTO 2022","author":"T Xie","year":"2022","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: zero knowledge proof with linear prover time. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13510, pp. 299\u2013328. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11"},{"key":"5_CR44","unstructured":"Xiong, A.L., et al.: VERI-ZEXE: decentralized private computation with universal setup. Cryptology ePrint Archive, Report 2022\/802 (2022). https:\/\/eprint.iacr.org\/2022\/802"},{"key":"5_CR45","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field- agnostic polynomial commitment schemes from foldable codes. Cryptology ePrint Archive, Paper 2023\/1705 (2023). https:\/\/eprint.iacr.org\/2023\/1705"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68403-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:02:05Z","timestamp":1786752125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68403-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031684029","9783031684036"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68403-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}