{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:12Z","timestamp":1786978872164,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587368","type":"print"},{"value":"9783031587375","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-58737-5_13","type":"book-chapter","created":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T07:01:52Z","timestamp":1714201312000},"page":"345-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["From Random Probing to\u00a0Noisy Leakages Without Field-Size Dependence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5352-9763","authenticated-orcid":false,"given":"Gianluca","family":"Brian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6914-6425","authenticated-orcid":false,"given":"Stefan","family":"Dziembowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8625-4639","authenticated-orcid":false,"given":"Sebastian","family":"Faust","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,28]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Secure computation with information leaking to an adversary, pp. 715\u2013724 (2011)","DOI":"10.1145\/1993636.1993731"},{"key":"13_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":"13_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":"13_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":"13_CR5","unstructured":"B\u00e9guinot, J., et al.: Removing the field size loss from Duc et al.\u2019s conjectured bound for masked encodings. Cryptology ePrint Archive, Report 2022\/1738 (2022). https:\/\/eprint.iacr.org\/2022\/1738"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bela\u00efd, S., Mercadier, D., Rivain, M., Taleb, A.R.: IronMask: versatile verification of masking security, pp. 142\u2013160 (2022)","DOI":"10.1109\/SP46214.2022.9833600"},{"key":"13_CR7","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":"13_CR8","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":"13_CR9","doi-asserted-by":"crossref","unstructured":"Brian, G., Dziembowski, S., Faust, S.: From random probing to noisy leakages without field-size dependence. Cryptology ePrint Archive, Paper 2024\/339 (2024). https:\/\/eprint.iacr.org\/2024\/339","DOI":"10.1007\/978-3-031-58737-5_13"},{"key":"13_CR10","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"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Cassiers, G., Standaert, F.-X.: Towards globally optimized masking: from low randomness to low noise rate 2019(2), 162\u2013198 (2019). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/7389","DOI":"10.46586\/tches.v2019.i2.162-198"},{"key":"13_CR12","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":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-45727-3_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"J-S Coron","year":"2020","unstructured":"Coron, J.-S., Greuet, A., Zeitoun, R.: Side-channel masking with pseudo-random generator. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 342\u2013375. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_12"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Rondepierre, F., Zeitoun, R.: High order masking of look-up tables with common shares 2018(1):40\u201372 (2018). https:\/\/tches.iacr.org\/index.php\/TCHES\/article\/view\/832","DOI":"10.46586\/tches.v2018.i1.40-72"},{"key":"13_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":"13_CR16","doi-asserted-by":"crossref","unstructured":"Duc, A., Faust, S., Standaert, F.-X.: Making masking security proofs concrete (or how to evaluate the security of any leaking device), extended version 32(4), 1263\u20131297 (2019)","DOI":"10.1007\/s00145-018-9277-0"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-662-46803-6_6","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"S Dziembowski","year":"2015","unstructured":"Dziembowski, S., Faust, S., Skorski, M.: Noisy leakage revisited. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 159\u2013188. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_6"},{"key":"13_CR18","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":"13_CR19","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":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential power analysis, pp. 388\u2013397 (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-74143-5_8","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"U Maurer","year":"2007","unstructured":"Maurer, U., Pietrzak, K., Renner, R.: Indistinguishability amplification. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 130\u2013149. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_8"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-030-26948-7_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Prest","year":"2019","unstructured":"Prest, T., Goudarzi, D., Martinelli, A., Passel\u00e8gue, A.: Unifying leakage models on a R\u00e9nyi Day. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 683\u2013712. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_24"},{"key":"13_CR24","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 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58737-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T00:03:43Z","timestamp":1777248223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58737-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587368","9783031587375"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58737-5_13","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":"28 April 2024","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":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","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":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}