Weighted Secret Sharing Scheme

가중치를 갖는 비밀분산법

  • 박소영 (이화여자대학교 컴퓨터학과 과학기술대학원) ;
  • 이상호 (이화여자대학교 컴퓨터학과) ;
  • 권대성 (한국전자통신연구원 부설 국가보안기술연구소)
  • Published : 2002.04.01

Abstract

A secret sharing scheme is a kind of cryptographic protocol to maintain secret information by splitting it to many small pieces of shares and sharing between shareholders. In case of shareholders having different authorization to reconstruct the original secret, it is required a new secret sharing scheme to reflect any hierarchical structure between shareholders. In this paper, we propose a new weighted secret sharing scheme, that is, each shareholder has a weight according to the authorization of reconstructing the secret and an access set which is a subset of shareholders can reconstruct the secret if the sum of weights is equal or greater than a predefined threshold.

References

  1. G. R. Blakley, 'Safeguarding Cryptographic Keys,' Proceeding of AFIPS, vol. 48, pp. 313-317, 1979
  2. A. Shamir, 'How to Share a Secret,' Communication of the ACM, vol. 22, pp. 612-613, 1979 https://doi.org/10.1145/359168.359176
  3. J. Benaloh, J. Leichter, 'Generalized Secret Sharing and Monotone Functions,' In Advances in Cryptology-CRYPTO '88, Lecture Notes in Computer Science, vol. 403, pp. 27-35, 1990
  4. C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, 'On the Information Rate of Secret Sharing Schemes,' Theoretical Computer Science, vol. 154(2), pp. 283-306, 1996 https://doi.org/10.1016/0304-3975(95)00065-8
  5. E. F. Brckell and D. M. Davenport, 'On the Classification of Ideal Secret Sharing Scheme,' Journal of Cryptology, vol. 4, pp. 123-134, 1991 https://doi.org/10.1007/BF00196772
  6. P. Morillo, C. Padro, G. Saez, J. L. Villar, 'Weighted Threshold Secret sharing Schemes,' Information Processsing Letters 70, pp. 211-216, 1999 https://doi.org/10.1016/S0020-0190(99)00070-8
  7. E. F. Brickell and D. R. Stinson, 'Some Improved Bounds on the Infromation Rate of Perfect Secret Sharing Schemes,' Journal of Cryptology, vol. 5, pp. 153-166, 1992 https://doi.org/10.1007/BF02451112
  8. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, 'On the Size of Shares for Secret Sharing Schemes,' Journal of Crytology, vol. 6, pp. 157-169, 1993 https://doi.org/10.1007/BF00198463
  9. C. Blundo, A. De Santis, D.R. Stinson, and U. Vaccaro, 'Graph Decompositions and Secret Sharing Schemes,' in Advances in Cryptology EUROCRYPT '92, Lecture Notes in Computer Science, vol. 658, pp. 1-24, 1994
  10. G.J. Simmons, 'How to (Really) Share a Secret,' In Advances in Cryptology-CRYPTO '88, Lecture Notes in Computer Science, vol. 403, pp. 390-448, 1990