{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:38Z","timestamp":1778249438459,"version":"3.51.4"},"publisher-location":"Cham","reference-count":53,"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_7","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:15:14Z","timestamp":1778246114000},"page":"178-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynark: Making Groth16 Dynamic"],"prefix":"10.1007","author":[{"given":"Tianyu","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupeng","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"7_CR1","unstructured":"arkworks contributors. ark-groth16 (2022). https:\/\/github.com\/arkworks-rs\/groth16"},{"key":"7_CR2","unstructured":"arkworks contributors. arkworks zksnark ecosystem (2022). https:\/\/arkworks.rs"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 2087\u20132104 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Abbaszadeh, K., Pappas, C., Katz, J., Papadopoulos, D.: Zero-knowledge proofs of training for deep neural networks. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 4316\u20134330 (2024)","DOI":"10.1145\/3658644.3670316"},{"key":"7_CR5","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), pp. 315\u2013334. IEEE (2018)","DOI":"10.1109\/SP.2018.00020"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Boneh, D., Chen, B.: Latticefold: a lattice-based folding scheme and its applications to succinct proof systems. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-981-95-5099-9_11"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Block, A.R., Fang, Z., Katz, J., Thaler, J., Waldner, H., Zhang, Y.: Field-agnostic snarks from expand-accumulate codes. In: Annual International Cryptology Conference, pp. 276\u2013307. Springer, Heidelberg (2024)","DOI":"10.1007\/978-3-031-68403-6_9"},{"key":"7_CR8","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 \u2013 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":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-030-92078-4_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"B B\u00fcnz","year":"2021","unstructured":"B\u00fcnz, B., Maller, M., Mishra, P., Tyagi, N., Vesely, P.: Proofs for\u00a0inner pairing products and\u00a0applications. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 65\u201397. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_3"},{"key":"7_CR10","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast Reed-Solomon interactive oracle proofs of proximity. In: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) (2018)"},{"key":"7_CR11","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":"7_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. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"7_CR13","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 \u2013 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":"7_CR14","unstructured":"cq reference implementation (2022). https:\/\/github.com\/geometryxyz\/cq"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Datta, T., Chen, B., Boneh, D.: Veritas: verifying image transformations at scale. In: 2025 IEEE Symposium on Security and Privacy (SP), pp. 4606\u20134623. IEEE (2025)","DOI":"10.1109\/SP61157.2025.00097"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Dutta, M., Ganesh, C., Patranabis, S., Prakash, S., Singh, N.: Batching-efficient ram using updatable lookup arguments. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, pp. 4077\u20134091 (2024)","DOI":"10.1145\/3658644.3670356"},{"key":"7_CR17","unstructured":"Eagen, L., Fiore, D., Gabizon, A.: cq: cached quotients for fast lookups. Cryptology ePrint Archive, Paper 2022\/1763 (2022)"},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1006\/inco.2001.3046","volume":"171","author":"GS Frandsen","year":"2001","unstructured":"Frandsen, G.S., Hansen, J.P., Miltersen, P.B.: Lower bounds for dynamic algebraic problems. Inf. Comput. 171(2), 333\u2013349 (2001)","journal-title":"Inf. Comput."},{"key":"7_CR19","unstructured":"Feist, D., Khovratovich, D.: Fast amortized kzg proofs. Cryptology ePrint Archive (2023)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"7_CR21","unstructured":"Grubbs, P., Arun, A., Zhang, Y., Bonneau, J., Walfish, M.: $$\\{$$Zero-Knowledge$$\\}$$ middleboxes. In: 31st USENIX Security Symposium (USENIX Security 22), pp. 4255\u20134272 (2022)"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Garg, S., et al.: Experimenting with zero-knowledge proofs of training. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, pp. 1880\u20131894 (2023)","DOI":"10.1145\/3576915.3623202"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Garg, S., Goel, A., Kolonelos, D., Shiehian, S., Sinha, R.: Split prover zero-knowledge snarks. In: Public-Key Cryptography - PKC 2025, pp. 353\u2013380. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-91820-9_12","DOI":"10.1007\/978-3-031-91820-9_12"},{"issue":"1","key":"7_CR24","doi-asserted-by":"publisher","first-page":"s135","DOI":"10.1137\/0908017","volume":"8","author":"A Gerasoulis","year":"1987","unstructured":"Gerasoulis, A., Grigoriadis, M.D., Sun, L.: A fast algorithm for Trummer\u2019s problem. SIAM J. Sci. Stat. Comput. 8(1), s135\u2013s138 (1987)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Golovnev, A., Lee, J., Setty, S., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic snarks for R1CS. In: Annual International Cryptology Conference, pp. 193\u2013226. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_7","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"7_CR26","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":"7_CR27","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive (2019)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Proceedings of the ACM Symposium on Theory of Computing (1992)","DOI":"10.1145\/129712.129782"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Luo, Z., Jia, Y., Gracia, A.V.O., Kate, A.: Cauchyproofs: batch-updatable vector commitment with easy aggregation and application to stateless blockchains, pp. 1947\u20131963 (2025)","DOI":"10.1109\/SP61157.2025.00247"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Liu, T., Xie, X., Zhang, Y.: Zkcnn: zero knowledge proofs for convolutional neural network predictions and accuracy. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 2968\u20132985 (2021)","DOI":"10.1145\/3460120.3485379"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. (2000)","DOI":"10.1137\/S0097539795284959"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Naveh, A., Tromer, E.: Photoproof: cryptographic image authentication for any set of permissible transformations. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 255\u2013271. IEEE (2016)","DOI":"10.1109\/SP.2016.23"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation, pp. 238\u2013252 (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"7_CR35","unstructured":"Qu, W., et al.: zkgpt: an efficient non-interactive zero-knowledge proof framework for LLM inference. In: 34st USENIX Security Symposium (USENIX Security 25) (2025)"},{"key":"7_CR36","unstructured":"RISC Zero. Scalable, Transparent Arguments of RISC-V Integrity. Technical report, RISC Zero (2023)"},{"issue":"2","key":"7_CR37","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1006\/jagm.1995.0807","volume":"22","author":"JH Reif","year":"1997","unstructured":"Reif, J.H., Tate, S.R.: On dynamic algorithms for algebraic problems. J. Algor. 22(2), 347\u2013371 (1997)","journal-title":"J. Algor."},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Sasson, E.B., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1007\/978-3-030-56877-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Setty","year":"2020","unstructured":"Setty, S.: Spartan: efficient and general-purpose zkSNARKs without trusted setup. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 704\u2013737. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_25"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Sun, H., Li, J., Zhang, H.: zkllm: zero knowledge proofs for large language models. arXiv preprint arXiv:2404.16109 (2024)","DOI":"10.1145\/3658644.3670334"},{"key":"7_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-57990-6_3","volume-title":"Security and Cryptography for Networks","author":"A Tomescu","year":"2020","unstructured":"Tomescu, A., Abraham, I., Buterin, V., Drake, J., Feist, D., Khovratovich, D.: Aggregatable subvector commitments for stateless cryptocurrencies. In: Galdi, C., Kolesnikov, V. (eds.) SCN 2020. LNCS, vol. 12238, pp. 45\u201364. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57990-6_3"},{"issue":"2\u20134","key":"7_CR42","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1561\/3300000030","volume":"4","author":"J Thaler","year":"2022","unstructured":"Thaler, J.: Proofs, arguments, and zero-knowledge. Found. Trends\u00ae Priv. Secur. 4(2\u20134), 117\u2013660 (2022)","journal-title":"Found. Trends\u00ae Priv. Secur."},{"key":"7_CR43","unstructured":"An Incomplete Guide to Rollups. https:\/\/vitalik.ca\/general\/2021\/01\/05\/rollup.html"},{"key":"7_CR44","unstructured":"Wang, W., Papamanthou, C., Srinivasan, S., Papadopoulos, D.: Dynamic zk-SNARKs (2025). https:\/\/eprint.iacr.org\/archive\/2024\/1566\/20250214:152438. Accessed 14 Feb 2025"},{"key":"7_CR45","unstructured":"Wang, W., Papamanthou, C., Srinivasan, S., Papadopoulos, D.: Dynamic zk-SNARKs (2025). https:\/\/eprint.iacr.org\/archive\/2024\/1566\/20250716:152311. Accessed 16 July 2025"},{"key":"7_CR46","unstructured":"Wang, W., Papamanthou, C., Srinivasan, S., Papadopoulos, D.: Dynamic zk-SNARKs (2025). https:\/\/eprint.iacr.org\/archive\/2024\/1566\/20251013:145022. Accessed 13 Oct 2025"},{"key":"7_CR47","doi-asserted-by":"crossref","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 (SP), pp. 926\u2013943 (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"7_CR48","unstructured":"Weng, C., Yang, K., Xie, X., Katz, J., Wang, X.: Mystique: efficient conversions for $$\\{$$Zero-Knowledge$$\\}$$ proofs with applications to machine learning. In: 30th USENIX Security Symposium (USENIX Security 21), pp. 501\u2013518 (2021)"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Xie, T., et al.: zkbridge: Trustless cross-chain bridges made practical, pp. 3003\u20133017 (2022)","DOI":"10.1145\/3548606.3560652"},{"key":"7_CR50","doi-asserted-by":"publisher","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: zero knowledge proof with linear prover time. In: Annual International Cryptology Conference, pp. 299\u2013328. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_11","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"7_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Xie","year":"2019","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.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24"},{"key":"7_CR52","doi-asserted-by":"publisher","unstructured":"Zeilberger, H., Chen, B., Fisch, B:. Basefold: efficient field-agnostic polynomial commitment schemes from foldable codes. In: Annual International Cryptology Conference, pp. 138\u2013169. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68403-6_5","DOI":"10.1007\/978-3-031-68403-6_5"},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"Zhang, J., Fang, Z., Zhang, Y., Song, D.: Zero knowledge proofs for decision tree predictions and accuracy. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 2039\u20132053 (2020)","DOI":"10.1145\/3372297.3417278"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:15:45Z","timestamp":1778246145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_7","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"}}]}}