Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/APSCC.2006.66 | APSCC |
Keywords | Field | DocType |
hierarchy,hash function,discrete logarithm,secret sharing | Symmetric-key algorithm,Key distribution,Secure multi-party computation,Secret sharing,Computer science,Computer network,Theoretical computer science,Verifiable secret sharing,Shamir's Secret Sharing,Shared secret,Homomorphic secret sharing | Conference |
Volume | Issue | ISBN |
null | null | 0-7695-2751-5 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi Liu | 1 | 0 | 0.34 |
| Ling Zhang | 2 | 143 | 14.77 |
| Yumin Wang | 3 | 0 | 0.34 |