The Community for Technology Leaders
19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) (2005)
Taipei, Taiwan
Mar. 25, 2005 to Mar. 30, 2005
ISSN: 1550-445X
ISBN: 0-7695-2249-1
pp: 123-126
Chu-Hsing Lin , Tunghai University
Wei Lee , Tunghai University
ABSTRACT
In 2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithm to reuse shadows, and adopted Cho [4]mechanism to achieve theproperties of hierarchical key management. However, Changk scheme requires a lot of time for computation. In this paper, we adopt one-way hash function to allow the shadows to be reused and achieve the properties of hierarchical access control. The proposed scheme is more efficient than Changk scheme.
INDEX TERMS
secret sharing, access structure, hierarchical key management, discrete logarithm algorithm, one-way hash function
CITATION

C. Lin and W. Lee, "Efficient Secret Sharing with Access Structures in a Hierarchy," 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)(AINA), Taipei, Taiwan, 2005, pp. 123-126.
doi:10.1109/AINA.2005.173
94 ms
(Ver 3.3 (11022016))