Design of a Reusable Secret Sharing Scheme in a Hierarchical Group

비밀조각의 재사용이 가능한 권한 위임 비밀분산법의 설계

  • 양성미 (이화여자대학교 컴퓨터학과) ;
  • 박소영 (이화여자대학교 컴퓨터학과) ;
  • 이상호 (이화여자대학교 컴퓨터학과)
  • Published : 2003.10.01

Abstract

A secret sharing scheme is a cryptographic Protocol that a dealer distributes shares about a secret to many participants and authorized subsets of the participants can reconstruct the secret. Secret sharing schemes that reflect various access structure were proposed. We propose a new reusable secret sharing scheme in a hierarchical group. Participants have priority about restoration of secret from high position level of tree. And when participants who belong in high position level are absent, they can delegate restoration competence of the secret transmitting delegation ticket to child nodes that it belongs in low rank level. By participants reuse own share and take part in different secret restoration, they who belong on hierarchical group can be possible different secret restoration by each participant's single share.

References

  1. A. Shamir, 'How to share a secret,' Communications of the ACM, vol. 22, pp. 612-613, 1979 https://doi.org/10.1145/359168.359176
  2. G. R. Blakley, 'Safeguarding cryptographic keys,' Proc. of AFIPS, vol. 48, pp. 313-317, 1979
  3. 송영원, 박소영, 이상호, '트리형태의 계층구조에 적용 가능한 비밀분산법의 설계', 한국정보과학회 논문지(컴퓨터 시스템 및 이론), 제29권 4호, 2002
  4. E. F. Brickell 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
  5. P. Morillo, C. Padro, G. Saez and J. L. Villar, 'Weighted threshold secret sharing schemes,' Information Processing Letters 70, pp. 211-216, 1999 https://doi.org/10.1016/S0020-0190(99)00070-8
  6. R. G. E. Pinch, 'Online multiple secret sharing,' Electronics Letters, vol. 32, no. 12, pp. 1087-1088, 1996 https://doi.org/10.1049/el:19960692
  7. H. Ghodosi, J. Pieprzyk, G. R. Chaudhry and J. Seberry, 'How to prevent cheating in Pinch's scheme,' Electronics Letters, vol. 33, no. 17, pp. 1453-1454, 1997 https://doi.org/10.1049/el:19970980
  8. L. Chen, D. Gollmann, C. J. Mitchell and P. Wild, 'Secret sharing with reusable polynomials,' Proc. of Information Security and Privacy - ACISP'97, LNCS, vol. 1270, pp. 183-193, 1997 https://doi.org/10.1007/BFb0027925
  9. H. M. Sun, 'On-line multiple secret sharing based a one-way function,' Computer Communications, vol. 22, pp. 745-748, 1999 https://doi.org/10.1016/S0140-3664(99)00037-7
  10. R. J. Hwang and C. C. Chang, 'An on-line secret sharing scheme for multi-secrets,' Computer Communications, vol. 21, no. 13, pp. 1170-1176, 1998 https://doi.org/10.1016/S0140-3664(98)00191-1
  11. W. B. Lee and C. C. Chang, 'A dynamic secret sharing scheme based on the factoring and Diffie-Hellman problems,' IEICE Transactions on Fundamentals of Electronics Communications & Computer Sciences, vol. E81-A, no. 8, pp. 1733-1738, 1998
  12. H. Ghodosi, J. Pieprzyk, C. Charnes and R. Safavi-Naini. 'Secrect sharing in hierarchical groups,' Proc. of Information and Communication Security-ICICS'97, LNCS, vol. 1334, pp. 81-86, 1997 https://doi.org/10.1007/BFb0028464