{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:26:19Z","timestamp":1765106779834,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819550951","type":"print"},{"value":"9789819550968","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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-981-95-5096-8_12","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:34Z","timestamp":1765106674000},"page":"375-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Masked Circuit Compiler in\u00a0the\u00a0Cardinal Random Probing Composability Framework"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9437-6425","authenticated-orcid":false,"given":"Sonia","family":"Bela\u00efd","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8862-9093","authenticated-orcid":false,"given":"Victor","family":"Normand","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9855-4161","authenticated-orcid":false,"given":"Matthieu","family":"Rivain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Secure computation with information leaking to an adversary. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd Annual ACM Symposium on Theory of Computing, pp. 715\u2013724, San Jose, CA, USA, ACM Press, 6\u20138 June\u00a02011","DOI":"10.1145\/1993636.1993731"},{"key":"12_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. LNCS, vol. 10993, pp. 427\u2013455. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_15"},{"key":"12_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. LNCS, vol. 9666, pp. 586\u2013615. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_21"},{"key":"12_CR4","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":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bela\u00efd, S., et al.: Sok: a methodology to achieve provable side-channel security in real-world implementations. IACR Commun. Cryptol. 2(1), 4 (2025)","DOI":"10.62056\/aebngy4e-"},{"key":"12_CR6","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":"12_CR7","doi-asserted-by":"crossref","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, San Francisco, CA, USA, IEEE Computer Society Press, 22\u201326 May 2022","DOI":"10.1109\/SP46214.2022.9833600"},{"key":"12_CR8","doi-asserted-by":"crossref","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.) Advances in Cryptology \u2013 EUROCRYPT 2025, pp. 94\u2013123. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-91101-9_4"},{"key":"12_CR9","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":"12_CR10","doi-asserted-by":"crossref","unstructured":"Bela\u00efd, S., Rivain, M., Taleb, A.R., Vergnaud, D.: Dynamic random probing expansion with quasi linear asymptotic complexity. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0II, volume 13091 of Lecture Notes in Computer Science, pp. 157\u2013188, Singapore, Springer, Cham, Switzerland, 6\u201310 December\u00a02021","DOI":"10.1007\/978-3-030-92075-3_6"},{"issue":"4","key":"12_CR11","doi-asserted-by":"publisher","first-page":"420","DOI":"10.46586\/tches.v2023.i4.420-459","volume":"2023","author":"F Berti","year":"2023","unstructured":"Berti, F., Faust, S., Orlt, M.: Provable secure parallel gadgets. IACR Trans. Cryptographic Hardware Embed. Syst. 2023(4), 420\u2013459 (2023)","journal-title":"IACR Trans. Cryptographic Hardware Embed. Syst."},{"key":"12_CR12","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. LNCS, vol. 12827, pp. 185\u2013214. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_7"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"162","DOI":"10.46586\/tches.v2019.i2.162-198","volume":"2019","author":"G Cassiers","year":"2019","unstructured":"Cassiers, G., Standaert, F.-X.: Towards globally optimized masking: from low randomness to low noise rate. IACR Trans. Cryptographic Hardware Embed. Syst. 2019(2), 162\u2013198 (2019)","journal-title":"IACR Trans. Cryptographic Hardware Embed. Syst."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"del Pino, R., Katsumata, S., Prest, T., Rossi, M.: Raccoon: a masking-friendly signature proven in the probing model. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02024, Part\u00a0I, volume 14920 of Lecture Notes in Computer Science, pp. 409\u2013444, Santa Barbara, CA, USA, Springer, Cham, Switzerland, 18\u201322 August\u00a02024","DOI":"10.1007\/978-3-031-68376-3_13"},{"key":"12_CR15","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":"12_CR16","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Faust, S., Zebrowski, K.: Simple refreshing in the noisy leakage model. In: Galbraith, S.D., Moriai, S. (eds.) Advances in Cryptology \u2013 ASIACRYPT\u00a02019, Part\u00a0III, volume 11923 of Lecture Notes in Computer Science, pp. 315\u2013344, Kobe, Japan, Springer, Cham, Switzerland, 8\u201312 December\u00a02019","DOI":"10.1007\/978-3-030-34618-8_11"},{"key":"12_CR17","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":"12_CR18","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"},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"657","DOI":"10.46586\/tches.v2024.i4.657-689","volume":"2024","author":"V Jahandideh","year":"2024","unstructured":"Jahandideh, V., Mennink, B., Batina, L.: An algebraic approach for evaluating random probing security with application to AES. IACR Trans. Cryptographic Hardware Embed. Syst. 2024(4), 657\u2013689 (2024)","journal-title":"IACR Trans. Cryptographic Hardware Embed. Syst."},{"key":"12_CR20","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"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5096-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:24:35Z","timestamp":1765106675000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5096-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819550951","9789819550968"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5096-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}