Abstract
He and Dawson proposed a multi-stage secret sharing scheme based on one-way function. In that scheme, many secrets are reconstructed stage-by-stage in the dealer's predetermined order, and only one secret shadow is kept by every participant. When all the secrets have been reconstructed, the dealer needs not redistribute fresh shadows to every participant. Later, Harn further improved the He-Dawson scheme to reduce the total number of public values. However, in this paper, we will show that both the He-Dawson scheme and Ham's scheme are one-time-use schemes and that many secrets cannot in fact be reconstructed stage-by-stage. At the same time, we shall also modify the He-Dawson scheme to improve the drawbacks above and show the improved scheme can be applied.
| Original language | English |
|---|---|
| Pages (from-to) | 48-55 |
| Number of pages | 8 |
| Journal | Operating Systems Review (ACM) |
| Volume | 39 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2005 Dec 1 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications
Cite this
}
A new multi-stage secret sharing scheme using one-way function. / Chang, Ting Yi; Hwang, Min Shiang; Yang, Wei Pang.
In: Operating Systems Review (ACM), Vol. 39, No. 1, 01.12.2005, p. 48-55.Research output: Contribution to journal › Article
TY - JOUR
T1 - A new multi-stage secret sharing scheme using one-way function
AU - Chang, Ting Yi
AU - Hwang, Min Shiang
AU - Yang, Wei Pang
PY - 2005/12/1
Y1 - 2005/12/1
N2 - He and Dawson proposed a multi-stage secret sharing scheme based on one-way function. In that scheme, many secrets are reconstructed stage-by-stage in the dealer's predetermined order, and only one secret shadow is kept by every participant. When all the secrets have been reconstructed, the dealer needs not redistribute fresh shadows to every participant. Later, Harn further improved the He-Dawson scheme to reduce the total number of public values. However, in this paper, we will show that both the He-Dawson scheme and Ham's scheme are one-time-use schemes and that many secrets cannot in fact be reconstructed stage-by-stage. At the same time, we shall also modify the He-Dawson scheme to improve the drawbacks above and show the improved scheme can be applied.
AB - He and Dawson proposed a multi-stage secret sharing scheme based on one-way function. In that scheme, many secrets are reconstructed stage-by-stage in the dealer's predetermined order, and only one secret shadow is kept by every participant. When all the secrets have been reconstructed, the dealer needs not redistribute fresh shadows to every participant. Later, Harn further improved the He-Dawson scheme to reduce the total number of public values. However, in this paper, we will show that both the He-Dawson scheme and Ham's scheme are one-time-use schemes and that many secrets cannot in fact be reconstructed stage-by-stage. At the same time, we shall also modify the He-Dawson scheme to improve the drawbacks above and show the improved scheme can be applied.
UR - http://www.scopus.com/inward/record.url?scp=33646519145&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33646519145&partnerID=8YFLogxK
U2 - 10.1145/1044552.1044557
DO - 10.1145/1044552.1044557
M3 - Article
AN - SCOPUS:33646519145
VL - 39
SP - 48
EP - 55
JO - Operating Systems Review (ACM)
JF - Operating Systems Review (ACM)
SN - 0163-5980
IS - 1
ER -