Document Open Access Logo

Resilience of Inner-Product Masking Scheme Against Hamming Weight Leakage

Authors Aniruddha Biswas , Jihun Hwang , Hemanta K. Maji , Xiuyu Ye

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITC.2026.9.pdf
  • Filesize: 0.9 MB
  • 23 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Cryptographic primitives
  • Security and privacy → Cryptanalysis and other attacks
Keywords
  • Local leakage resilience
  • additive masking
  • inner product masking
  • Hamming weight leakage
  • Fourier analysis
  • Krawtchouk polynomials

Metrics

Abstract

Additive masking is a widely used countermeasure against side-channel attacks in which a secret is additively split into multiple random shares. However, over binary fields, the number of 1’s in the binary representation (i.e., the Hamming weight) of the shares reveals information about the original secret. Inner-product masking scheme has been proposed as a promising alternative that is secure against such information leakage.
In this work, we establish that inner-product masking over a binary extension field is provably secure against Hamming weight leakage, and it translates into security against arbitrary symmetric function leakage from the shares. In addition, we present an efficiently computable score function that quantifies its security against leakages, enabling users to test and certify its security. Finally, we derive a relationship between the leakage resilience of inner-product masking and additive masking over arbitrary fields; roughly speaking, they are at least as secure as additive masking. Our approach is Fourier-analytic and involves estimating spectral norms of the Hamming slice by studying Krawtchouk polynomials.

Cite As Get BibTex

