{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:58:26Z","timestamp":1778065106838,"version":"3.51.4"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683848","type":"print"},{"value":"9783031683855","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-68385-5_5","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:02:51Z","timestamp":1723795371000},"page":"139-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The Algebraic FreeLunch: Efficient Gr\u00f6bner Basis Attacks Against Arithmetization-Oriented Primitives"],"prefix":"10.1007","author":[{"given":"Augustin","family":"Bariant","sequence":"first","affiliation":[]},{"given":"Aur\u00e9lien","family":"Boeuf","sequence":"additional","affiliation":[]},{"given":"Axel","family":"Lemoine","sequence":"additional","affiliation":[]},{"given":"Irati","family":"Manterola Ayala","sequence":"additional","affiliation":[]},{"given":"Morten","family":"\u00d8ygarden","sequence":"additional","affiliation":[]},{"given":"L\u00e9o","family":"Perrin","sequence":"additional","affiliation":[]},{"given":"H\u00e5vard","family":"Raddum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"5_CR1","unstructured":"Advanced Encryption Standard (AES): National Institute of Standards and Technology, NIST FIPS PUB 197, U.S. Department of Commerce, November 2001"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., et al.: Algebraic cryptanalysis of\u00a0STARK-friendly designs: application to MARVELlous and MiMC. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 371\u2013397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_13","DOI":"10.1007\/978-3-030-34618-8_13"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. IACR Trans. Symmetric Cryptol. 2020(3), 1\u201345 (2020). https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/8695","DOI":"10.46586\/tosc.v2020.i3.1-45"},{"key":"5_CR6","unstructured":"Ashur, T., Kindi, A., Mahzoun, M.: XHash8 and XHash12: efficient STARK-friendly hash functions. Cryptology ePrint Archive, Paper 2023\/1045 (2023). https:\/\/eprint.iacr.org\/2023\/1045"},{"key":"5_CR7","unstructured":"Ashur, T., Kindi, A., Meier, W., Szepieniec, A., Threadbare, B.: Rescue-prime optimized. Cryptology ePrint Archive, Paper 2022\/1577 (2022). https:\/\/eprint.iacr.org\/2022\/1577"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Ashur, T., Mahzoun, M., Toprakhisar, D.: Chaghri - an FHE-friendly block cipher. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, 7\u201311 November 2022, pp. 139\u2013150. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3559364","DOI":"10.1145\/3548606.3559364"},{"key":"5_CR9","unstructured":"Bariant, A.: Algebraic cryptanalysis of full Ciminion. Cryptology ePrint Archive, Paper 2023\/1283 (2023). https:\/\/eprint.iacr.org\/2023\/1283"},{"key":"5_CR10","unstructured":"Bariant, A., et al.: The algebraic freelunch efficient Gr\u00f6bner basis attacks against arithmetization-oriented primitives. Cryptology ePrint Archive, Paper 2024\/347 (2024). https:\/\/eprint.iacr.org\/2024\/347"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Bariant, A., Bouvier, C., Leurent, G., Perrin, L.: Algebraic attacks against some arithmetization-oriented primitives. IACR Trans. Symmetric Cryptol. 2022(3), 73\u2013101 (2022). https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/9850","DOI":"10.46586\/tosc.v2022.i3.73-101"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Berthomieu, J., Neiger, V., El\u00a0Din, M.S.: Faster change of order algorithm for Gr\u00f6bner bases under shape and stability assumptions. In: Proceedings of the 2022 International Symposium on Symbolic and Algebraic Computation, pp. 409\u2013418 (2022)","DOI":"10.1145\/3476446.3535484"},{"key":"5_CR13","unstructured":"Bertoni, G., Daemen, J., Peters, M., Assche, G.V.: Cryptographic sponge functions (2011). https:\/\/keccak.team\/files\/CSF-0.1.pdf. Accessed 23 May 2024"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system, I. The user language. J. Symbolic Comput. 24(3-4), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125. Computational algebra and number theory, London (1993)","DOI":"10.1006\/jsco.1996.0125"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-031-38548-3_17","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"C Bouvier","year":"2023","unstructured":"Bouvier, C., et al.: New design techniques for efficient arithmetization-oriented hash functions: Anemoi permutations and Jive compression mode. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023. Lecture Notes in Computer Science, vol. 14083, pp. 507\u2013539. Springer Nature Switzerland, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_17"},{"issue":"3","key":"5_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/1088216.1088219","volume":"10","author":"B Buchberger","year":"1976","unstructured":"Buchberger, B.: A theoretical basis for the reduction of polynomials to canonical forms. ACM SIGSAM Bull. 10(3), 19\u201329 (1976)","journal-title":"ACM SIGSAM Bull."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/11799313_6","volume-title":"Fast Software Encryption","author":"J Buchmann","year":"2006","unstructured":"Buchmann, J., Pyshkin, A., Weinmann, R.-P.: A zero-dimensional Gr\u00f6bner basis for AES-128. In: Robshaw, M. (ed.) FSE 2006. LNCS, vol. 4047, pp. 78\u201388. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11799313_6"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-662-52993-5_16","volume-title":"Fast Software Encryption","author":"A Canteaut","year":"2016","unstructured":"Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. In: Peyrin, T. (ed.) FSE 2016. LNCS, vol. 9783, pp. 313\u2013333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_16"},{"issue":"3","key":"5_CR19","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/S00145-017-9273-9","volume":"31","author":"A Canteaut","year":"2018","unstructured":"Canteaut, A., et al.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. J. Cryptol. 31(3), 885\u2013916 (2018). https:\/\/doi.org\/10.1007\/S00145-017-9273-9","journal-title":"J. Cryptol."},{"issue":"7","key":"5_CR20","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BF01178683","volume":"28","author":"DG Cantor","year":"1991","unstructured":"Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica 28(7), 693\u2013701 (1991)","journal-title":"Acta Informatica"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Cosseron, O., Hoffmann, C., M\u00e9aux, P., Standaert, F.: Towards case-optimized hybrid homomorphic encryption - featuring the Elisabeth stream cipher. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022, Part III. LNCS, vol. 13793, pp. 32\u201367. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_2","DOI":"10.1007\/978-3-031-22969-5_2"},{"key":"5_CR22","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3","volume-title":"Ideals, Varieties, and Algorithms","author":"DA Cox","year":"2015","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms. UTM, Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16721-3"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Cox, D.A., Little, J.B., O\u2019Shea, D.: Using Algebraic Geometry, Graduate Texts in Mathematics, vol.\u00a0185. Springer, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4757-6911-1","DOI":"10.1007\/978-1-4757-6911-1"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1007\/978-3-319-96884-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"C Dobraunig","year":"2018","unstructured":"Dobraunig, C., et al.: Rasta: a cipher with low ANDdepth and few ANDs per bit. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 662\u2013692. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_22"},{"key":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-662-53018-4_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Duval","year":"2016","unstructured":"Duval, S., Lallemand, V., Rotella, Y.: Cryptanalysis of the FLIP family of stream ciphers. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 457\u2013475. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_17"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Eisenbud, D.: Commutative Algebra: With a View Toward Algebraic Geometry, vol.\u00a0150. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4612-5350-1","DOI":"10.1007\/978-1-4612-5350-1"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.jsc.2016.07.025","volume":"80","author":"JC Faug\u00e8re","year":"2017","unstructured":"Faug\u00e8re, J.C., Mou, C.: Sparse FGLM algorithms. J. Symb. Comput. 80, 538\u2013569 (2017)","journal-title":"J. Symb. Comput."},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Gaudry, P., Huot, L., Renault, G.: Sub-cubic change of ordering for Gr\u00f6bner basis: a probabilistic approach. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 170\u2013177 (2014)","DOI":"10.1145\/2608628.2608669"},{"issue":"4","key":"5_CR29","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J-C Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re, J.-C., Gianni, P., Lazard, D., Mora, T.: Efficient computation of zero-dimensional Gr\u00f6bner bases by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"issue":"1\u20133","key":"5_CR30","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"JC Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases ($$\\text{ F}_4$$). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"5_CR31","unstructured":"Faug\u00e8re, J.C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero ($$\\text{ F}_5$$). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp. 75\u201383 (2002)"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Gilbert, H., Boissier, R.H., Jean, J., Reinhard, J.: Cryptanalysis of Elisabeth-4. In: Guo, J., Steinfeld, R. (eds.) ASIACRYPT 2023, Part III. LNCS, vol. 14440, pp. 256\u2013284. Springer, Singapore (2023). https:\/\/doi.org\/10.1007\/978-981-99-8727-6_9","DOI":"10.1007\/978-981-99-8727-6_9"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-642-13858-4_21","volume-title":"Fast Software Encryption","author":"H Gilbert","year":"2010","unstructured":"Gilbert, H., Peyrin, T.: Super-Sbox cryptanalysis: improved attacks for AES-like permutations. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol. 6147, pp. 365\u2013383. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13858-4_21"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Giorgi, P., Jeannerod, C.P., Villard, G.: On the complexity of polynomial matrix computations. In: Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, pp. 135\u2013142 (2003)","DOI":"10.1145\/860854.860889"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Grassi, L., Hao, Y., Rechberger, C., Schofnegger, M., Walch, R., Wang, Q.: Horst meets fluid-SPN: Griffin for zero-knowledge applications. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part III. LNCS, vol. 14083, pp. 573\u2013606. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38548-3_19","DOI":"10.1007\/978-3-031-38548-3_19"},{"key":"5_CR36","unstructured":"Guido, B., Joan, D., Micha\u00ebl, P., Gilles, V.: Cryptographic sponge functions (2011). https:\/\/keccak.team\/files\/CSF-0.1.pdf"},{"key":"5_CR37","doi-asserted-by":"publisher","unstructured":"Ha, J., Kim, S., Lee, B., Lee, J., Son, M.: Rubato: noisy ciphers for approximate homomorphic encryption. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 581\u2013610. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_20","DOI":"10.1007\/978-3-031-06944-4_20"},{"key":"5_CR38","unstructured":"Hart, W.B.: Flint: Fast Library for Number Theory. Computeralgebra-Rundbrief 49 (2011)"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Hyun, S.G., Neiger, V., Schost, \u00c9.: Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants. In: Proceedings ISSAC 2019, pp. 235\u2013242. ACM (2019). https:\/\/doi.org\/10.1145\/3326229.3326272. https:\/\/github.com\/vneiger\/pml","DOI":"10.1145\/3326229.3326272"},{"key":"5_CR40","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.jco.2017.03.003","volume":"42","author":"G Labahn","year":"2017","unstructured":"Labahn, G., Neiger, V., Zhou, W.: Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix. J. Complex. 42, 44\u201371 (2017)","journal-title":"J. Complex."},{"key":"5_CR41","doi-asserted-by":"publisher","unstructured":"Masure, L., M\u00e9aux, P., Moos, T., Standaert, F.: Effective and efficient masking with low noise using small-mersenne-prime ciphers. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part IV. LNCS, vol. 14007, pp. 596\u2013627. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_20","DOI":"10.1007\/978-3-031-30634-1_20"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"key":"5_CR43","doi-asserted-by":"publisher","unstructured":"Neiger, V., Schost, \u00c9.: Computing syzygies in finite dimension using fast linear algebra. J. Complex. 60, 101502 (2020). https:\/\/doi.org\/10.1016\/J.JCO.2020.101502","DOI":"10.1016\/J.JCO.2020.101502"},{"key":"5_CR44","unstructured":"Roy, A., Steiner, M.J., Trevisani, S.: Arion: Arithmetization-Oriented Permutation and Hashing from Generalized Triangular Dynamical Systems (2023). https:\/\/arxiv.org\/abs\/2303.04639"},{"key":"5_CR45","unstructured":"Szepieniec, A., Ashur, T., Dhooghe, S.: Rescue-prime: a standard specification (SoK). Cryptology ePrint Archive, Paper 2020\/1143 (2020). https:\/\/eprint.iacr.org\/2020\/1143"},{"key":"5_CR46","unstructured":"The PML team: PML: Polynomial Matrix Library (2023). Version 0.3. https:\/\/github.com\/vneiger\/pml"},{"key":"5_CR47","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (2022). https:\/\/www.sagemath.org"},{"key":"5_CR48","unstructured":"Shoup, V., et al.: NTL: a library for doing number theory. https:\/\/libntl.org\/"}],"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-68385-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:05:41Z","timestamp":1723795541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68385-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683848","9783031683855"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68385-5_5","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":"17 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"}}]}}