{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:09:41Z","timestamp":1778249381986,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253354","type":"print"},{"value":"9783032253361","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-25336-1_12","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:10:40Z","timestamp":1778245840000},"page":"329-358","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic zk-SNARKs (with Applications to\u00a0Sparse zk-SNARKs and\u00a0IVC)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3280-706X","authenticated-orcid":false,"given":"Weijie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1905-9403","authenticated-orcid":false,"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3939-3465","authenticated-orcid":false,"given":"Shravan","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2621-3015","authenticated-orcid":false,"given":"Dimitrios","family":"Papadopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ananth, P., Deshpande, A., Kalai, Y.T., Lysyanskaya, A.: Fully homomorphic NIZK and NIWI proofs. In: Theory of Cryptography (2019)","DOI":"10.1007\/978-3-030-36033-7_14"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micciancio, D.: A new paradigm for collision-free hashing: Incrementality at reduced cost. In: Advances in Cryptology - EUROCRYPT \u201997, International Conference on the Theory and Application of Cryptographic Techniques (1997)","DOI":"10.1007\/3-540-69053-0_13"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-030-17653-2_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Chiesa, A., Riabzev, M., Spooner, N., Virza, M., Ward, N.P.: Aurora: transparent succinct arguments for R1CS. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 103\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4"},{"key":"12_CR4","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 Forty-fifth Annual ACM Symposium on Theory of Computing. STOC\u201913 (2013)","DOI":"10.1145\/2488608.2488623"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for inner pairing products and applications. In: Advances in Cryptology \u2013 ASIACRYPT 2021 (2021)","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy (SP) (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Han, S., Kim, J., Kolonelos, D., Oh, H.: Succinct zero-knowledge batch proofs for set accumulators. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022 (2022)","DOI":"10.1145\/3548606.3560677"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Nitulescu, A., R\u00e0fols, C., Zacharakis, A., Zapico, A.: Linear-map vector commitments and their practical applications. In: Advances in Cryptology - ASIACRYPT 2022 (2022)","DOI":"10.1007\/978-3-031-22972-5_7"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-36362-7_5","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"D Catalano","year":"2013","unstructured":"Catalano, D., Fiore, D.: Vector commitments and their applications. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 55\u201372. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_5"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R.: Locally updatable and locally decodable codes. In: Theory of Cryptography (2014)","DOI":"10.1007\/978-3-642-54242-8_21"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-29011-4_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Chase","year":"2012","unstructured":"Chase, M., Kohlweiss, M., Lysyanskaya, A., Meiklejohn, S.: Malleable proof systems and applications. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 281\u2013300. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_18"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Chen, B., B\u00fcnz, B., Boneh, D., Zhang, Z.: Hyperplonk: Plonk with linear-time prover and high-degree custom gates. In: Advances in Cryptology \u2013 EUROCRYPT 2023 (2023)","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Chen, M., Chiesa, A., Gur, T., O\u2019Connor, J., Spooner, N.: Proof-carrying data from arithmetized random oracles. In: Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques,. EUROCRYPT\u201923 (2023)","DOI":"10.1007\/978-3-031-30617-4_13"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Guan, Z., Samocha, S., Yogev, E.: Security bounds for proof-carrying data from straightline extractors. In: Theory of Cryptography (2024)","DOI":"10.1007\/978-3-031-78017-2_16"},{"key":"12_CR15","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, Paper 2019\/953 (2019)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"von\u00a0zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, 3 edn. (2013)","DOI":"10.1017\/CBO9781139856065"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing (1985)","DOI":"10.1145\/22145.22178"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-Size Commitments to Polynomials and Their Applications. In: ASIACRYPT\u201910 (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"12_CR20","unstructured":"Lagrange Labs: Lagrange prover network. https:\/\/app.lagrange.dev\/zk-coprocessor\/explore\/dashboard"},{"key":"12_CR21","unstructured":"Lee, H., Seo, J.H.: On the security of nova recursive proof system. Cryptology ePrint Archive, Paper 2024\/232 (2024)"},{"key":"12_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90159-7","volume-title":"Complexity Models for Incremental Computation","author":"PB Miltersen","year":"1994","unstructured":"Miltersen, P.B., Subramanian, S., Vitter, J.S., Tamassia, R.: Complexity Models for Incremental Computation. Theor. Comput, Sci (1994)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen, W., Datta, T., Chen, B., Tyagi, N., Boneh, D.: Mangrove: A scalable framework for folding-based snarks. In: Advances in Cryptology \u2013 CRYPTO 2024 (2024)","DOI":"10.1007\/978-3-031-68403-6_10"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R.: Efficient computation on oblivious rams. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing. STOC \u201990 (1990)","DOI":"10.1145\/100216.100289"},{"key":"12_CR25","unstructured":"Ostrovsky, R.: An efficient software protection scheme. In: Advances in Cryptology - CRYPTO \u201989, 9th Annual International Cryptology Conference. Lecture Notes in Computer Science (1989)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Papamanthou, C., et al.: Reckle Trees: updatable merkle batch proofs with applications. In: Proceedings of the 2024 ACM SIGSAC Conference on Computer and Communications Security (2024)","DOI":"10.1145\/3658644.3670354"},{"key":"12_CR27","unstructured":"Polygon Zero Team: Plonky 2: Improved Plonk with Fast Verification and Universal SRS (2022). https:\/\/github.com\/mir-protocol\/plonky2\/blob\/main\/plonky2\/plonky2.pdf"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Sefranek, M.: How (not) to simulate PLONK. Cryptology ePrint Archive, Paper 2024\/848 (2024)","DOI":"10.1007\/978-3-031-71070-4_5"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Ristenpart, T. (eds.): CRYPTO 2020. LNCS, vol. 12170. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2","DOI":"10.1007\/978-3-030-56784-2"},{"key":"12_CR30","unstructured":"Setty, S., Thaler, J.: Twist and Shout: Faster memory checking arguments via one-hot addressing and increments. Cryptology ePrint Archive, Paper 2025\/105 (2025)"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the Lookup Singularity with Lasso. In: Advances in Cryptology \u2013 EUROCRYPT 2024 (2024)","DOI":"10.1007\/978-3-031-58751-1_7"},{"key":"12_CR32","unstructured":"Srinivasan, S., Chepurnoy, A., Papamanthou, C., Tomescu, A., Zhang, Y.: Hyperproofs: aggregating and maintaining proofs in vector commitments. In: 31st USENIX Security Symposium (USENIX Security 22) (2022)"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Tamassia, R.: Authenticated data structures. In: Algorithms - ESA 2003 (2003)","DOI":"10.1007\/978-3-540-39658-1_2"},{"key":"12_CR34","unstructured":"Tomescu, A.: How to keep a secret and share a public key (using polynomial commitments). Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, USA (2020)"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Fisch, B., Zitek, A., Bonneau, J., Tessaro, S.: Versa: verifiable registries with efficient client audits from RSA authenticated dictionaries. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201922 (2022)","DOI":"10.1145\/3548606.3560605"},{"key":"12_CR36","unstructured":"Wang, W., Papamanthou, C., Srinivasan, S., Papadopoulos, D.: Dynamic zkSNARKs (with applications to sparse ZK-SNARKs and IVC). Cryptology ePrint Archive, Paper 2024\/1566 (2024). https:\/\/eprint.iacr.org\/2024\/1566"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: Zero knowledge proof with linear prover time. In: Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022 (2022)","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"12_CR38","unstructured":"Zhang, T., Ouyang, Y., Zhang, Y.: Dynark: Making groth16 dynamic. Cryptology ePrint Archive, Paper 2025\/1897 (2025)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:10:57Z","timestamp":1778245857000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","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":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}