{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T21:23:58Z","timestamp":1751923438992,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609345"},{"type":"electronic","value":"9789819609352"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-981-96-0935-2_13","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:27Z","timestamp":1733680887000},"page":"402-435","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["FLI: Folding Lookup Instances"],"prefix":"10.1007","author":[{"given":"Albert","family":"Garreta","sequence":"first","affiliation":[]},{"given":"Ignacio","family":"Manzur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Arun, A., Setty, S., Thaler, J.: Jolt: Snarks for virtual machines via lookups. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. pp. 3\u201333. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58751-1_1","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Arun, A., Zhu, M.: Jolt: Snarks for virtual machines via lookups. ZK Proof Standards (2024), https:\/\/www.youtube.com\/live\/RySXjCsLgXk","DOI":"10.1007\/978-3-031-58751-1_1"},{"key":"13_CR3","unstructured":"barryWhiteHat: Lookup singularity. ZKResearch (2022), https:\/\/zkresear.ch\/t\/lookup-singularity\/65"},{"key":"13_CR4","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":"13_CR5","doi-asserted-by":"publisher","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 II. p. 77-110. Springer-Verlag, Berlin, Heidelberg (2023).https:\/\/doi.org\/10.1007\/978-981-99-8724-5_3","DOI":"10.1007\/978-981-99-8724-5_3"},{"key":"13_CR6","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.) Advances in Cryptology \u2013 CRYPTO 2021. pp. 681\u2013710. Springer International Publishing, Cham (2021).https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"13_CR7","unstructured":"B\u00fcnz, B., Chen, J.: Proofs for deep thought: Accumulation for large memories and deterministic computations. Cryptology ePrint Archive, Paper 2024\/325 (2024), https:\/\/eprint.iacr.org\/2024\/325"},{"key":"13_CR8","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Proof-carrying data from accumulation schemes. Cryptology ePrint Archive, Paper 2020\/499 (2020), https:\/\/eprint.iacr.org\/2020\/499"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Gailly, N., Gennaro, R., Jovanovic, P., Mihali, M., Thaler, J.: Testudo: Linear time prover snarks with constant size proofs and square root size universal setup. In: Aly, A., Tibouchi, M. (eds.) Progress in Cryptology \u2013 LATINCRYPT 2023. pp. 331\u2013351. Springer Nature Switzerland, Cham (2023).https:\/\/doi.org\/10.1007\/978-3-031-44469-2_17","DOI":"10.1007\/978-3-031-44469-2_17"},{"key":"13_CR10","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: ICS. pp. 310\u2013331. Tsinghua University Press (2010)"},{"key":"13_CR11","unstructured":"Dao, Q., Thaler, J.: More optimizations to sum-check proving. Cryptology ePrint Archive, Paper 2024\/1210 (2024), https:\/\/eprint.iacr.org\/2024\/1210"},{"key":"13_CR12","unstructured":"Diamond, B.E., Posen, J.: Succinct arguments over towers of binary fields. Cryptology ePrint Archive, Paper 2023\/1784 (2023), https:\/\/eprint.iacr.org\/2023\/1784"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Diamond, B.E., Posen, J.: Proximity testing with logarithmic randomness. IACR Communications in Cryptology 1(1) (2024).https:\/\/doi.org\/10.62056\/aksdkp10","DOI":"10.62056\/aksdkp10"},{"key":"13_CR14","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: Cached quotients for fast lookups. Cryptology ePrint Archive, Paper 2022\/1763 (2022), https:\/\/eprint.iacr.org\/2022\/1763"},{"key":"13_CR15","unstructured":"Eagen, L., Gabizon, A.: Protogalaxy: Efficient protostar-style folding of multiple instances. Cryptology ePrint Archive, Paper 2023\/1106 (2023), https:\/\/eprint.iacr.org\/2023\/1106"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Advances in Cryptology - CRYPTO 1986, Santa Barbara, California, USA, 1986, Proceedings. Lecture Notes in Computer Science, vol.\u00a0263, pp. 186\u2013194. Springer (1986). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"13_CR17","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Paper 2022\/1530 (2022), https:\/\/eprint.iacr.org\/2022\/1530"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing. p. 723-732. STOC \u201992, Association for Computing Machinery, New York, NY, USA (1992).https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Kohrita, T., Towa, P.: Zeromorph: Zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments. Cryptology ePrint Archive, Paper 2023\/917 (2023), https:\/\/eprint.iacr.org\/2023\/917","DOI":"10.1007\/s00145-024-09519-0"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Kothapalli, A., Setty, S.: Hypernova: Recursive arguments for customizable constraint systems. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024. pp. 345\u2013379. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_11","DOI":"10.1007\/978-3-031-68403-6_11"},{"key":"13_CR21","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.) Advances in Cryptology \u2013 CRYPTO 2022. pp. 359\u2013388. Springer Nature Switzerland, Cham (2022).https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Micali, S.: Cs proofs. In: Proceedings 35th Annual Symposium on Foundations of Computer Science. pp. 436\u2013453 (1994).https:\/\/doi.org\/10.1109\/SFCS.1994.365746","DOI":"10.1109\/SFCS.1994.365746"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Papamanthou, C., Shi, E., Tamassia, R.: Signatures of correct computation. In: Sahai, A. (ed.) Theory of Cryptography. pp. 222\u2013242. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_13","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"13_CR24","unstructured":"Papini, S., Hab\u00f6ck, U.: Improving logarithmic derivative lookups using gkr. Cryptology ePrint Archive, Paper 2023\/1284 (2023), https:\/\/eprint.iacr.org\/2023\/1284"},{"key":"13_CR25","unstructured":"Setty, S.: Hyperkzg (2024), https:\/\/github.com\/microsoft\/Nova\/blob\/main\/src\/provider\/hyperkzg.rs"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with lasso. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024. pp. 180\u2013209. Springer Nature Switzerland, Cham (2024).https:\/\/doi.org\/10.1007\/978-3-031-58751-1_7","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"13_CR27","unstructured":"Thaler, J.: Faq on jolt\u2019s initial implementation (2024), https:\/\/a16zcrypto.com\/posts\/article\/faqs-on-jolts-initial-implementation\/"},{"key":"13_CR28","doi-asserted-by":"publisher","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) Theory of Cryptography. pp. 1\u201318. Springer Berlin Heidelberg, Berlin, Heidelberg (2008).https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Zapico, A., Buterin, V., Khovratovich, D., Maller, M., Nitulescu, A., Simkin, M.: Caulk: Lookup arguments in sublinear time. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. p. 3121-3134. CCS \u201922, Association for Computing Machinery, New York, NY, USA (2022).https:\/\/doi.org\/10.1145\/3548606.3560646","DOI":"10.1145\/3548606.3560646"},{"key":"13_CR30","unstructured":"Zapico, A., Gabizon, A., Khovratovich, D., Maller, M., R\u00e0fols, C.: Baloo: Nearly optimal lookup arguments. Cryptology ePrint Archive, Paper 2022\/1565 (2022), https:\/\/eprint.iacr.org\/2022\/1565"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0935-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:02:51Z","timestamp":1733680971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","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":"Kolkata","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}