Efficient Secret Sharing with Access Structures in a Hierarchy

  • Authors:
  • Chu-Hsing Lin;Wei Lee

  • Affiliations:
  • Tunghai University;Tunghai University

  • Venue:
  • AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.