{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:16:34Z","timestamp":1755839794893,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":32,"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_9","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:21Z","timestamp":1733680881000},"page":"269-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Proofs for\u00a0Deep Thought: Accumulation for\u00a0Large Memories and\u00a0Deterministic Computations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2082-4480","authenticated-orcid":false,"given":"Benedikt","family":"B\u00fcnz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1289-9626","authenticated-orcid":false,"given":"Jessica","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Thomas Attema, Serge Fehr, and Michael Kloo\u00df. \u201cFiat-Shamir Transformation of Multi-round Interactive Proofs\u201d. In: TCC 2022, Part I. Ed. by Eike Kiltz and Vinod Vaikuntanathan. Vol. 13747. LNCS. Springer, Heidelberg, Nov. 2022, pp. 113\u2013142. doi: https:\/\/doi.org\/10.1007\/978-3-031-22318-1_5.","DOI":"10.1007\/978-3-031-22318-1_5"},{"key":"9_CR2","unstructured":"Kasra Abbaszadeh, Christodoulos Pappas, Dimitrios Papadopoulos, and Jonathan Katz. Zero-Knowledge Proofs of Training for Deep Neural Networks. Cryptology ePrint Archive, Paper 2024\/162. https:\/\/eprint.iacr.org\/2024\/162.2024. url: https:\/\/eprint.iacr.org\/2024\/162."},{"key":"9_CR3","unstructured":"Arasu Arun, Srinath Setty, and Justin Thaler. Jolt: SNARKs for Virtual Machines via Lookups. Cryptology ePrint Archive, Paper 2023\/1217. https:\/\/eprint.iacr.org\/2023\/1217. 2023. url: https:\/\/eprint.iacr.org\/2023\/1217."},{"key":"9_CR4","unstructured":"Benedikt B\u00fcnz and Binyi Chen. ProtoStar: Generic Efficient Accumulation\/Folding for Special Sound Protocols. Cryptology ePrint Archive, Paper 2023\/620. https:\/\/eprint.iacr.org\/2023\/620. 2023. url: https:\/\/eprint.iacr.org\/2023\/620."},{"key":"9_CR5","unstructured":"Benedikt B\u00fcnz and Jessica Chen. Proofs for Deep Thought: Accumulation for large memories and deterministic computations. Cryptology ePrint Archive, Paper 2024\/325. 2024. url: https:\/\/eprint.iacr.org\/2024\/325."},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Nir Bitansky, Ran Canetti, Alessandro Chiesa, and Eran Tromer. \u201cRecursive composition and bootstrapping for SNARKS and proof-carrying data\u201d. In: 45th ACM STOC. Ed. by Dan Boneh, Tim Roughgarden, and Joan Feigenbaum. ACM Press, June 2013, pp. 111\u2013120. doi: https:\/\/doi.org\/10.1145\/2488608.2488623.","DOI":"10.1145\/2488608.2488623"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Benedikt B\u00fcnz, Alessandro Chiesa, William Lin, Pratyush Mishra, and Nicholas Spooner. \u201cProof-Carrying Data Without Succinct Arguments\u201d. In: CRYPTO 2021, Part I. Ed. by Tal Malkin and Chris Peikert. Vol. 12825. LNCS. Virtual Event: Springer, Heidelberg, Aug. 2021, pp. 681\u2013710. doi: https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24.","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Benedikt B\u00fcnz, Alessandro Chiesa, Pratyush Mishra, and Nicholas Spooner. \u201cRecursive Proof Composition from Accumulation Schemes\u201d. In: TCC 2020, Part II. Ed. by Rafael Pass and Krzysztof Pietrzak. Vol. 12551. LNCS. Springer, Heidelberg, Nov. 2020, pp. 1\u201318. doi: https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1.","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. \u201cScalable Zero Knowledge via Cycles of Elliptic Curves\u201d. In: CRYPTO 2014, Part II. Ed. by Juan A. Garay and Rosario Gennaro. Vol. 8617. LNCS. Springer, Heidelberg, Aug. 2014, pp. 276\u2013294. doi: https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16.","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Dan Boneh, Justin Drake, Ben Fisch, and Ariel Gabizon. \u201cHalo Infinite: Proof-Carrying Data from Additive Polynomial Commitments\u201d. In: CRYPTO 2021, Part I. Ed. by Tal Malkin and Chris Peikert. Vol. 12825. LNCS. Virtual Event: Springer, Heidelberg, Aug. 2021, pp. 649-680. doi: https:\/\/doi.org\/10.1007\/978-3-030-84242-0_23.","DOI":"10.1007\/978-3-030-84242-0_23"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, and Moni Naor. \u201cChecking the Correctness of Memories\u201d. In: 32nd FOCS. IEEE Computer Society Press, Oct. 1991, pp. 90\u201399. doi: https:\/\/doi.org\/10.1109\/SFCS.1991.185352.","DOI":"10.1109\/SFCS.1991.185352"},{"key":"9_CR12","unstructured":"Benjamin Braun, Ariel J. Feldman, Zuocheng Ren, Srinath Setty, Andrew J. Blumberg, and Michael Walfish. Verifying Computations with State (Extended Version). Cryptology ePrint Archive, Report 2013\/356. https:\/\/eprint.iacr.org\/2013\/356. 2013."},{"key":"9_CR13","unstructured":"Sean Bowe, Jack Grigg, and Daira Hopwood. Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive, Report 2019\/1021. https:\/\/eprint.iacr.org\/2019\/1021. 2019."},{"key":"9_CR14","unstructured":"Binyi Chen, Benedikt B\u00fcnz, Dan Boneh, and Zhenfei Zhang. HyperPlonk: Plonk with Linear-Time Prover and High-Degree Custom Gates. Cryptology ePrint Archive, Report 2022\/1355. https:\/\/eprint.iacr.org\/2022\/1355. 2022."},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Dwaine E. Clarke, Srinivas Devadas, Marten van Dijk, Blaise Gassend, and G. Edward Suh. \u201cIncremental Multiset Hash Functions and Their Application to Memory Integrity Checking\u201d. In: ASIACRYPT 2003. Ed. by Chi-Sung Laih. Vol. 2894. LNCS. Springer, Heidelberg, 2003, pp. 188\u2013207. doi: https:\/\/doi.org\/10.1007\/978-3-540-40061-5_12.","DOI":"10.1007\/978-3-540-40061-5_12"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Graham Cormode, Michael Mitzenmacher, and Justin Thaler. \u201cPractical verified computation with streaming interactive proofs\u201d. In: ITCS 2012. Ed. by Shafi Goldwasser. ACM, Jan. 2012, pp. 90\u2013112. doi: https:\/\/doi.org\/10.1145\/2090236.2090245.","DOI":"10.1145\/2090236.2090245"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Alessandro Chiesa, Dev Ojha, and Nicholas Spooner. \u201cFractal: Post-quantum and Transparent Recursive Proofs from Holography\u201d. In: EUROCRYPT 2020, Part I. Ed. by Anne Canteaut and Yuval Ishai. Vol. 12105. LNCS. Springer, Heidelberg, May 2020, pp. 769\u2013793. doi: https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27.","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Cynthia Dwork, Moni Naor, Guy N. Rothblum, and Vinod Vaikuntanathan. \u201cHow Efficient Can Memory Checking Be?\u201d In: TCC 2009. Ed. by Omer Reingold. Vol. 5444. LNCS. Springer, Heidelberg, Mar. 2009, pp. 503\u2013520. doi: https:\/\/doi.org\/10.1007\/978-3-642-00457-5_30.","DOI":"10.1007\/978-3-642-00457-5_30"},{"key":"9_CR19","unstructured":"Liam Eagen, Dario Fiore, and Ariel Gabizon. cq: Cached quotients for fast lookups. Cryptology ePrint Archive, Report 2022\/1763. https:\/\/eprint.iacr.org\/2022\/1763. 2022."},{"key":"9_CR20","unstructured":"Liam Eagen and Ariel Gabizon. ProtoGalaxy: Efficient ProtoStarstyle folding of multiple instances. Cryptology ePrint Archive, Paper 2023\/1106. https:\/\/eprint.iacr.org\/2023\/1106. 2023. url: https:\/\/eprint.iacr.org\/2023\/1106."},{"key":"9_CR21","unstructured":"Ariel Gabizon and Dmitry Khovratovich. flookup: Fractional decompositionbased lookups in quasi-linear time independent of table size. Cryptology ePrint Archive, Report 2022\/1447. https:\/\/eprint.iacr.org\/2022\/1447. 2022."},{"key":"9_CR22","unstructured":"Ulrich Hab\u00f6ck. Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Report 2022\/1530. https:\/\/eprint.iacr.org\/2022\/1530. 2022."},{"key":"9_CR23","unstructured":"Abhiram Kothapalli and Srinath Setty. HyperNova: Recursive arguments for customizable constraint systems. Cryptology ePrint Archive, Paper 2023\/573. https:\/\/eprint.iacr.org\/2023\/573. 2023. url: https:\/\/eprint.iacr.org\/2023\/573."},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Abhiram Kothapalli, Srinath Setty, and Ioanna Tzialla. \u201cNova: Recursive Zero-Knowledge Arguments from Folding Schemes\u201d. In: CRYPTO 2022, Part IV. Ed. by Yevgeniy Dodis and Thomas Shrimpton. Vol. 13510. LNCS. Springer, Heidelberg, Aug. 2022, pp. 359\u2013388. doi: https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13.","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"9_CR25","unstructured":"Shahar Papini and Ulrich Hab\u00f6ck. Improving logarithmic derivative lookups using GKR. Cryptology ePrint Archive, Paper 2023\/1284. https:\/\/eprint.iacr.org\/2023\/1284. 2023. url: https:\/\/eprint.iacr.org\/2023\/1284."},{"key":"9_CR26","unstructured":"Jim Posen and Assimakis A. Kattis. Caulk+: Table-independent lookup arguments. Cryptology ePrint Archive, Report 2022\/957. https:\/\/eprint.iacr.org\/2022\/957. 2022."},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Joost Renes, Craig Costello, and Lejla Batina. \u201cComplete Addition Formulas for Prime Order Elliptic Curves\u201d. In: EUROCRYPT 2016, Part I. Ed. by Marc Fischlin and Jean-S\u00e9bastien Coron. Vol. 9665. LNCS. Springer, Heidelberg, May 2016, pp. 403\u2013428. doi: https:\/\/doi.org\/10.1007\/978-3-662-49890-3_16.","DOI":"10.1007\/978-3-662-49890-3_16"},{"key":"9_CR28","unstructured":"Srinath Setty, Sebastian Angel, Trinabh Gupta, and Jonathan Lee. Proving the correct execution of concurrent services in zeroknowledge. Cryptology ePrint Archive, Report 2018\/907. https:\/\/eprint.iacr.org\/2018\/907. 2018."},{"key":"9_CR29","unstructured":"Srinath Setty, Justin Thaler, and Riad Wahby. Unlocking the lookup singularity with Lasso. Cryptology ePrint Archive, Paper 2023\/1216. https:\/\/eprint.iacr.org\/2023\/1216. 2023. url: https:\/\/eprint.iacr.org\/2023\/1216."},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Paul Valiant. \u201cIncrementally Verifiable Computation or Proofs of Knowledge Imply Time\/Space Efficiency\u201d. In: TCC 2008. Ed. by Ran Canetti. Vol. 4948. LNCS. Springer, Heidelberg, Mar. 2008, pp. 1\u201318. doi: https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1.","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Arantxa Zapico, Vitalik Buterin, Dmitry Khovratovich, Mary Maller, Anca Nitulescu, and Mark Simkin. \u201cCaulk: Lookup Arguments in Sublinear Time\u201d. In: ACM CCS 2022. Ed. by Heng Yin, Angelos Stavrou, Cas Cremers, and Elaine Shi. ACM Press, Nov. 2022, pp. 3121\u20133134. doi: https:\/\/doi.org\/10.1145\/3548606.3560646.","DOI":"10.1145\/3548606.3560646"},{"key":"9_CR32","unstructured":"Arantxa Zapico, Ariel Gabizon, Dmitry Khovratovich, Mary Maller, and Carla R\u00e0fols. Baloo: Nearly Optimal Lookup Arguments. Cryptology ePrint Archive, Report 2022\/1565. https:\/\/eprint.iacr.org\/2022\/1565. 2022."}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:02:23Z","timestamp":1733680943000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_9","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"}}]}}