Efficient Secret Sharing with Access Structures in a Hierarchy

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 logarithmto reuse shadows, and adopted Cho [4]mechanism to achieve theproperties of hierarchical key management. However, Changk scheme requires a lot of time for computation. 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 more than Changk scheme.

• Type: Conference
• Year: 2005
• Where: AINA
• Authors: Chu-Hsing Lin, Wei Lee
• Keywords: AINA 2005, Computer Networks, Hierarchical Key Management, Logarithmto Reuse Shadows, One-way Hash Function