Browse > Article

Design of a Secret Sharing Scheme in a Tree-structured Hierarchy  

Song, Yeong-Won (Dept.of Computer, Ewah Wonan's University)
Park, So-Young (Dept.of Computer, Ewah Wonan's University)
Lee, Sang-Ho (Dept.of Computer, Ewah Wonan's University)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.29, no.3, 2002 , pp. 161-168 More about this Journal
Abstract
A secret sharing scheme is a cryptographic protocol to share a secret among a set of participants P in the way that only qualified subsets of P can reconstruct the secret whereas any other subset of P, non-qualified to know the secret, cannot determine anything about the secret. In this paper, we propose a new secret sharing scheme in hierarchical groups, whose hierarchy can be represented as a tree structure. In the tree structure, participants of higher levels have priorities to reconstruct the secret over participants of lower levels. In the absence of the participant of a higher level, it is possible for this participant to delegate the ability to reconstruct the secret to the child nodes of the next lower level through the transfer of his delegation ticket. This scheme has a dynamic access structure through the recursive delegation process from the root to lower levels where participants aren't absent.
Keywords
Cryptography; Secret Sharing;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 C. Blundo, A. Cresti, A. De Santis, L. Gargano, and U. Vaccaro, 'Fully Dynamic Secret Sharing Schemes,' Advances in Cryptology-CRYPTO'93 Lecture Notes in Computer Science, vol. 773, pp. 110-125, 1994
2 K. M. Martin, 'Untrustworthy Participants in Perfect Secret Sharing Schemes,' In Cryptology and Coding Ⅲ, pp. 255-264, 1993
3 H. Ghodsi, J. Pieprzyk, C. Charnes, and R. Safavi-Naini, 'Cyptosystems for Hierarchical Groups,' Information Security and Privacy - ACISP'96, Lecture Notes in Computer Science, pp. 275-286, 1996   DOI   ScienceOn
4 G. J. Simmons, 'How to (Really) Share a Secret,' Advances in Cryptology - Crypto'88, Lecture Notes in Computer Science, vol. 403, pp. 390-448, 1990
5 E. F. Brickell and D. R. Stinson, 'Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes,' Journal of Cryptology, vol. 5, pp. 153-166, 1992   DOI
6 D. R. Stinson, 'An Explication of Secret Sharing Schemes,' Designs, Codes and Cryptography, vol. 2, pp. 357-390, 1992   DOI
7 J. Benaloh and 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
8 D. R. Stinson and S. A. Vanstone, 'A Combinational Approach to Threshold Schemes,' Advances in Cryptology - Proceedings of CRYPTO'87, vol. 293, pp. 330-339, 1988
9 G. J. Simmons, W. Jackson and K. Martin, 'The Geometry of Shared Secret Schemes,' Bulletin of the ICA, vol. 1, pp. 71-88, 1991
10 E. D. Karnin, J. W. Greene and M. E. Hellman, 'On Secret Sharing Systems,' IEEE Transactions on Information Theory, vol. IT-29, no. 1, pp. 35-41, 1983
11 H. Ghodosi, J. Pieprzyk, C. Charnes and R. Safavi-Naini, 'Secret Sharing in Hierarchical Groups,' Information and Communication Security - ICICS'97, Lecture Notes in Computer Science, vol. 1334, pp. 81-86, 1997   DOI   ScienceOn
12 G. J. Simmons, 'Prepositioned Shared Secret and/or Shared Control Schemes,' Advances in Cryptology - EUROCRYPT'89, Lecture Notes in Computer Science, vol. 434, pp. 436-467, 1990
13 A. Shamir, 'How to Share a Secret,' Communications of the ACM, vol. 22, pp. 612-613, 1979   DOI   ScienceOn
14 G. R. Blakley, 'Safeguarding Cryptographic Keys,' AFIPS Conference Proceedings, vol. 48, pp. 313-317, 1979