{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:09:43Z","timestamp":1778249383199,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"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_18","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:11:11Z","timestamp":1778245871000},"page":"506-536","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PERSEUS \u2013 Probabilistic Evaluation of\u00a0Random Probing SEcurity Using Efficient Sampling"],"prefix":"10.1007","author":[{"given":"Sonia","family":"Bela\u00efd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ga\u00ebtan","family":"Cassiers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Ajtai, M.: Secure computation with information leaking to an adversary. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 715\u2013724. ACM Press (2011). https:\/\/doi.org\/10.1145\/1993636.1993731","DOI":"10.1145\/1993636.1993731"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-96878-0_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"P Ananth","year":"2018","unstructured":"Ananth, P., Ishai, Y., Sahai, A.: Private circuits: a modular approach. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part III. LNCS, vol. 10993, pp. 427\u2013455. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_15"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-662-49896-5_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Andrychowicz","year":"2016","unstructured":"Andrychowicz, M., Dziembowski, S., Faust, S.: Circuit compilers with $$O(1\/\\log (n))$$ leakage rate. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 586\u2013615. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_21"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-030-29959-0_15","volume-title":"Computer Security \u2013 ESORICS 2019","author":"G Barthe","year":"2019","unstructured":"Barthe, G., Bela\u00efd, S., Cassiers, G., Fouque, P.-A., Gr\u00e9goire, B., Standaert, F.-X.: maskVerif: automated verification of higher-order masking in presence of physical defaults. In: Sako, K., Schneider, S., Ryan, P.Y.A. (eds.) ESORICS 2019, Part I. LNCS, vol. 11735, pp. 300\u2013318. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_15"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-662-46800-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"G Barthe","year":"2015","unstructured":"Barthe, G., Bela\u00efd, S., Dupressoir, F., Fouque, P.-A., Gr\u00e9goire, B., Strub, P.-Y.: Verified proofs of higher-order masking. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015, Part I. LNCS, vol. 9056, pp. 457\u2013485. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_18"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Barthe, G., et al.: Strong non-interference and type-directed higher-order masking. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 116\u2013129. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978427","DOI":"10.1145\/2976749.2978427"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-319-56620-7_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"G Barthe","year":"2017","unstructured":"Barthe, G., Dupressoir, F., Faust, S., Gr\u00e9goire, B., Standaert, F.-X., Strub, P.-Y.: Parallel implementations of masking schemes and the bounded moment leakage model. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 535\u2013566. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_19"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-662-53140-2_2","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2016","author":"A Battistello","year":"2016","unstructured":"Battistello, A., Coron, J.-S., Prouff, E., Zeitoun, R.: Horizontal side-channel attacks and countermeasures on the ISW masking scheme. In: Gierlichs, B., Poschmann, A.Y. (eds.) CHES 2016. LNCS, vol. 9813, pp. 23\u201339. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_2"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Beierle, C., et al.: INDIANA - verifying (random) probing security through indistinguishability analysis. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0VIII. LNCS, vol. 15608, pp. 33\u201363. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91101-9_2","DOI":"10.1007\/978-3-031-91101-9_2"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Bela\u00efd, S., et al.: SoK: a methodology to achieve provable side-channel security in real-world implementations. CiC 2(1), 4 (2025). https:\/\/doi.org\/10.62056\/aebngy4e-","DOI":"10.62056\/aebngy4e-"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-030-56784-2_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Bela\u00efd","year":"2020","unstructured":"Bela\u00efd, S., Coron, J.-S., Prouff, E., Rivain, M., Taleb, A.R.: Random probing security: verification, composition, expansion and new constructions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 339\u2013368. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_12"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Bela\u00efd, S., Mercadier, D., Rivain, M., Taleb, A.R.: IronMask: versatile verification of masking security. In: 2022 IEEE Symposium on Security and Privacy, pp. 142\u2013160. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833600","DOI":"10.1109\/SP46214.2022.9833600"},{"key":"18_CR13","doi-asserted-by":"publisher","unstructured":"Bela\u00efd, S., Normand, V., Rivain, M.: Masked circuit compiler in the cardinal random probing composability framework. In: Hanaoka, G., Yang, B.Y. (eds.) ASIACRYPT\u00a02025, Part\u00a0II. LNCS, vol. 16246, pp. 375\u2013406. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-95-5096-8_12","DOI":"10.1007\/978-981-95-5096-8_12"},{"key":"18_CR14","doi-asserted-by":"publisher","unstructured":"Bela\u00efd, S., Rivain, M., Rossi, M.: New techniques for random probing security and application to raccoon signature scheme. In: Fehr, S., Fouque, P.A. (eds.) EUROCRYPT\u00a02025, Part\u00a0VIII. LNCS, vol. 15608, pp. 94\u2013123. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91101-9_4","DOI":"10.1007\/978-3-031-91101-9_4"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-030-77886-6_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"S Bela\u00efd","year":"2021","unstructured":"Bela\u00efd, S., Rivain, M., Taleb, A.R.: On the power of expansion: more efficient constructions in the random probing model. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 313\u2013343. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_11"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-92075-3_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"S Bela\u00efd","year":"2021","unstructured":"Bela\u00efd, S., Rivain, M., Taleb, A.R., Vergnaud, D.: Dynamic random probing expansion with\u00a0quasi linear asymptotic complexity. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 157\u2013188. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_6"},{"key":"18_CR17","unstructured":"Bela\u00efd, S., Cassiers, G.: PERSEUS \u2013 Probabilistic Evaluation of Random probing SEcurity Using efficient Sampling. Cryptology ePrint Archive, Paper 2025\/1884 (2025). https:\/\/eprint.iacr.org\/2025\/1884"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s13389-019-00220-8","volume":"10","author":"R Benadjila","year":"2020","unstructured":"Benadjila, R., Prouff, E., Strullu, R., Cagli, E., Dumas, C.: Deep learning for side-channel analysis and introduction to ASCAD database. J. Cryptogr. Eng. 10(2), 163\u2013188 (2020)","journal-title":"J. Cryptogr. Eng."},{"key":"18_CR19","doi-asserted-by":"publisher","unstructured":"Berti, F., Faust, S., Orlt, M.: Provable secure parallel gadgets. IACR TCHES 2023(4), 420\u2013459 (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i4.420-459","DOI":"10.46586\/tches.v2023.i4.420-459"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-030-84252-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Cassiers","year":"2021","unstructured":"Cassiers, G., Faust, S., Orlt, M., Standaert, F.-X.: Towards tight random probing security. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part III. LNCS, vol. 12827, pp. 185\u2013214. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_7"},{"key":"18_CR21","unstructured":"Cassiers, G., Momin, C.: The SMAesH dataset. Cryptology ePrint Archive, Report 2024\/1521 (2024). https:\/\/eprint.iacr.org\/2024\/1521"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Standaert, F.X.: Towards globally optimized masking: from low randomness to low noise rate. IACR TCHES 2019(2), 162\u2013198 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i2.162-198. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7389","DOI":"10.13154\/tches.v2019.i2.162-198"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-48405-1_26","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"S Chari","year":"1999","unstructured":"Chari, S., Jutla, C.S., Rao, J.R., Rohatgi, P.: Towards sound approaches to counteract power-analysis attacks. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 398\u2013412. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_26"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-55220-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Duc","year":"2014","unstructured":"Duc, A., Dziembowski, S., Faust, S.: Unifying leakage models: from probing attacks to noisy leakage. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 423\u2013440. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_24"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-34618-8_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"S Dziembowski","year":"2019","unstructured":"Dziembowski, S., Faust, S., \u017bebrowski, K.: Simple refreshing in the noisy leakage\u00a0model. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019, Part III. LNCS, vol. 11923, pp. 315\u2013344. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_11"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Faust, S., Grosso, V., Merino Del Pozo, S., Paglialonga, C., Standaert, F.X.: Composable masking schemes in the presence of physical defaults & the robust probing model. IACR TCHES 2018(3), 89\u2013120 (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i3.89-120. https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7270","DOI":"10.13154\/tches.v2018.i3.89-120"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/3-540-48059-5_15","volume-title":"Cryptographic Hardware and Embedded Systems","author":"L Goubin","year":"1999","unstructured":"Goubin, L., Patarin, J.: DES and differential power analysis the \u201cduplication\u2019\u2019 method. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 158\u2013172. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_15"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-030-03329-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"D Goudarzi","year":"2018","unstructured":"Goudarzi, D., Joux, A., Rivain, M.: How to securely compute with noisy leakage in quasilinear complexity. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 547\u2013574. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03329-3_19"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"18_CR30","doi-asserted-by":"publisher","unstructured":"Jahandideh, V., Mennink, B., Batina, L.: An algebraic approach for evaluating random probing security with application to AES. IACR TCHES 2024(4), 657\u2013689 (2024). https:\/\/doi.org\/10.46586\/tches.v2024.i4.657-689","DOI":"10.46586\/tches.v2024.i4.657-689"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/978-3-030-64837-4_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"D Knichel","year":"2020","unstructured":"Knichel, D., Sasdrich, P., Moradi, A.: SILVER \u2013 statistical independence and\u00a0leakage verification. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part I. LNCS, vol. 12491, pp. 787\u2013816. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_26"},{"key":"18_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"P Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388\u2013397. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_25"},{"key":"18_CR33","unstructured":"Mathieu-Mahias, A.: S\u00e9curisation des impl\u00e9mentations d\u2019algorithmes cryptographiques pour les syst\u00e8mes embarqu\u00e9s. Ph.D. thesis, Universit\u00e9 Paris-Saclay, France (2021). https:\/\/lmv.math.cnrs.fr\/soutenance-de-these-daxel-mathieu-mahias\/. Accessed 6 Dec 2021"},{"key":"18_CR34","doi-asserted-by":"publisher","unstructured":"Meunier, Q.L., Taleb, A.R.: Verifmsi: practical verification of hardware and software masking schemes implementations. In: di\u00a0Vimercati, S.D.C., Samarati, P. (eds.) Proceedings of the 20th International Conference on Security and Cryptography, SECRYPT 2023, Rome, Italy, 10\u201312 July 2023, pp. 520\u2013527. SCITEPRESS (2023). https:\/\/doi.org\/10.5220\/0012138600003555","DOI":"10.5220\/0012138600003555"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Picek, S., Perin, G., Mariot, L., Wu, L., Batina, L.: SoK: deep learning-based physical side-channel analysis. ACM Comput. Surv. 55(11), 227:1\u2013227:35 (2023)","DOI":"10.1145\/3569577"},{"key":"18_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38348-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"E Prouff","year":"2013","unstructured":"Prouff, E., Rivain, M.: Masking against side-channel attacks: a formal security proof. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 142\u2013159. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_9"},{"key":"18_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-15031-9_28","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"M Rivain","year":"2010","unstructured":"Rivain, M., Prouff, E.: Provably secure higher-order masking of AES. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol. 6225, pp. 413\u2013427. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15031-9_28"},{"key":"18_CR38","unstructured":"Scholz, F.: Confidence bounds & intervals for parameters relating to the binomial, negative binomial, poisson and hypergeometric distributions with applications to rare events (2008)"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:11:16Z","timestamp":1778245876000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_18","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"}}]}}