{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:28:29Z","timestamp":1786753709811,"version":"3.56.0"},"publisher-location":"Cham","reference-count":60,"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_10","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T19:02:37Z","timestamp":1723748557000},"page":"308-344","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Mangrove: A Scalable Framework for\u00a0Folding-Based SNARKs"],"prefix":"10.1007","author":[{"given":"Wilson","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Trisha","family":"Datta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Binyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nirvan","family":"Tyagi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Boneh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: Lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 2087\u20132104. ACM Press, Dallas, TX, USA (2017). https:\/\/doi.org\/10.1145\/3133956.3134104","DOI":"10.1145\/3133956.3134104"},{"key":"10_CR2","unstructured":"Arun, A., Setty, S., Thaler, J.: Jolt: SNARKs for virtual machines via lookups. Cryptology ePrint Archive, Paper 2023\/1217 (2023). https:\/\/eprint.iacr.org\/2023\/1217"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Attema, T., Fehr, S., Kloo\u00df, M.: Fiat-shamir transformation of multi-round interactive proofs. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC\u00a02022: 20th Theory of Cryptography Conference, Part\u00a0I. Lecture Notes in Computer Science, vol. 13747, pp. 113\u2013142. Springer, Heidelberg, Germany, Chicago, IL, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_5","DOI":"10.1007\/978-3-031-22318-1_5"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Bayer, S., Groth, J.: Efficient zero-knowledge argument for correctness of a shuffle. In: Pointcheval, D., Johansson, T. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02012. Lecture Notes in Computer Science, vol.\u00a07237, pp. 263\u2013280. Springer, Heidelberg, Germany, Cambridge, UK (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_17","DOI":"10.1007\/978-3-642-29011-4_17"},{"key":"10_CR5","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":"10_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: Verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02013, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a08043, pp. 90\u2013108. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"10_CR7","doi-asserted-by":"publisher","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.) Advances in Cryptology \u2013 EUROCRYPT\u00a02019, Part\u00a0I. Lecture Notes in Computer Science, vol. 11476, pp. 103\u2013128. Springer, Heidelberg, Germany, Darmstadt, Germany (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_4","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"10_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.) Advances in Cryptology \u2013 CRYPTO\u00a02014, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a08617, pp. 276\u2013294. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_16","DOI":"10.1007\/978-3-662-44381-1_16"},{"key":"10_CR9","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von neumann architecture. In: Fu, K., Jung, J. (eds.) USENIX Security 2014: 23rd USENIX Security Symposium, pp. 781\u2013796. USENIX Association, San Diego, CA, USA (2014)"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Goldwasser, S. (ed.) ITCS 2012: 3rd Innovations in Theoretical Computer Science. pp. 326\u2013349. Association for Computing Machinery, Cambridge, MA, USA (2012). https:\/\/doi.org\/10.1145\/2090236.2090263","DOI":"10.1145\/2090236.2090263"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: Recursive composition and bootstrapping for SNARKS and proof-carrying data. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th Annual ACM Symposium on Theory of Computing. pp. 111\u2013120. ACM Press, Palo Alto, CA, USA (2013). https:\/\/doi.org\/10.1145\/2488608.2488623","DOI":"10.1145\/2488608.2488623"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Public-coin zero-knowledge arguments with (almost) minimal time and space overheads. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020: 18th Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 12551, pp. 168\u2013197. Springer, Heidelberg, Germany, Durham, NC, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_7","DOI":"10.1007\/978-3-030-64378-2_7"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Block, A.R., Holmgren, J., Rosen, A., Rothblum, R.D., Soni, P.: Time- and space-efficient arguments from groups of unknown order. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0IV. Lecture Notes in Computer Science, vol. 12828, pp. 123\u2013152. Springer, Heidelberg, Germany, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_5","DOI":"10.1007\/978-3-030-84259-8_5"},{"key":"10_CR14","unstructured":"Boneh, D., Chen, B.: LatticeFold: a lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive, Paper 2024\/257 (2024). https:\/\/eprint.iacr.org\/2024\/257"},{"key":"10_CR15","unstructured":"Bootle: efficient multi-exponentiation. https:\/\/jbootle.github.io\/Misc\/pippenger.pdf"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Bootle, J., Chiesa, A., Hu, Y., Orr\u00f9, M.: Gemini: elastic SNARKs for diverse environments. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02022, Part\u00a0II. Lecture Notes in Computer Science, vol. 13276, pp. 427\u2013457. Springer, Heidelberg, Germany, Trondheim, Norway (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_15","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"10_CR17","unstructured":"Bowe, S., Grigg, J., Hopwood, D.: Halo: Recursive proof composition without a trusted setup. Cryptology ePrint Archive, Report 2019\/1021 (2019). https:\/\/eprint.iacr.org\/2019\/1021"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Braun, B., Feldman, A.J., Ren, Z., Setty, S.T.V., Blumberg, A.J., Walfish, M.: Verifying computations with state. In: Kaminsky, M., Dahlin, M. (eds.) ACM SIGOPS 24th Symposium on Operating Systems Principles, SOSP \u201913, Farmington, PA, USA, November 3-6, 2013, pp. 341\u2013357. ACM (2013). https:\/\/doi.org\/10.1145\/2517349.2522733","DOI":"10.1145\/2517349.2522733"},{"key":"10_CR19","unstructured":"Bui, D., et al.: An efficient ZK compiler from SIMD circuits to general circuits. Cryptology ePrint Archive, Paper 2023\/1610 (2023). https:\/\/eprint.iacr.org\/2023\/1610"},{"key":"10_CR20","unstructured":"B\u00fcnz, B., Chen, B.: ProtoStar: generic efficient accumulation\/folding for special sound protocols. Cryptology ePrint Archive, Paper 2023\/620 (2023). https:\/\/eprint.iacr.org\/2023\/620"},{"key":"10_CR21","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\u00a02021, Part\u00a0I. Lecture Notes in Computer Science, vol. 12825, pp. 681\u2013710. Springer, Heidelberg, Germany, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_24","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Chiesa, A., Mishra, P., Spooner, N.: Recursive proof composition from accumulation schemes. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020: 18th Theory of Cryptography Conference, Part\u00a0II. Lecture Notes in Computer Science, vol. 12551, pp. 1\u201318. Springer, Heidelberg, Germany, Durham, NC, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_1","DOI":"10.1007\/978-3-030-64378-2_1"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Fisch, B., Szepieniec, A.: Transparent SNARKs from DARK compilers. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0I. Lecture Notes in Computer Science, vol. 12105, pp. 677\u2013706. Springer, Heidelberg, Germany, Zagreb, Croatia (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_24","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for inner pairing products and applications. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0III. Lecture Notes in Computer Science, vol. 13092, pp. 65\u201397. Springer, Heidelberg, Germany, Singapore (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_3","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"10_CR25","unstructured":"B\u00fcnz, B., Mishra, P., Nguyen, W., Wang, W.: Accumulation without homomorphism. Cryptology ePrint Archive, Paper 2024\/474 (2024). https:\/\/eprint.iacr.org\/2024\/474"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Fiore, D., Querol, A.: LegoSNARK: modular design and composition of succinct zero-knowledge proofs. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 2075\u20132092. ACM Press, London, UK (2019). https:\/\/doi.org\/10.1145\/3319535.3339820","DOI":"10.1145\/3319535.3339820"},{"key":"10_CR27","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.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0II. Lecture Notes in Computer Science, vol. 14005, pp. 499\u2013530. Springer, Heidelberg, Germany, Lyon, France (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_17","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, P., Ward, N.P.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0I. Lecture Notes in Computer Science, vol. 12105, pp. 738\u2013768. Springer, Heidelberg, Germany, Zagreb, Croatia (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"10_CR29","unstructured":"Chiesa, A., Tromer, E.: Proof-carrying data and hearsay arguments from signature cards. In: Yao, A.C.C. (ed.) ICS 2010: 1st Innovations in Computer Science, pp. 310\u2013331. Tsinghua University Press, Tsinghua University, Beijing, China (2010)"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Clarke, D.E., Devadas, S., van Dijk, M., Gassend, B., Suh, G.E.: Incremental multiset hash functions and their application to memory integrity checking. In: Laih, C.S. (ed.) Advances in Cryptology \u2013 ASIACRYPT\u00a02003. Lecture Notes in Computer Science, vol.\u00a02894, pp. 188\u2013207. Springer, Heidelberg, Germany, Taipei, Taiwan (2003). https:\/\/doi.org\/10.1007\/978-3-540-40061-5_12","DOI":"10.1007\/978-3-540-40061-5_12"},{"key":"10_CR31","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":"10_CR32","unstructured":"Gabizon, A., Williamson, Z.J.: plookup: a simplified polynomial protocol for lookup tables. Cryptology ePrint Archive, Report 2020\/315 (2020). https:\/\/eprint.iacr.org\/2020\/315"},{"key":"10_CR33","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":"10_CR34","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.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0II. Lecture Notes in Computer Science, vol. 14082, pp. 193\u2013226. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"10_CR35","unstructured":"Hab\u00f6ck, U.: Multivariate lookups based on logarithmic derivatives. Cryptology ePrint Archive, Report 2022\/1530 (2022). https:\/\/eprint.iacr.org\/2022\/1530"},{"key":"10_CR36","unstructured":"Kadianakis, G., Maller, M., Novakovic, A.: Sigmabus: binding sigmas in circuits for fast curve operations. Cryptology ePrint Archive, Paper 2023\/1406 (2023). https:\/\/eprint.iacr.org\/2023\/1406"},{"key":"10_CR37","unstructured":"Kothapalli, A., Setty, S.: SuperNova: proving universal machine executions without universal circuits. Cryptology ePrint Archive, Report 2022\/1758 (2022). https:\/\/eprint.iacr.org\/2022\/1758"},{"key":"10_CR38","unstructured":"Kothapalli, A., Setty, S.: HyperNova: recursive arguments for customizable constraint systems. Cryptology ePrint Archive, Paper 2023\/573 (2023). https:\/\/eprint.iacr.org\/2023\/573"},{"key":"10_CR39","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\u00a02022, Part\u00a0IV. Lecture Notes in Computer Science, vol. 13510, pp. 359\u2013388. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_13","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"10_CR40","unstructured":"Lee, J.: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments. Cryptology ePrint Archive, Report 2020\/1274 (2020). https:\/\/eprint.iacr.org\/2020\/1274"},{"key":"10_CR41","unstructured":"Mohnblatt, N.: Sangria: a folding scheme for PLONK (2023). link"},{"key":"10_CR42","unstructured":"Nguyen, W., Boneh, D., Setty, S.: Revisiting the nova proof system on a cycle of curves. Cryptology ePrint Archive, Paper 2023\/969 (2023). https:\/\/eprint.iacr.org\/2023\/969"},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"Nguyen, W., Datta, T., Chen, B., Tyagi, N., Boneh, D.: Mangrove: a scalable framework for folding-based snarks. Cryptology ePrint Archive (2024). https:\/\/eprint.iacr.org\/2024\/416","DOI":"10.1007\/978-3-031-68403-6_10"},{"key":"10_CR44","unstructured":"Nova Contributors: nova implementation (2022). https:\/\/github.com\/Microsoft\/Nova"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Paul, W., Tarjan, R., Celoni, J.: Space bounds for a game on graphs. In: Proceedings of STOC 1976, pp. 149\u2013160. ACM (1976)","DOI":"10.1145\/800113.803643"},{"issue":"2","key":"10_CR46","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0209022","volume":"9","author":"N Pippenger","year":"1980","unstructured":"Pippenger, N.: On the evaluation of powers and monomials. SIAM J. Comput. 9(2), 230\u2013250 (1980)","journal-title":"SIAM J. Comput."},{"key":"10_CR47","unstructured":"R\u00e0fols, C., Zacharakis, A.: Folding schemes with selective verification. Cryptology ePrint Archive, Paper 2022\/1576 (2022), https:\/\/eprint.iacr.org\/2022\/1576"},{"key":"10_CR48","doi-asserted-by":"publisher","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0III. Lecture Notes in Computer Science, vol. 12172, pp. 704\u2013737. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"10_CR49","unstructured":"Setty, S., Thaler, J., Wahby, R.: Unlocking the lookup singularity with lasso. Cryptology ePrint Archive, Paper 2023\/1216 (2023). https:\/\/eprint.iacr.org\/2023\/1216"},{"key":"10_CR50","doi-asserted-by":"publisher","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02013, Part\u00a0II. Lecture Notes in Computer Science, vol.\u00a08043, pp. 71\u201389. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_5","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"10_CR51","doi-asserted-by":"publisher","unstructured":"Tyagi, N., Fisch, B., Zitek, A., Bonneau, J., Tessaro, S.: VeRSA: verifiable registries with efficient client audits from RSA authenticated dictionaries. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 2793\u20132807. ACM Press, Los Angeles, CA, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3560605","DOI":"10.1145\/3548606.3560605"},{"key":"10_CR52","doi-asserted-by":"crossref","unstructured":"Tzialla, I., Kothapalli, A., Parno, B., Setty, S.T.V.: Transparency dictionaries with succinct proofs of correct operation. In: 29th Annual Network and Distributed System Security Symposium, NDSS 2022, San Diego, California, USA, April 24-28, 2022. The Internet Society (2022). https:\/\/www.ndss-symposium.org\/ndss-paper\/auto-draft-252\/","DOI":"10.14722\/ndss.2022.23143"},{"key":"10_CR53","doi-asserted-by":"publisher","unstructured":"Valiant, P.: Incrementally verifiable computation or proofs of knowledge imply time\/space efficiency. In: Canetti, R. (ed.) TCC\u00a02008: 5th Theory of Cryptography Conference. Lecture Notes in Computer Science, vol.\u00a04948, pp. 1\u201318. Springer, Heidelberg, Germany, San Francisco, CA, USA (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_1","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"10_CR54","doi-asserted-by":"publisher","unstructured":"Wahby, R.S., Howald, M., Garg, S.J., shelat, a., Walfish, M.: Verifiable ASICs. In: 2016 IEEE Symposium on Security and Privacy, pp. 759\u2013778. IEEE Computer Society Press, San Jose, CA, USA (2016). https:\/\/doi.org\/10.1109\/SP.2016.51","DOI":"10.1109\/SP.2016.51"},{"key":"10_CR55","doi-asserted-by":"publisher","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zkSNARKs without trusted setup. In: 2018 IEEE Symposium on Security and Privacy, pp. 926\u2013943. IEEE Computer Society Press, San Francisco, CA, USA (2018). https:\/\/doi.org\/10.1109\/SP.2018.00060","DOI":"10.1109\/SP.2018.00060"},{"key":"10_CR56","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Yang, Z., Xie, X., Wang, X.: AntMan: interactive zero-knowledge proofs with sublinear communication. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 2901\u20132914. ACM Press, Los Angeles, CA, USA (2022). https:\/\/doi.org\/10.1145\/3548606.3560667","DOI":"10.1145\/3548606.3560667"},{"key":"10_CR57","unstructured":"Wu, H., Zheng, W., Chiesa, A., Popa, R.A., Stoica, I.: DIZK: a distributed zero knowledge proof system. In: Enck, W., Felt, A.P. (eds.) USENIX Security 2018: 27th USENIX Security Symposium, pp. 675\u2013692. USENIX Association, Baltimore, MD, USA (2018)"},{"key":"10_CR58","doi-asserted-by":"publisher","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02019, Part\u00a0III. Lecture Notes in Computer Science, vol. 11694, pp. 733\u2013764. Springer, Heidelberg, Germany, Santa Barbara, CA, USA (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"10_CR59","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":"10_CR60","doi-asserted-by":"crossref","unstructured":"Zeilberger, H., Chen, B., Fisch, B.: BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes. Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-68403-6_5"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:03:22Z","timestamp":1786752202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68403-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031684029","9783031684036"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68403-6_10","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"}]}}