{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T08:43:19Z","timestamp":1790671399173,"version":"4.1.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319752075","type":"print"},{"value":"9783319752082","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75208-2_8","type":"book-chapter","created":{"date-parts":[[2018,1,25]],"date-time":"2018-01-25T06:34:39Z","timestamp":1516862079000},"page":"123-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Connecting and Improving Direct Sum Masking and Inner Product Masking"],"prefix":"10.1007","author":[{"given":"Romain","family":"Poussier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qian","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claude","family":"Carlet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylvain","family":"Guilley","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,1,26]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Balasch, J., Faust, S., Gierlichs, B.: Inner product masking revisited. In: Oswald, E., Fischlin, M. (eds.) [30], pp. 486\u2013510. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-46800-5_19"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/978-3-642-34961-4_45","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"J Balasch","year":"2012","unstructured":"Balasch, J., Faust, S., Gierlichs, B., Verbauwhede, I.: Theory and practice of a leakage resilient masking scheme. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 758\u2013775. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_45"},{"key":"8_CR3","doi-asserted-by":"crossref","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.) [11], pp. 535\u2013566. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-56620-7_19"},{"issue":"4","key":"8_CR4","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1109\/18.850690","volume":"46","author":"I Bouyukliev","year":"2000","unstructured":"Bouyukliev, I., Jaffe, D.B., Vavrek, V.: The smallest length of eight-dimensional binary linear codes with prescribed minimum distance. IEEE Trans. Inf. Theor. 46(4), 1539\u20131544 (2000)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-662-43826-8_4","volume-title":"Information Security Theory and Practice. Securing the Internet of Things","author":"J Bringer","year":"2014","unstructured":"Bringer, J., Carlet, C., Chabanne, H., Guilley, S., Maghrebi, H.: Orthogonal direct sum masking - a smartcard friendly computation paradigm in a code, with builtin protection against side-channel and fault attacks. In: Naccache, D., Sauveron, D. (eds.) WISTP 2014. LNCS, vol. 8501, pp. 40\u201356. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43826-8_4"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-34931-7_8","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"C Carlet","year":"2012","unstructured":"Carlet, C., Danger, J.-L., Guilley, S., Maghrebi, H.: Leakage squeezing of order two. In: Galbraith, S.D., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 120\u2013139. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_8"},{"issue":"3","key":"8_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1515\/jmc-2012-0018","volume":"8","author":"C Carlet","year":"2014","unstructured":"Carlet, C., Danger, J.-L., Guilley, S., Maghrebi, H.: Leakage squeezing: optimal implementation and security evaluation. J. Math. Cryptol. 8(3), 249\u2013295 (2014)","journal-title":"J. Math. Cryptol."},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s13389-013-0067-1","volume":"4","author":"C Carlet","year":"2014","unstructured":"Carlet, C., Danger, J.-L., Guilley, S., Maghrebi, H., Prouff, E.: Achieving side-channel high-order correlation immunity with leakage squeezing. J. Cryptogr. Eng. 4(2), 107\u2013121 (2014)","journal-title":"J. Cryptogr. Eng."},{"issue":"1","key":"8_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.3934\/amc.2016.10.131","volume":"10","author":"C Carlet","year":"2016","unstructured":"Carlet, C., Guilley, S.: Complementary dual codes for counter-measures to side-channel attacks. Adv. Math. Commun. 10(1), 131\u2013150 (2016)","journal-title":"Adv. Math. Commun."},{"key":"8_CR10","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 \u201999","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.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 398\u2013412. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_26"},{"key":"8_CR11","volume-title":"EUROCRYPT 2017","year":"2017","unstructured":"Coron, J.-S., Nielsen, J.B. (eds.): EUROCRYPT 2017. LNCS, vol. 10210. Springer, Cham (2017)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-662-43933-3_21","volume-title":"Fast Software Encryption","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., Prouff, E., Rivain, M., Roche, T.: Higher-order side channel security and mask refreshing. In: Moriai, S. (ed.) FSE 2013. LNCS, vol. 8424, pp. 410\u2013424. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43933-3_21"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Duc, A., Dziembowski, S., Faust, S.: Unifying leakage models: from probing attacks to noisy leakage. In: Nguyen, P.Q., Oswald, E. (eds.) [29], pp. 423\u2013440. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-55220-5_24"},{"key":"8_CR14","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. In: Oswald, E., Fischlin, M. (eds.) [30], pp. 401\u2013429. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-662-46800-5_16"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-49890-3_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"F Durvaux","year":"2016","unstructured":"Durvaux, F., Standaert, F.-X.: From improved leakage detection to the detection of points of interests in leakage traces. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 240\u2013262. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_10"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Durvaux, F., Standaert, F.-X., Veyrat-Charvillon, N.: How to certify the leakage of a chip? In: Nguyen, P.Q., Oswald, E. (eds.) [29], pp. 459\u2013476. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-55220-5_26"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1007\/978-3-642-25385-0_38","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"S Dziembowski","year":"2011","unstructured":"Dziembowski, S., Faust, S.: Leakage-resilient cryptography from the inner-product extractor. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 702\u2013721. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_38"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-19574-7_18","volume-title":"Selected Areas in Cryptography","author":"G Fumaroli","year":"2011","unstructured":"Fumaroli, G., Martinelli, A., Prouff, E., Rivain, M.: Affine masking against higher-order side channel analysis. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 262\u2013280. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_18"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-23951-9_16","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"L Genelle","year":"2011","unstructured":"Genelle, L., Prouff, E., Quisquater, M.: Thwarting higher-order side channel analysis with additive and multiplicative maskings. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 240\u2013255. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_16"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-36400-5_16","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"JD Goli\u0107","year":"2003","unstructured":"Goli\u0107, J.D., Tymen, C.: Multiplicative masking and power analysis of AES. In: Kaliski Jr., B.S., Ko\u00e7, C.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 198\u2013212. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36400-5_16"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-23951-9_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"L Goubin","year":"2011","unstructured":"Goubin, L., Martinelli, A.: Protecting AES with Shamir\u2019s secret sharing scheme. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 79\u201394. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_6"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Goudarzi, D., Rivain, M.: How fast can higher-order masking be in software? In: Coron, J.S., Nielsen, J. (eds.) [11], pp. 567\u2013597. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-56620-7_20"},{"key":"8_CR23","unstructured":"Grassl, M.: Tables of linear codes and quantum codes (2015). http:\/\/www.codetables.de\/ . Accessed 25 Apr 2017"},{"issue":"5","key":"8_CR24","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"JH Griesmer","year":"1960","unstructured":"Griesmer, J.H.: A bound for error-correcting codes. IBM J. Res. Dev. 4(5), 532\u2013542 (1960)","journal-title":"IBM J. Res. Dev."},{"key":"8_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-06734-6_16","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2014","author":"V Grosso","year":"2014","unstructured":"Grosso, V., Prouff, E., Standaert, F.-X.: Efficient masked S-boxes processing \u2013 a step forward \u2013. In: Pointcheval, D., Vergnaud, D. (eds.) AFRICACRYPT 2014. LNCS, vol. 8469, pp. 251\u2013266. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06734-6_16"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-08302-5_3","volume-title":"Smart Card Research and Advanced Applications","author":"V Grosso","year":"2014","unstructured":"Grosso, V., Standaert, F.-X., Prouff, E.: Low entropy masking schemes, revisited. In: Francillon, A., Rohatgi, P. (eds.) CARDIS 2013. LNCS, vol. 8419, pp. 33\u201343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08302-5_3"},{"key":"8_CR27","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":"8_CR28","series-title":"Advanced Book Program\/World Science Division","volume-title":"Finite Fields. Encyclopedia of Mathematics and its Applications","author":"R Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications. Advanced Book Program\/World Science Division. Addison-Wesley Publishing Company, Boston (1983)"},{"key":"8_CR29","volume-title":"EUROCRYPT 2014","year":"2014","unstructured":"Nguyen, P.Q., Oswald, E. (eds.): EUROCRYPT 2014. LNCS, vol. 8441. Springer, Heidelberg (2014)"},{"key":"8_CR30","volume-title":"EUROCRYPT 2015","year":"2015","unstructured":"Oswald, E., Fischlin, M. (eds.): EUROCRYPT 2015. LNCS, vol. 9056. Springer, Heidelberg (2015)"},{"key":"8_CR31","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":"8_CR32","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"},{"issue":"2","key":"8_CR33","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s13389-012-0033-3","volume":"2","author":"T Roche","year":"2012","unstructured":"Roche, T., Prouff, E.: Higher-order glitch free implementation of the AES using secure multi-party computation protocols - extended version. J. Cryptogr. Eng. 2(2), 111\u2013127 (2012)","journal-title":"J. Cryptogr. Eng."},{"key":"8_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/11545262_3","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"W Schindler","year":"2005","unstructured":"Schindler, W., Lemke, K., Paar, C.: A stochastic model for differential side channel cryptanalysis. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 30\u201346. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11545262_3"},{"issue":"2","key":"8_CR35","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s13389-016-0120-y","volume":"6","author":"T Schneider","year":"2016","unstructured":"Schneider, T., Moradi, A.: Leakage assessment methodology - extended version. J. Cryptogr. Eng. 6(2), 85\u201399 (2016)","journal-title":"J. Cryptogr. Eng."},{"key":"8_CR36","unstructured":"Standaert, F.-X.: How (not) to use welch\u2019s t-test in side-channel security evaluations. IACR Cryptology ePrint Archive, 2017, p. 138 (2017)"},{"issue":"2","key":"8_CR37","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(81)90166-7","volume":"33","author":"CA Tilborg Henk van","year":"1981","unstructured":"van Tilborg Henk, C.A.: The smallest length of binary 7-dimensional linear codes with prescribed minimum distance. Discrete Math. 33(2), 197\u2013207 (1981)","journal-title":"Discrete Math."},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-319-54669-8_11","volume-title":"Smart Card Research and Advanced Applications","author":"W Wang","year":"2017","unstructured":"Wang, W., Standaert, F.-X., Yu, Y., Pu, S., Liu, J., Guo, Z., Gu, D.: Inner product masking for bitslice ciphers and security order amplification for linear leakages. In: Lemke-Rust, K., Tunstall, M. (eds.) CARDIS 2016. LNCS, vol. 10146, pp. 174\u2013191. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54669-8_11"}],"container-title":["Lecture Notes in Computer Science","Smart Card Research and Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75208-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T16:20:13Z","timestamp":1570638013000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75208-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319752075","9783319752082"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75208-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}