Document Open Access Logo

Leakage-Resilience of Shamir’s Secret Sharing: Identifying Secure Evaluation Places

Authors Jihun Hwang , Hemanta K. Maji , Hai H. Nguyen , Xiuyu Ye

PDF

File

Thumbnail PDF
PDF
LIPIcs.ITC.2025.3.pdf
  • Filesize: 0.88 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Cryptographic primitives
  • Security and privacy → Cryptanalysis and other attacks
Keywords
  • Shamir’s secret sharing
  • leakage resilience
  • physical bit probing
  • secure evaluation places
  • secure modulus choice
  • square wave families
  • LLL algorithm
  • Fourier analysis

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Can Shamir’s secret-sharing protect its secret even when all shares are partially compromised? 
For instance, repairing Reed-Solomon codewords, when possible, recovers the entire secret in the corresponding Shamir’s secret sharing. Yet, Shamir’s secret sharing mitigates various side-channel threats, depending on where its "secret-sharing polynomial" is evaluated. Although most evaluation places yield secure schemes, none are known explicitly; even techniques to identify them are unknown. Our work initiates research into such classifier constructions and derandomization objectives. 
In this work, we focus on Shamir’s scheme over prime fields, where every share is required to reconstruct the secret. We investigate the security of these schemes against single-bit probes into shares stored in their native binary representation. Technical analysis is particularly challenging when dealing with Reed-Solomon codewords over prime fields, as observed recently in the code repair literature. Furthermore, ensuring the statistical independence of the leakage from the secret necessitates the elimination of any subtle correlations between them. 
In this context, we present:  
1) An efficient algorithm to classify evaluation places as secure or vulnerable against the least-significant-bit leakage. 
2) Modulus choices where the classifier above extends to any single-bit probe per share. 
3) Explicit modulus choices and secure evaluation places for them.  On the way, we discover new bit-probing attacks on Shamir’s scheme, revealing surprising correlations between the leakage and the secret, leading to vulnerabilities when choosing evaluation places naïvely.
Our results rely on new techniques to analyze the security of secret-sharing schemes against side-channel threats. We connect their leakage resilience to the orthogonality of square wave functions, which, in turn, depends on the 2-adic valuation of rational approximations. These techniques, novel to the security analysis of secret sharings, can potentially be of broader interest.

Cite As Get BibTex