Aniruddha Biswas, Jihun Hwang, Hemanta K. Maji, and Xiuyu Ye. Resilience of Inner-Product Masking Scheme Against Hamming Weight Leakage. In 7th Conference on Information-Theoretic Cryptography (ITC 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 385, pp. 9:1-9:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ITC.2026.9

Author Details

Aniruddha Biswas
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA
Jihun Hwang
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA
Hemanta K. Maji
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA
Xiuyu Ye
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA

Funding

  • Biswas, Aniruddha: Partly supported by CCF-2327981.
  • Maji, Hemanta K.: Partly supported by CNS-2055605 and CCF-2327981.

Acknowledgements

Authors thank Yuval Filmus for discussions on the Krawtchouk polynomial.

References

  1. Donald Q. Adams, Hemanta K. Maji, Hai H. Nguyen, Minh L. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, and Mingyuan Wang. Lower bounds for leakage-resilient secret-sharing schemes against probing attacks. In 2021 IEEE International Symposium on Information Theory (ISIT), pages 976-981, 2021. URL: https://doi.org/10.1109/ISIT45174.2021.9518230.
  2. Josep Balasch, Sebastian Faust, and Benedikt Gierlichs. Inner product masking revisited. In Elisabeth Oswald and Marc Fischlin, editors, Advances in Cryptology - EUROCRYPT 2015, Part I, volume 9056 of Lecture Notes in Computer Science, pages 486-510, Sofia, Bulgaria, April 26-30 2015. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-662-46800-5_19.
  3. Josep Balasch, Sebastian Faust, Benedikt Gierlichs, Clara Paglialonga, and François-Xavier Standaert. Consolidating inner product masking. In Tsuyoshi Takagi and Thomas Peyrin, editors, Advances in Cryptology - ASIACRYPT 2017, Part I, volume 10624 of Lecture Notes in Computer Science, pages 724-754, Hong Kong, China, December 3-7 2017. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-319-70694-8_25.
  4. Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, and Tal Rabin. On the local leakage resilience of linear secret sharing schemes. In Hovav Shacham and Alexandra Boldyreva, editors, Advances in Cryptology - CRYPTO 2018, Part I, volume 10991 of Lecture Notes in Computer Science, pages 531-561, Santa Barbara, CA, USA, August 19-23 2018. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-319-96884-1_18.
  5. Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai, and Tal Rabin. On the local leakage resilience of linear secret sharing schemes. Journal of Cryptology, 34(2):10, April 2021. URL: https://doi.org/10.1007/s00145-021-09375-2.
  6. Peter B Borwein. On the complexity of calculating factorials. Journal of Algorithms, 6(3):376-380, 1985. URL: https://doi.org/10.1016/0196-6774(85)90006-9.
  7. Luís T. A. N. Brandão and René Peralta. NIST IR 8214C: NIST first call for multi-party threshold schemes. https://csrc.nist.gov/pubs/ir/8214/c/ipd, Jan 25, 2023.
  8. Richard P Brent and Paul Zimmermann. Modern computer arithmetic, volume 18. Cambridge University Press, 2010. Google Scholar
  9. Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, and Pankaj Rohatgi. Towards sound approaches to counteract power-analysis attacks. In Michael J. Wiener, editor, Advances in Cryptology - CRYPTO'99, volume 1666 of Lecture Notes in Computer Science, pages 398-412, Santa Barbara, CA, USA, August 15-19 1999. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/3-540-48405-1_26.
  10. Thomas M. Cover and Joy A. Thomas. Elements of information theory. John Wiley & Sons, 1999. Google Scholar
  11. Ronald Cramer, Ivan Bjerre Damgård, and Jesper Buus Nielsen. Secure multiparty computation and secret sharing. Cambridge University Press, 2015. Google Scholar
  12. Diego Dominici. Asymptotic analysis of the krawtchouk polynomials by the WKB method. The Ramanujan Journal, 15:303-338, 2008. https://doi.org/10.1007/s11139-007-9078-9
  13. Alexandre Duc, Stefan Dziembowski, and Sebastian Faust. Unifying leakage models: From probing attacks to noisy leakage. In Phong Q. Nguyen and Elisabeth Oswald, editors, Advances in Cryptology - EUROCRYPT 2014, volume 8441 of Lecture Notes in Computer Science, pages 423-440, Copenhagen, Denmark, May 11-15 2014. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-642-55220-5_24.
  14. Alexandre Duc, Sebastian Faust, and François-Xavier Standaert. Making masking security proofs concrete - or how to evaluate the security of any leaking device. In Elisabeth Oswald and Marc Fischlin, editors, Advances in Cryptology - EUROCRYPT 2015, Part I, volume 9056 of Lecture Notes in Computer Science, pages 401-429, Sofia, Bulgaria, April 26-30 2015. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-662-46800-5_16.
  15. François Durvaux, François-Xavier Standaert, and Santos Merino Del Pozo. Towards easy leakage certification. In Benedikt Gierlichs and Axel Y. Poschmann, editors, Cryptographic Hardware and Embedded Systems - CHES 2016, volume 9813 of Lecture Notes in Computer Science, pages 40-60, Santa Barbara, CA, USA, August 17-19 2016. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-662-53140-2_3.
  16. François Durvaux, François-Xavier Standaert, and Nicolas Veyrat-Charvillon. How to certify the leakage of a chip? In Phong Q. Nguyen and Elisabeth Oswald, editors, Advances in Cryptology - EUROCRYPT 2014, volume 8441 of Lecture Notes in Computer Science, pages 459-476, Copenhagen, Denmark, May 11-15 2014. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-642-55220-5_26.
  17. Sebastian Faust, Loïc Masure, Elena Micheli, Maximilian Orlt, and François-Xavier Standaert. Connecting leakage-resilient secret sharing to practice: Scaling trends and physical dependencies of prime field masking. In Marc Joye and Gregor Leander, editors, Advances in Cryptology - EUROCRYPT 2024, Part IV, volume 14654 of Lecture Notes in Computer Science, pages 316-344, Zurich, Switzerland, May 26-30 2024. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-031-58737-5_12.
  18. Sebastian Faust, Loïc Masure, Elena Micheli, Hai Hoang Nguyen, Maximilian Orlt, and François-Xavier Standaert. IP masking with generic security guarantees under minimum assumptions, and applications. In 31st International Conference on the Theory and Application of Cryptology and Information Security - ASIACRYPT 2025, december 8-12 2025. Google Scholar
  19. Benedikt Gierlichs, Lejla Batina, Pim Tuyls, and Bart Preneel. Mutual information analysis. In Elisabeth Oswald and Pankaj Rohatgi, editors, Cryptographic Hardware and Embedded Systems - CHES 2008, volume 5154 of Lecture Notes in Computer Science, pages 426-442, Washington, DC, USA, August 10-13 2008. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-540-85053-3_27.
  20. Louis Goubin and Ange Martinelli. Protecting AES with Shamir’s secret sharing scheme. In Bart Preneel and Tsuyoshi Takagi, editors, Cryptographic Hardware and Embedded Systems - CHES 2011, volume 6917 of Lecture Notes in Computer Science, pages 79-94, Nara, Japan, September 28 - October 1 2011. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-642-23951-9_6.
  21. Louis Goubin and Jacques Patarin. DES and differential power analysis (the "duplication" method). In Çetin Kaya Koç and Christof Paar, editors, Cryptographic Hardware and Embedded Systems - CHES'99, volume 1717 of Lecture Notes in Computer Science, pages 158-172, Worcester, Massachusetts, USA, August 12-13 1999. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/3-540-48059-5_15.
  22. Jonathan I Hall. Notes on coding theory, 2003. URL: https://users.math.msu.edu/users/halljo/classes/CODENOTES/CODING-NOTES.HTML.
  23. G. H. Hardy, J. E. Littlewood, and G. Pólya. Inequalities. Cambridge Mathematical Library. Cambridge University Press, 1952. Google Scholar
  24. Dustin Kasser. An improvement upon the bounds for the local leakage resilience of shamir’s secret sharing scheme. In Elette Boyle and Mohammad Mahmoody, editors, TCC 2024: 22nd Theory of Cryptography Conference, Part IV, volume 15367 of Lecture Notes in Computer Science, pages 395-422, Milan, Italy, December 2-6 2024. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-031-78023-3_13.
  25. Ohad Klein and Ilan Komargodski. New bounds on the local leakage resilience of Shamir’s secret sharing scheme. In Helena Handschuh and Anna Lysyanskaya, editors, Advances in Cryptology - CRYPTO 2023, Part I, volume 14081 of Lecture Notes in Computer Science, pages 139-170, Santa Barbara, CA, USA, August 20-24 2023. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-031-38557-5_5.
  26. Paul C. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Neal Koblitz, editor, Advances in Cryptology - CRYPTO'96, volume 1109 of Lecture Notes in Computer Science, pages 104-113, Santa Barbara, CA, USA, August 18-22 1996. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/3-540-68697-5_9.
  27. Paul C. Kocher, Joshua Jaffe, and Benjamin Jun. Differential power analysis. In Michael J. Wiener, editor, Advances in Cryptology - CRYPTO'99, volume 1666 of Lecture Notes in Computer Science, pages 388-397, Santa Barbara, CA, USA, August 15-19 1999. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/3-540-48405-1_25.
  28. Ilia Krasikov. Nonnegative quadratic forms and bounds on orthogonal polynomials. Journal of Approximation Theory, 111(1):31-49, July 2001. URL: https://doi.org/10.1006/jath.2001.3570.
  29. Florence Jessie MacWilliams and Neil James Alexander Sloane. The theory of error-correcting codes, volume 16. North-Holland Publishing Company, 1977. Google Scholar
  30. Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, and Mingyuan Wang. Leakage-resilience of the shamir secret-sharing scheme against physical-bit leakages. In Anne Canteaut and François-Xavier Standaert, editors, Advances in Cryptology - EUROCRYPT 2021, Part II, volume 12697 of Lecture Notes in Computer Science, pages 344-374, Zagreb, Croatia, October 17-21 2021. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-030-77886-6_12.
  31. Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, Tom Suad, Mingyuan Wang, Xiuyu Ye, and Albert Yu. Tight estimate of the local leakage resilience of the additive secret-sharing scheme & its consequences. In Dana Dachman-Soled, editor, ITC 2022: 3rd Conference on Information-Theoretic Cryptography, volume 230 of Leibniz International Proceedings in Informatics (LIPIcs), pages 16:1-16:19, Cambridge, MA, USA, July 5-7 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ITC.2022.16.
  32. Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, and Mingyuan Wang. Improved bound on the local leakage-resilience of shamir’s secret sharing. In IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022, pages 2678-2683. IEEE, 2022. URL: https://doi.org/10.1109/ISIT50566.2022.9834695.
  33. Hemanta K. Maji, Hai H. Nguyen, Anat Paskin-Cherniavsky, and Xiuyu Ye. Constructing leakage-resilient Shamir’s secret sharing: Over composite order fields. In Marc Joye and Gregor Leander, editors, Advances in Cryptology - EUROCRYPT 2024, Part IV, volume 14654 of Lecture Notes in Computer Science, pages 286-315, Zurich, Switzerland, May 26-30 2024. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-031-58737-5_11.
  34. Hemanta K. Maji, Anat Paskin-Cherniavsky, Tom Suad, and Mingyuan Wang. Constructing locally leakage-resilient linear secret-sharing schemes. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology - CRYPTO 2021, Part III, volume 12827 of Lecture Notes in Computer Science, pages 779-808, Virtual Event, August 16-20 2021. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-030-84252-9_26.
  35. James L. Massey. Some applications of coding theory in cryptography. Codes and Ciphers: Cryptography and Coding IV, pages 33-47, 1995. Google Scholar
  36. Colin McDiarmid. Concentration, pages 195-248. Springer Berlin Heidelberg, Berlin, Heidelberg, 1998. URL: https://doi.org/10.1007/978-3-662-12788-9_6.
  37. Hai H. Nguyen. Towards breaking the half-barrier of local leakage-resilient shamir’s secret sharing. In Leonid Reyzin and Douglas Stebila, editors, Advances in Cryptology - CRYPTO 2024, Part V, volume 14924 of Lecture Notes in Computer Science, pages 257-285, Santa Barbara, CA, USA, August 18-22 2024. Springer, Cham, Switzerland. URL: https://doi.org/10.1007/978-3-031-68388-6_10.
  38. Ryan O'Donnell. Analysis of boolean functions. Cambridge University Press, 2021. Available online as URL: https://arxiv.org/abs/2105.10386.
  39. Emmanuel Prouff and Thomas Roche. Higher-order glitches free implementation of the AES using secure multi-party computation protocols. In Bart Preneel and Tsuyoshi Takagi, editors, Cryptographic Hardware and Embedded Systems - CHES 2011, volume 6917 of Lecture Notes in Computer Science, pages 63-78, Nara, Japan, September 28 - October 1 2011. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-642-23951-9_5.
  40. François-Xavier Standaert, Tal Malkin, and Moti Yung. A unified framework for the analysis of side-channel key recovery attacks. In Antoine Joux, editor, Advances in Cryptology - EUROCRYPT 2009, volume 5479 of Lecture Notes in Computer Science, pages 443-461, Cologne, Germany, April 26-30 2009. Springer Berlin Heidelberg, Germany. URL: https://doi.org/10.1007/978-3-642-01001-9_26.
  41. Jacobus Hendricus van Lint. Introduction to coding theory, volume 86. Springer Science & Business Media, 1998. Google Scholar
  42. Joachim von zur Gathen and Victor Shoup. Computing frobenius maps and factoring polynomials. Computational Complexity, 2:187-224, September 1992. URL: https://doi.org/10.1007/BF01272074.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact