By Topic

Improved Secret Sharing with Access Structures in a Hierarchy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yi Liu ; South China University of Technology, China ; Ling Zhang ; Yumin Wang

In 2004, Chang et al. presented an approach firstly to solve the problem of secret sharing with access structures in a hierarchy. After that, based on one way hash function, another proposed scheme was suggested by Lin et al. However, there is the same drawback in both schemes. When group secret keys need to be changed, the trust authority has to update related parameters of each branch in both the above schemes. In this paper, using discrete logarithm, an improved secret sharing with access structures in a hierarchy is given. It can achieve the property that related parameters do not have to update even if group secret keys are altered. So, the presented scheme may be more suitable for applications

Published in:

2006 IEEE Asia-Pacific Conference on Services Computing (APSCC'06)

Date of Conference:

Dec. 2006