Jihun Hwang, Hemanta K. Maji, Hai H. Nguyen, and Xiuyu Ye. Leakage-Resilience of Shamir’s Secret Sharing: Identifying Secure Evaluation Places. In 6th Conference on Information-Theoretic Cryptography (ITC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 343, pp. 3:1-3:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ITC.2025.3

Author Details

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
Hai H. Nguyen
  • Department of Computer Science, ETH, Zürich, Switzerland
Xiuyu Ye
  • Department of Computer Science, Purdue University, West Lafayette, IN, USA

Funding

  • Maji, Hemanta K.: Partly supported by CNS-2055605 and CCF-2327981.
  • Nguyen, Hai H.: Partly supported by the Zurich Information Security & Privacy Center (ZISC), ETH Zurich.

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 IEEE International Symposium on Information Theory ISIT 2021, 2021. Google Scholar
  2. Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, and Mark Simkin. Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In Alexandra Boldyreva and Daniele Micciancio, editors, CRYPTO 2019, Part II, volume 11693 of LNCS, pages 510-539. Springer, Heidelberg, August 2019. URL: https://doi.org/10.1007/978-3-030-26951-7_18.
  3. Saikrishna Badrinarayanan and Akshayaram Srinivasan. Revisiting non-malleable secret sharing. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT 2019, Part I, volume 11476 of LNCS, pages 593-622. Springer, Heidelberg, May 2019. URL: https://doi.org/10.1007/978-3-030-17653-2_20.
  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, CRYPTO 2018, Part I, volume 10991 of LNCS, pages 531-561. Springer, Heidelberg, August 2018. URL: https://doi.org/10.1007/978-3-319-96884-1_18.
  5. Allison Bishop, Valerio Pastro, Rajmohan Rajaraman, and Daniel Wichs. Essentially optimal robust secret sharing with maximal corruptions. In Marc Fischlin and Jean-Sébastien Coron, editors, EUROCRYPT 2016, Part I, volume 9665 of LNCS, pages 58-86. Springer, Heidelberg, May 2016. URL: https://doi.org/10.1007/978-3-662-49890-3_3.
  6. Andrej Bogdanov, Yuval Ishai, and Akshayaram Srinivasan. Unconditionally secure computation against low-complexity leakage. In Alexandra Boldyreva and Daniele Micciancio, editors, CRYPTO 2019, Part II, volume 11693 of LNCS, pages 387-416. Springer, Heidelberg, August 2019. URL: https://doi.org/10.1007/978-3-030-26951-7_14.
  7. Viktor Bouniakowsky. Sur les diviseurs numériques invariables des fonctions rationnelles entieres. De l'Imprimerie de l'Académie impériale des sciences, 1854. Google Scholar
  8. Luís T. A. N. Brandão and René Peralta. NIST first call for multi-party threshold schemes. https://csrc.nist.gov/publications/detail/nistir/8214c/draft, January 25, 2023.
  9. Nishanth Chandran, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, and Sruthi Sekar. Short leakage resilient and non-malleable secret sharing schemes. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO 2022, Part I, volume 13507 of LNCS, pages 178-207. Springer, Heidelberg, August 2022. URL: https://doi.org/10.1007/978-3-031-15802-5_7.
  10. Suresh Chari, Charanjit S. Jutla, Josyula R. Rao, and Pankaj Rohatgi. Towards sound approaches to counteract power-analysis attacks. In Michael J. Wiener, editor, CRYPTO'99, volume 1666 of LNCS, pages 398-412. Springer, Heidelberg, August 1999. URL: https://doi.org/10.1007/3-540-48405-1_26.
  11. Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Ashutosh Kumar, Xin Li, Raghu Meka, and David Zuckerman. Extractors and secret sharing against bounded collusion protocols. In 61st FOCS, pages 1226-1242. IEEE Computer Society Press, November 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00117.
  12. Roni Con, Noah Shutty, Itzhak Tamo, and Mary Wootters. Repairing reed-solomon codes over prime fields via exponential sums. In 2023 IEEE International Symposium on Information Theory (ISIT), pages 1330-1335. IEEE, 2023. URL: https://doi.org/10.1109/ISIT54713.2023.10206937.
  13. Roni Con and Itzhak Tamo. Nonlinear repair of reed-solomon codes. IEEE Trans. Inf. Theory, 68(8):5165-5177, 2022. URL: https://doi.org/10.1109/TIT.2022.3167615.
  14. 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, pages 316-344, Cham, 2024. Springer Nature Switzerland. URL: https://doi.org/10.1007/978-3-031-58737-5_12.
  15. Serge Fehr and Chen Yuan. Towards optimal robust secret sharing with security against a rushing adversary. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT 2019, Part III, volume 11478 of LNCS, pages 472-499. Springer, Heidelberg, May 2019. URL: https://doi.org/10.1007/978-3-030-17659-4_16.
  16. Serge Fehr and Chen Yuan. Robust secret sharing with almost optimal share size and security against rushing adversaries. In Rafael Pass and Krzysztof Pietrzak, editors, TCC 2020, Part III, volume 12552 of LNCS, pages 470-498. Springer, Heidelberg, November 2020. URL: https://doi.org/10.1007/978-3-030-64381-2_17.
  17. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Alfred Aho, editor, 19th ACM STOC, pages 218-229. ACM Press, May 1987. URL: https://doi.org/10.1145/28395.28420.
  18. Louis Goubin and Jacques Patarin. DES and differential power analysis (the "duplication" method). In Çetin Kaya Koç and Christof Paar, editors, CHES'99, volume 1717 of LNCS, pages 158-172. Springer, Heidelberg, August 1999. URL: https://doi.org/10.1007/3-540-48059-5_15.
  19. Vipul Goyal and Ashutosh Kumar. Non-malleable secret sharing. In Ilias Diakonikolas, David Kempe, and Monika Henzinger, editors, 50th ACM STOC, pages 685-698. ACM Press, June 2018. URL: https://doi.org/10.1145/3188745.3188872.
  20. Venkatesan Guruswami and Mary Wootters. Repairing reed-solomon codes. In Daniel Wichs and Yishay Mansour, editors, 48th ACM STOC, pages 216-226. ACM Press, June 2016. URL: https://doi.org/10.1145/2897518.2897525.
  21. Venkatesan Guruswami and Mary Wootters. Repairing reed-solomon codes. IEEE Trans. Inf. Theory, 63(9):5684-5698, 2017. URL: https://doi.org/10.1109/TIT.2017.2702660.
  22. Alfréd Haar. Aur theorie der orthogonalen funcktionensysteme. Math. Annalen, 69:331-371, 1910. Google Scholar
  23. Jonathan I. Hall. Notes on coding theory. https://users.math.msu.edu/users/halljo/classes/codenotes/GRS.pdf, 2015.
  24. JL Hammond Jr and RS Johnson. A review of orthogonal square-wave functions and their application to linear networks. Journal of the Franklin Institute, 273(3):211-225, 1962. Google Scholar
  25. Walter J Harrington and John W Cell. A set of square-wave functions orthogonal and complete in l₂ (0, 2). Duke Math. J., 28(1):393-407, 1961. Google Scholar
  26. Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, and Mor Weiss. The price of active security in cryptographic protocols. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT 2020, Part II, volume 12106 of LNCS, pages 184-215. Springer, Heidelberg, May 2020. URL: https://doi.org/10.1007/978-3-030-45724-2_7.
  27. Jihun Hwang, Hemanta K. Maji, Hai H. Nguyen, and Xiuyu Ye. Security of shamir’s secret-sharing against physical bit leakage: Secure evaluation places. https://www.cs.purdue.edu/homes/hmaji/papers/HMNY24.pdf, 2023.
  28. Paul C. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In Neal Koblitz, editor, CRYPTO'96, volume 1109 of LNCS, pages 104-113. Springer, Heidelberg, August 1996. URL: https://doi.org/10.1007/3-540-68697-5_9.
  29. Paul C. Kocher, Joshua Jaffe, and Benjamin Jun. Differential power analysis. In Michael J. Wiener, editor, CRYPTO'99, volume 1666 of LNCS, pages 388-397. Springer, Heidelberg, August 1999. URL: https://doi.org/10.1007/3-540-48405-1_25.
  30. Ashutosh Kumar, Raghu Meka, and Amit Sahai. Leakage-resilient secret sharing against colluding parties. In David Zuckerman, editor, 60th FOCS, pages 636-660. IEEE Computer Society Press, November 2019. URL: https://doi.org/10.1109/FOCS.2019.00045.
  31. Jeffrey C Lagarias. The computational complexity of simultaneous diophantine approximation problems. SIAM Journal on Computing, 14(1):196-209, 1985. URL: https://doi.org/10.1137/0214016.
  32. Arjen K Lenstra, Hendrik Willem Lenstra, and László Lovász. Factoring polynomials with rational coefficients. Mathematische annalen, 261(ARTICLE):515-534, 1982. Google Scholar
  33. 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, EUROCRYPT 2021, Part II, volume 12697 of LNCS, pages 344-374. Springer, Heidelberg, October 2021. URL: https://doi.org/10.1007/978-3-030-77886-6_12.
  34. 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, 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA, volume 230 of LIPIcs, pages 16:1-16:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.ITC.2022.16.
  35. 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, pages 286-315. Springer Nature Switzerland, 2024. URL: https://doi.org/10.1007/978-3-031-58737-5_11.
  36. Pasin Manurangsi, Akshayaram Srinivasan, and Prashant Nalini Vasudevan. Nearly optimal robust secret sharing against rushing adversaries. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO 2020, Part III, volume 12172 of LNCS, pages 156-185. Springer, Heidelberg, August 2020. URL: https://doi.org/10.1007/978-3-030-56877-1_6.
  37. Moni Naor, Benny Pinkas, and Omer Reingold. Distributed pseudo-random functions and kdcs. In International conference on the theory and applications of cryptographic techniques, pages 327-346. Springer, 1999. URL: https://doi.org/10.1007/3-540-48910-X_23.
  38. Hai Nguyen. Physical bit leakage resilience of linear code-based secret sharing. In Eurocrypt 2025. Springer, 2025. Google Scholar
  39. Hans Rademacher. Einige sätze über reihen von allgemeinen orthogonalfunktionen. Mathematische Annalen, 87(1-2):112-138, 1922. Google Scholar
  40. Adi Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11):612-613, November 1979. URL: https://doi.org/10.1145/359168.359176.
  41. Akshayaram Srinivasan and Prashant Nalini Vasudevan. Leakage resilient secret sharing and applications. In Alexandra Boldyreva and Daniele Micciancio, editors, CRYPTO 2019, Part II, volume 11693 of LNCS, pages 480-509. Springer, Heidelberg, August 2019. URL: https://doi.org/10.1007/978-3-030-26951-7_17.
  42. R Titsworth. Coherent detection by quasi-orthogonal square-wave pulse functions (corresp.). IRE Transactions on Information Theory, 6(3):410-411, 1960. URL: https://doi.org/10.1109/TIT.1960.1057575.
  43. Anastassios Voudouris, Ilias Politis, and Christos Xenakis. Secret sharing a key in a distributed way, lagrange vs newton. In Proceedings of the 17th International Conference on Availability, Reliability and Security, ARES '22, New York, NY, USA, 2022. Association for Computing Machinery. URL: https://doi.org/10.1145/3538969.3544424.
  44. Joseph L Walsh. A closed set of normal orthogonal functions. American Journal of Mathematics, 45(1):5-24, 1923. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

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