{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:36:22Z","timestamp":1774020982658,"version":"3.50.1"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911064","type":"print"},{"value":"9783031911071","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91107-1_8","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T04:39:36Z","timestamp":1745728776000},"page":"212-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["ChiLow and\u00a0ChiChi: New Constructions for\u00a0Code Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-0314-9385","authenticated-orcid":false,"given":"Yanis","family":"Belkheyar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0478-8483","authenticated-orcid":false,"given":"Patrick","family":"Derbez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4966-1681","authenticated-orcid":false,"given":"Shibam","family":"Ghosh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2579-8587","authenticated-orcid":false,"given":"Gregor","family":"Leander","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4664-3541","authenticated-orcid":false,"given":"Silvia","family":"Mella","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4722-7005","authenticated-orcid":false,"given":"L\u00e9o","family":"Perrin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6848-2227","authenticated-orcid":false,"given":"Shahram","family":"Rasoolzadeh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6703-6476","authenticated-orcid":false,"given":"Lukas","family":"Stennes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3058-2377","authenticated-orcid":false,"given":"Siwei","family":"Sun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5003-8937","authenticated-orcid":false,"given":"Gilles","family":"Van Assche","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4459-2951","authenticated-orcid":false,"given":"Damian","family":"Viz\u00e1r","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Anand, R., et al.: Gleeok: a family of low-latency PRFs and its applications to authenticated encryption. IACR TCHES 2024(2), 545\u2013587 (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i2.545-587","DOI":"10.46586\/tches.v2024.i2.545-587"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Anand, R., et al.: Gleeok: a family of low-latency PRFs and its applications to authenticated encryption (implementations) (2024). https:\/\/github.com\/qantik\/gleeok","DOI":"10.46586\/tches.v2024.i2.545-587"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Avanzi, R.: The QARMA block cipher family. IACR Trans. Symm. Cryptol. 2017(1), 4\u201344 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.4-44","DOI":"10.13154\/tosc.v2017.i1.4-44"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Avanzi, R., et al.: The QARMAv2 family of tweakable block ciphers. IACR Trans. Symm. Cryptol. 2023(3), 25\u201373 (2023). https:\/\/doi.org\/10.46586\/tosc.v2023.i3.25-73","DOI":"10.46586\/tosc.v2023.i3.25-73"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Banik, S., Isobe, T., Liu, F., Minematsu, K., Sakamoto, K., et al.: A low-latency PRF. IACR Trans. Symm. Cryptol. 2021(1), 37\u201377 (2021). https:\/\/doi.org\/10.46586\/tosc.v2021.i1.37-77","DOI":"10.46586\/tosc.v2021.i1.37-77"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Banik, S., Isobe, T., Liu, F., Minematsu, K., Sakamoto, K., et al.: A low-latency PRF (implementations) (2021). https:\/\/github.com\/subhadeep-banik\/orthros","DOI":"10.46586\/tosc.v2021.i1.37-77"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/978-3-030-77870-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"Z Bao","year":"2021","unstructured":"Bao, Z., et al.: Automatic search of meet-in-the-middle preimage attacks on AES-like hashing. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 771\u2013804. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_27"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., et al.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, Part II, vol. 9815, pp. 123\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_5"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Belkheyar, Y., Daemen, J., Dobraunig, C., Ghosh, S., Rasoolzadeh, S.: BipBip: a low-latency tweakable block cipher with small dimensions. IACR TCHES 2023(1), 326\u2013368 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i1.326-368","DOI":"10.46586\/tches.v2023.i1.326-368"},{"key":"8_CR10","unstructured":"Belkheyar, Y., et al.: ChiLow and ChiChi: new constructions for code encryption. Cryptology ePrint Archive, Paper 2025\/308 (2025). https:\/\/eprint.iacr.org\/2025\/308"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-44448-3_24","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Rogaway, P.: Encode-then-encipher encryption: how to exploit nonces or redundancy in plaintexts for efficient cryptography. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 317\u2013330. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_24"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-34961-4_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J Borghoff","year":"2012","unstructured":"Borghoff, J., et al.: PRINCE \u2013 a low-latency block cipher for pervasive computing applications. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 208\u2013225. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_14"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Boura, C., Rasoolzadeh, S., Saha, D., Todo, Y.: Multiple-tweak differential attack against SCARF. Cryptology ePrint Archive, Paper 2024\/1408 (2024). https:\/\/eprint.iacr.org\/2024\/1408","DOI":"10.1007\/978-981-96-0941-3_11"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-81652-0_19","volume-title":"Selected Areas in Cryptography","author":"D Bo\u017eilov","year":"2021","unstructured":"Bo\u017eilov, D., et al.: PRINCEv2. In: Dunkelman, O., Jacobson, Jr., M.J., O\u2019Flynn, C. (eds.) SAC 2020. LNCS, vol. 12804, pp. 483\u2013511. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_19"},{"key":"8_CR15","unstructured":"Daemen, J.: Cipher and hash function design, strategies based on linear and differential cryptanalysis, Ph.D. thesis. K.U. Leuven (1995). http:\/\/jda.noekeon.org\/"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Diffie, W., Hellman, M.E.: Special feature exhaustive cryptanalysis of the NBS data encryption standard. Computer 10(6), 74\u201384 (1977). https:\/\/doi.org\/10.1109\/C-M.1977.217750","DOI":"10.1109\/C-M.1977.217750"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-030-84252-9_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"X Dong","year":"2021","unstructured":"Dong, X., Hua, J., Sun, S., Li, Z., Wang, X., Hu, L.: Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 278\u2013308. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_10"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Dong, X., Zhao, B., Qin, L., Hou, Q., Zhang, S., Wang, X.: Generic mitm attack frameworks on sponge constructions. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024, Part IV. LNCS, vol. 14923, pp. 3\u201337. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68385-5_1","DOI":"10.1007\/978-3-031-68385-5_1"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Eliasi, P.A., et al.: Koala: a low-latency pseudorandom function. In: Eichlseder, M., Gambs, S. (eds.) SAC 2024. LNCS, vol. 15517, pp. 239\u2013266. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-82841-6_10","DOI":"10.1007\/978-3-031-82841-6_10"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-59870-3_2","volume-title":"Information Security and Privacy","author":"C Forler","year":"2017","unstructured":"Forler, C., List, E., Lucks, S., Wenzel, J.: Reforgeability of authenticated encryption schemes. In: Pieprzyk, J., Suriadi, S. (eds.) ACISP 2017. LNCS, vol. 10343, pp. 19\u201337. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59870-3_2"},{"issue":"1","key":"8_CR21","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00145-017-9253-0","volume":"31","author":"S Gilboa","year":"2017","unstructured":"Gilboa, S., Gueron, S., Morris, B.: How many queries are needed to distinguish a truncated random permutation from a random function? J. Cryptol. 31(1), 162\u2013171 (2017). https:\/\/doi.org\/10.1007\/s00145-017-9253-0","journal-title":"J. Cryptol."},{"key":"8_CR22","unstructured":"Greene, P., Motley, M., Weeks, B.: ARADI and LLAMA: low-latency cryptography for memory encryption. Cryptology ePrint Archive, Report 2024\/1240 (2024). https:\/\/eprint.iacr.org\/2024\/1240"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/BFb0055742","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"C Hall","year":"1998","unstructured":"Hall, C., Wagner, D., Kelsey, J., Schneier, B.: Building PRFs from PRPs. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 370\u2013389. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055742"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-662-46800-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"VT Hoang","year":"2015","unstructured":"Hoang, V.T., Krovetz, T., Rogaway, P.: Robust authenticated-encryption AEZ and the problem that it solves. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 15\u201344. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_2"},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-662-47989-6_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"VT Hoang","year":"2015","unstructured":"Hoang, V.T., Reyhanitabar, R., Rogaway, P., Viz\u00e1r, D.: Online authenticated-encryption and its nonce-reuse misuse-resistance. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 493\u2013517. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_24"},{"key":"8_CR26","unstructured":"IEEE: Standard for cryptographic protection of data on block-oriented storage devices. IEEE Std 1619-2018 (Revision of IEEE Std 1619-2007) (2019)"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-662-45608-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"J Jean","year":"2014","unstructured":"Jean, J., Nikoli\u0107, I., Peyrin, T.: Tweaks and keys for block ciphers: the TWEAKEY framework. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 274\u2013288. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_15"},{"issue":"3","key":"8_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09397-w","volume":"34","author":"J Jean","year":"2021","unstructured":"Jean, J., Nikoli\u0107, I., Peyrin, T., Seurin, Y.: The Deoxys AEAD family. J. Cryptol. 34(3), 1\u201351 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09397-w","journal-title":"J. Cryptol."},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-33027-8_25","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2012","author":"M Kne\u017eevi\u0107","year":"2012","unstructured":"Kne\u017eevi\u0107, M., Nikov, V., Rombouts, P.: Low-latency encryption \u2013 is \u201clightweight = light + wait\u2019\u2019? In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 426\u2013446. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_25"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Leander, G., Moos, T., Moradi, A., Rasoolzadeh, S.: The SPEEDY family of block ciphers engineering an ultra low-latency cipher from gate level for secure processor architectures. IACR TCHES 2021(4), 510\u2013545 (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i4.510-545. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/9074","DOI":"10.46586\/tches.v2021.i4.510-545"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Mehrdad, A., Mella, S., Grassi, L., Daemen, J.: Differential trail search in cryptographic primitives with big-circle chi: application to Subterranean. IACR Trans. Symm. Cryptol. 2022(2), 253\u2013288 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i2.253-288","DOI":"10.46586\/tosc.v2022.i2.253-288"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Mella, S., Mehrdad, A., Daemen, J.: Differential and linear properties of Vectorial Boolean functions based on chi. Cryptogr. Commun. 15(6), 1087\u20131116 (2023). https:\/\/doi.org\/10.1007\/S12095-023-00639-1","DOI":"10.1007\/S12095-023-00639-1"},{"key":"8_CR33","unstructured":"National Institute of Standards & Technology: Recommendation for block cipher modes of operation: the XTS-AES mode for confidentiality on storage devices. NIST Special Publication 800-38E (2010)"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Qin, L., Hua, J., Dong, X., Yan, H., Wang, X.: Meet-in-the-middle preimage attacks on sponge-based hashing. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part IV. LNCS, vol. 14007, pp. 158\u2013188. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30634-1_6","DOI":"10.1007\/978-3-031-30634-1_6"},{"key":"8_CR35","doi-asserted-by":"publisher","unstructured":"Rasoolzadeh, S.: Low-latency Boolean functions and bijective S-boxes. IACR Trans. Symm. Cryptol. 2022(3), 403\u2013447 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.403-447","DOI":"10.46586\/tosc.v2022.i3.403-447"},{"key":"8_CR36","doi-asserted-by":"publisher","unstructured":"Rasoolzadeh, S.: Classification of all t-resilient Boolean functions with t + 4 variables. IACR Trans. Symm. Cryptol. 2023(3), 213\u2013226 (2023). https:\/\/doi.org\/10.46586\/tosc.v2023.i3.213-226","DOI":"10.46586\/tosc.v2023.i3.213-226"},{"key":"8_CR37","doi-asserted-by":"publisher","unstructured":"Rogaway, P.: Authenticated-encryption with associated-data. In: Atluri, V. (ed.) ACM CCS 2002, pp. 98\u2013107. ACM Press, November 2002. https:\/\/doi.org\/10.1145\/586110.586125","DOI":"10.1145\/586110.586125"},{"key":"8_CR38","unstructured":"STMicroelectronics: How to use OTFDEC for encryption\/decryption in trusted environment on STM32H7Bxxx and STM32H73xx microcontrollers. STMicroelectronics Application Note AN5281 (2020)"},{"key":"8_CR39","unstructured":"Ueno, R., Haneda, H., Homma, N., Inoue, A., Minematsu, K.: Crystalor: recoverable memory encryption mechanism with optimized metadata structure. Cryptology ePrint Archive, Report 2023\/1630 (2023). https:\/\/eprint.iacr.org\/2023\/1630"},{"key":"8_CR40","doi-asserted-by":"publisher","unstructured":"Wang, J., Huang, T., Wu, S., Liu, Z.: Twinkle: a family of low-latency schemes for authenticated encryption and pointer authentication. IACR Commun. Cryptol. 1(2), 20 (2024). https:\/\/doi.org\/10.62056\/A3N59QGXQ","DOI":"10.62056\/A3N59QGXQ"},{"key":"8_CR41","doi-asserted-by":"publisher","unstructured":"Werner, M., Unterluggauer, T., Schilling, R., Schaffenrath, D., Mangard, S.: Transparent memory encryption and authentication. In: Santambrogio, M.D., G\u00f6hringer, D., Stroobandt, D., Mentens, N., Nurmi, J. (eds.) 27th International Conference on Field Programmable Logic and Applications, FPL 2017, Ghent, Belgium, 4\u20138 September 2017, pp.\u00a01\u20136. IEEE (2017). https:\/\/doi.org\/10.23919\/FPL.2017.8056797","DOI":"10.23919\/FPL.2017.8056797"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91107-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T04:39:43Z","timestamp":1745728783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91107-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911064","9783031911071"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91107-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","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":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}