{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T17:13:47Z","timestamp":1778087627645,"version":"3.51.4"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253262","type":"print"},{"value":"9783032253279","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-25327-9_6","type":"book-chapter","created":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:39:17Z","timestamp":1778085557000},"page":"154-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Large-Scale Lattice Attack: New Lattice Records by\u00a0Disk-Based Sieving"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4942-026X","authenticated-orcid":false,"given":"Ziyu","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1257-7598","authenticated-orcid":false,"given":"Jintai","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Symposium on the Theory of Computing (2001). https:\/\/doi.org\/10.1145\/380752.380857","DOI":"10.1145\/380752.380857"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-17656-3_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"MR Albrecht","year":"2019","unstructured":"Albrecht, M.R., Ducas, L., Herold, G., Kirshanova, E., Postlethwaite, E.W., Stevens, M.: The general sieve kernel and new records in lattice reduction. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 717\u2013746. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_25"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-030-64834-3_20","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"MR Albrecht","year":"2020","unstructured":"Albrecht, M.R., Gheorghiu, V., Postlethwaite, E.W., Schanck, J.M.: Estimating quantum speedups for lattice sieves. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 583\u2013613. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_20"},{"key":"6_CR4","unstructured":"An, W., et al.: Fire-Flyer AI-HPC: A Cost-Effective Software-Hardware Co-Design for Deep Learning (2024). https:\/\/arxiv.org\/abs\/2408.14158"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 10\u201324. Society for Industrial and Applied Mathematics, USA (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch2","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"6_CR6","unstructured":"Becker, A., Gama, N., Joux, A.: Solving shortest and closest vector problems: the decomposition approach. Cryptology ePrint Archive, Paper 2013\/685 (2013). https:\/\/eprint.iacr.org\/2013\/685"},{"key":"6_CR7","unstructured":"Becker, A., Gama, N., Joux, A.: Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search. Cryptology ePrint Archive, Paper 2015\/522 (2015). https:\/\/eprint.iacr.org\/2015\/522"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-031-68391-6_5","volume-title":"CRYPTO 2024","author":"DJ Bernstein","year":"2024","unstructured":"Bernstein, D.J., Chou, T.: Cryptattacktester: high-assurance attack analysis. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, pp. 141\u2013182. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68391-6_5"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Buchmann, J., et al.: Creating cryptographic challenges using multi-party computation: the LWE challenge. In: Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, AsiaPKC 2016, pp. 11\u201320. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2898420.2898422","DOI":"10.1145\/2898420.2898422"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_1"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-78381-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"L Ducas","year":"2018","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for free. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 125\u2013145. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_5"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-030-77886-6_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"L Ducas","year":"2021","unstructured":"Ducas, L., Stevens, M., van Woerden, W.: Advanced lattice sieving on GPUs, with tensor cores. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 249\u2013279. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_9"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Ducas, L.: Shortest vector from lattice sieving: a few dimensions for free (talk) (2018). https:\/\/eurocrypt.iacr.org\/2018\/Slides\/Monday\/TrackB\/01-01.pdf","DOI":"10.1007\/978-3-319-78381-9_5"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Fincke, U., Pohst, M.E.: Improved methods for calculating vectors of short length in a lattice. Math. Comput. (1985)","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"6_CR15","unstructured":"Gaborit, P., et al.: HQC. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-13190-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Gama","year":"2010","unstructured":"Gama, N., Nguyen, P.Q., Regev, O.: Lattice enumeration using extreme pruning. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 257\u2013278. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_13"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-662-54365-8_2","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"G Herold","year":"2017","unstructured":"Herold, G., Kirshanova, E.: Improved algorithms for the approximate k-list problem in Euclidean norm. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 16\u201340. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_2"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-76578-5_14","volume-title":"Public-Key Cryptography \u2013 PKC 2018","author":"G Herold","year":"2018","unstructured":"Herold, G., Kirshanova, E., Laarhoven, T.: Speed-ups and time\u2013memory trade-offs for tuple lattice sieving. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 407\u2013436. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_14"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Jaques, S.: Memory adds no cost to lattice sieving for computers in 3 or more spatial dimensions. Cryptology ePrint Archive, Paper 2024\/080 (2024). https:\/\/eprint.iacr.org\/2024\/080","DOI":"10.62056\/ay4fbn2hd"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (1983)","DOI":"10.1145\/800061.808749"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/978-3-030-84245-1_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"E Kirshanova","year":"2021","unstructured":"Kirshanova, E., Laarhoven, T.: Lower bounds on lattice sieving and information set decoding. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 791\u2013820. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_27"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-031-40003-2_7","volume-title":"Post-Quantum Cryptography","author":"E Kirshanova","year":"2023","unstructured":"Kirshanova, E., May, A., Nowakowski, J.: New NTRU records with improved lattice bases. In: Johansson, T., Smith-Tone, D. (eds.) Post-Quantum Cryptography, pp. 167\u2013195. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40003-2_7"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-47989-6_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven, T.: Sieving for shortest vectors in lattices using angular locality-sensitive hashing. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 3\u201322. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_1"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-319-79063-3_14","volume-title":"Post-Quantum Cryptography","author":"T Laarhoven","year":"2018","unstructured":"Laarhoven, T., Mariano, A.: Progressive lattice sieving. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 292\u2013311. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_14"},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2014","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Crypt. 75(3), 565\u2013599 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9938-4","journal-title":"Des. Codes Crypt."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.M.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Math. Ann."},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6) (2013). https:\/\/doi.org\/10.1145\/2535925","DOI":"10.1145\/2535925"},{"key":"6_CR29","unstructured":"Matzov, I.: Report on the security of LWE: improved dual lattice attack (2022). https:\/\/zenodo.org\/record\/6412487"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 1468\u20131480. Society for Industrial and Applied Mathematics, USA (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Module-Lattice-Based Digital Signature Standard. (Department of Commerce, Washington, D.C.), Federal Information Processing Standards Publication (FIPS) NIST FIPS 204 (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.204","DOI":"10.6028\/NIST.FIPS.204"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Module-Lattice-Based Key Encapsulation Mechanism Standard. (Department of Commerce, Washington, D.C.), Federal Information Processing Standards Publication (FIPS) NIST FIPS 203 (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.203","DOI":"10.6028\/NIST.FIPS.203"},{"key":"6_CR33","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Stateless Hash-Based Digital Signature Standard. (Department of Commerce, Washington, D.C.), Federal Information Processing Standards Publication (FIPS) NIST FIPS 205 (2024). https:\/\/doi.org\/10.6028\/NIST.FIPS.205","DOI":"10.6028\/NIST.FIPS.205"},{"issue":"2","key":"6_CR34","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2(2), 181\u2013207 (2008). https:\/\/doi.org\/10.1515\/JMC.2008.009","journal-title":"J. Math. Cryptol."},{"key":"6_CR35","unstructured":"NTRU Security Innovation Inc.: NTRU challenge parameter sets and public keys. https:\/\/web.archive.org\/web\/20160310143833\/https:\/\/www.securityinnovation.com\/products\/encryption-libraries\/ntru-crypto\/ntru-challenge\/solved-challenges.html"},{"key":"6_CR36","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/1089242.1089247","volume":"15","author":"ME Pohst","year":"1981","unstructured":"Pohst, M.E.: On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. SIGSAM Bull. 15, 37\u201344 (1981)","journal-title":"SIGSAM Bull."},{"key":"6_CR37","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6) (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"6_CR39","unstructured":"Schneider, M., Gama, N.: Darmstadt SVP challenges (2010)"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR41","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49264-X_1","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201995","author":"CP Schnorr","year":"1995","unstructured":"Schnorr, C.P., H\u00f6rner, H.H.: Attacking the Chor-Rivest cryptosystem by improved lattice reduction. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 1\u201312. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-49264-X_1"},{"key":"6_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-319-52153-4_3","volume-title":"Topics in Cryptology \u2013 CT-RSA 2017","author":"S-Y Yang","year":"2017","unstructured":"Yang, S.-Y., Kuo, P.-C., Yang, B.-Y., Cheng, C.-M.: Gauss sieve algorithm on GPUs. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 39\u201357. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_3"},{"issue":"2","key":"6_CR44","doi-asserted-by":"publisher","first-page":"362","DOI":"10.46586\/tches.v2025.i2.362-384","volume":"2025","author":"Z Zhao","year":"2025","unstructured":"Zhao, Z., Ding, J., Yang, B.Y.: Sieving with streaming memory access. IACR Trans. Cryptogr. Hardware Embed. Syst. 2025(2), 362\u2013384 (2025). https:\/\/doi.org\/10.46586\/tches.v2025.i2.362-384","journal-title":"IACR Trans. Cryptogr. Hardware Embed. Syst."}],"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-25327-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T16:39:24Z","timestamp":1778085564000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25327-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253262","9783032253279"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25327-9_6","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":"7 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"}}]}}