{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T02:50:21Z","timestamp":1769914221331,"version":"3.49.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067531","type":"print"},{"value":"9783032067548","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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-06754-8_13","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:23:52Z","timestamp":1759307032000},"page":"345-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["From at\u00a0Least n\/3 to\u00a0at\u00a0Most $$3\\sqrt{n}$$: Correcting the\u00a0Algebraic Immunity of\u00a0the\u00a0Hidden Weight Bit Function"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5733-4341","authenticated-orcid":false,"given":"Pierrick","family":"M\u00e9aux","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"13_CR1","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, Part I. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1051\/ita:1999108","volume":"33","author":"B Bollig","year":"1999","unstructured":"Bollig, B., L\u00f6bbing, M., Sauerhoff, M., Wegener, I.: On the complexity of the hidden weighted bit function for various BDD models. RAIRO Theor. Inform. Appl. 33(2), 103\u2013116 (1999)","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11596219_4","volume-title":"Progress in Cryptology - INDOCRYPT 2005","author":"A Braeken","year":"2005","unstructured":"Braeken, A., Preneel, B.: On the algebraic immunity of symmetric Boolean functions. In: Maitra, S., Veni Madhavan, C.E., Venkatesan, R. (eds.) INDOCRYPT 2005. LNCS, vol. 3797, pp. 35\u201348. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11596219_4"},{"issue":"2","key":"13_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/12.73590","volume":"40","author":"RE Bryant","year":"1991","unstructured":"Bryant, R.E.: On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput. 40(2), 205\u2013213 (1991)","journal-title":"IEEE Trans. Comput."},{"key":"13_CR5","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"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Videau, M.: Symmetric Boolean functions. IEEE Trans. Inf. Theory 2791\u20132811 (2005)","DOI":"10.1109\/TIT.2005.851743"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Carlet, C.: On the degree, nonlinearity, algebraic thickness, and nonnormality of Boolean functions, with developments on symmetric functions. IEEE Trans. Inf. Theory 2178\u20132185 (2004)","DOI":"10.1109\/TIT.2004.833361"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press (2021). https:\/\/doi.org\/10.1017\/9781108606806","DOI":"10.1017\/9781108606806"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/TIT.2021.3126684","volume":"68","author":"C Carlet","year":"2022","unstructured":"Carlet, C.: A wide class of Boolean functions generalizing the hidden weight bit function. IEEE Trans. Inf. Theory 68(2), 1355\u20131368 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-540-89255-7_26","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"C Carlet","year":"2008","unstructured":"Carlet, C., Feng, K.: An infinite class of balanced functions with optimal algebraic immunity, good immunity to fast algebraic attacks and good nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425\u2013440. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_26"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Carlet, C., M\u00e9aux, P.: A complete study of two classes of Boolean functions: direct sums of monomials and threshold functions. IEEE Trans. Inf. Theory 1 (2021)","DOI":"10.1109\/TIT.2021.3139804"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Carlet, C., M\u00e9aux, P., Rotella, Y.: Boolean functions with restricted input and their robustness; application to the FLIP cipher. IACR Trans. Symmetric Cryptol. 2017(3) (2017)","DOI":"10.46586\/tosc.v2017.i3.192-227"},{"key":"13_CR13","unstructured":"Carlet, C., Sarkar, P.: Constructions of efficiently implementable Boolean functions possessing high nonlinearity and good resistance to algebraic attacks. IACR Cryptol. ePrint Arch. 1305 (2024). https:\/\/eprint.iacr.org\/archive\/2024\/1305\/20240821:123900.5"},{"key":"13_CR14","unstructured":"Carlet, C., Sarkar, P.: The nonlinear filter model of stream cipher Redivivus. Cryptology ePrint Archive, Paper 2025\/160 (2025). https:\/\/eprint.iacr.org\/2025\/160"},{"key":"13_CR15","unstructured":"Chacal, N., M\u00e9aux, P., AnonymousBeforeAcceptance: nostalgia cipher: can filtered lfsrs be secure again? ORBilu Archive (2025). https:\/\/hdl.handle.net\/10993\/64454"},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"2522","DOI":"10.1109\/TIT.2011.2111810","volume":"57","author":"Y Chen","year":"2011","unstructured":"Chen, Y., Lu, P.: Two classes of symmetric Boolean functions with optimum algebraic immunity: construction and analysis. IEEE Trans. Inf. Theory 57(4), 2522\u20132538 (2011). https:\/\/doi.org\/10.1109\/TIT.2011.2111810","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-53887-6_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"I Chillotti","year":"2016","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part I. LNCS, vol. 10031, pp. 3\u201333. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_1"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Cong, K., Das, D., Park, J., Pereira, H.V.: SortingHat: efficient private decision tree evaluation via homomorphic encryption and transciphering. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 563\u2013577. Association for Computing Machinery (2022).https:\/\/doi.org\/10.1145\/3548606.3560702","DOI":"10.1145\/3548606.3560702"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-540-45146-4_11","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176\u2013194. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_11"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"NT Courtois","year":"2003","unstructured":"Courtois, N.T., Meier, W.: Algebraic attacks on stream ciphers with linear feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 345\u2013359. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_21"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/11502760_7","volume-title":"Fast Software Encryption","author":"DK Dalai","year":"2005","unstructured":"Dalai, D.K., Gupta, K.C., Maitra, S.: Cryptographically significant Boolean functions: construction and analysis in terms of algebraic immunity. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol. 3557, pp. 98\u2013111. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11502760_7"},{"issue":"2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"480","DOI":"10.3934\/amc.2023048","volume":"18","author":"DK Dalai","year":"2024","unstructured":"Dalai, D.K., Mallick, K.: A class of weightwise almost perfectly balanced Boolean functions. Adv. Math. Commun. 18(2), 480\u2013504 (2024)","journal-title":"Adv. Math. Commun."},{"key":"13_CR23","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":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Fine, N.J.: Binomial coefficients modulo a prime. Am. Math. Monthly 54(10), 589\u2013592 (1947). http:\/\/www.jstor.org\/stable\/2304500","DOI":"10.2307\/2304500"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.dam.2022.08.017","volume":"322","author":"A Gini","year":"2022","unstructured":"Gini, A., M\u00e9aux, P.: On the weightwise nonlinearity of weightwise perfectly balanced functions. Discrete Appl. Math. 322, 320\u2013341 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.08.017","journal-title":"Discrete Appl. Math."},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-65277-7_3","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"C Hoffmann","year":"2020","unstructured":"Hoffmann, C., M\u00e9aux, P., Ricosset, T.: Transciphering, using FiLIP and TFHE for an efficient delegation of computation. In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 39\u201361. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_3"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.dam.2020.01.020","volume":"279","author":"J Li","year":"2020","unstructured":"Li, J., Su, S.: Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity. Discret. Appl. Math. 279, 218\u2013227 (2020)","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"13_CR29","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1007\/s10623-018-0579-x","volume":"87","author":"J Liu","year":"2019","unstructured":"Liu, J., Mesnager, S.: Weightwise perfectly balanced functions with high weightwise nonlinearity profile. Des. Codes Cryptogr. 87(8), 1797\u20131813 (2019)","journal-title":"Des. Codes Cryptogr."},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-031-19493-1_30","volume-title":"Advances in Computational Intelligence","author":"S Mandujano","year":"2022","unstructured":"Mandujano, S., Ku Cauich, J.C., Lara, A.: Studying special operators for the application of evolutionary algorithms in the seek of optimal Boolean functions for cryptography. In: Pichardo Lagunas, O., Mart\u00ednez-Miranda, J., Mart\u00ednez Seis, B. (eds.) MICAI 2022. LNCS, vol. 13612, pp. 383\u2013396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-19493-1_30"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Djurasevic, M., Leporati, A.: Evolutionary construction of perfectly balanced Boolean functions. In: 2022 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138. IEEE Press (2022)","DOI":"10.1109\/CEC55065.2022.9870427"},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-30530-7_5","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2019","author":"P M\u00e9aux","year":"2019","unstructured":"M\u00e9aux, P.: On the fast algebraic immunity of majority functions. In: Schwabe, P., Th\u00e9riault, N. (eds.) LATINCRYPT 2019. LNCS, vol. 11774, pp. 86\u2013105. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30530-7_5"},{"key":"13_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-030-35423-7_4","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"P M\u00e9aux","year":"2019","unstructured":"M\u00e9aux, P., Carlet, C., Journault, A., Standaert, F.-X.: Improved filter permutators for efficient FHE: better instances and implementations. In: Hao, F., Ruj, S., Sen Gupta, S. (eds.) INDOCRYPT 2019. LNCS, vol. 11898, pp. 68\u201391. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35423-7_4"},{"key":"13_CR34","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, Part I. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.dam.2024.04.008","volume":"355","author":"P M\u00e9aux","year":"2024","unstructured":"M\u00e9aux, P., Ozaim, Y.: On the cryptographic properties of weightwise affine and weightwise quadratic functions. Discret. Appl. Math. 355, 13\u201329 (2024)","journal-title":"Discret. Appl. Math."},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"M\u00e9aux, P., Park, J., Pereira, H.V.L.: Towards practical transciphering for FHE with setup independent of the plaintext space. IACR Commun. Cryptol. 1(1), 20 (2024). https:\/\/doi.org\/10.62056\/ANXRXRXQI","DOI":"10.62056\/ANXRXRXQI"},{"key":"13_CR37","unstructured":"M\u00e9aux, P., Seur\u00e9, T., Tang, D.: The revisited hidden weight bit function. IACR Cryptol. ePrint Arch. 2022 (2024). https:\/\/eprint.iacr.org\/2024\/2022. To appear at Selected Areas in Cryptography \u2013 SAC 2025"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-24676-3_28","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"W Meier","year":"2004","unstructured":"Meier, W., Pasalic, E., Carlet, C.: Algebraic attacks and decomposition of Boolean functions. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 474\u2013491. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_28"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Mesnager, S., Su, S.: On constructions of weightwise perfectly balanced Boolean functions. Cryptogr. Commun. (2021)","DOI":"10.1007\/s12095-021-00481-3"},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop, CCSW 2011, pp. 113\u2013124. Association for Computing Machinery, New York (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"13_CR41","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Maitra, S.: Balancedness and correlation immunity of symmetric Boolean functions. Discrete Math. 2351 \u2013 2358 (2007)","DOI":"10.1016\/j.disc.2006.08.008"},{"issue":"6","key":"13_CR42","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1007\/s12095-019-00374-6","volume":"11","author":"D Tang","year":"2019","unstructured":"Tang, D., Liu, J.: A family of weightwise (almost) perfectly balanced Boolean functions with optimal algebraic immunity. Cryptogr. Commun. 11(6), 1185\u20131197 (2019). https:\/\/doi.org\/10.1007\/s12095-019-00374-6","journal-title":"Cryptogr. Commun."},{"key":"13_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2014.01.010","volume":"174","author":"Q Wang","year":"2014","unstructured":"Wang, Q., Carlet, C., Stanica, P., Tan, C.H.: Cryptographic properties of the hidden weighted bit function. Discret. Appl. Math. 174, 1\u201310 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"13_CR44","doi-asserted-by":"publisher","first-page":"153","DOI":"10.3934\/amc.2014.8.153","volume":"8","author":"Q Wang","year":"2014","unstructured":"Wang, Q., Tan, C.H., Stanica, P.: Concatenations of the hidden weighted bit function and their cryptographic properties. Adv. Math. Commun. 8(2), 153\u2013165 (2014)","journal-title":"Adv. Math. Commun."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06754-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:24:00Z","timestamp":1759307040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06754-8_13"}},"subtitle":["Algebraic Immunity Upper Bounds on Weightwise Degree-d Functions and Their Implications"],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032067531","9783032067548"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06754-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Medell\u00edn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","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":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciencias.medellin.unal.edu.co\/eventos\/latincrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}