A new multi-stage secret sharing scheme using one-way function

Ting Yi Chang, Min Shiang Hwang, Wei Pang Yang

Research output: Contribution to journalArticle

38 Citations (Scopus)

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 languageEnglish
Pages (from-to)48-55
Number of pages8
JournalOperating Systems Review (ACM)
Volume39
Issue number1
DOIs
Publication statusPublished - 2005 Dec 1

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Chang, Ting Yi ; Hwang, Min Shiang ; Yang, Wei Pang. / A new multi-stage secret sharing scheme using one-way function. In: Operating Systems Review (ACM). 2005 ; Vol. 39, No. 1. pp. 48-55.
@article{228cdc6028e54d519e64f5903a6dbd4a,
title = "A new multi-stage secret sharing scheme using one-way function",
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.",
author = "Chang, {Ting Yi} and Hwang, {Min Shiang} and Yang, {Wei Pang}",
year = "2005",
month = "12",
day = "1",
doi = "10.1145/1044552.1044557",
language = "English",
volume = "39",
pages = "48--55",
journal = "Operating Systems Review (ACM)",
issn = "0163-5980",
publisher = "Association for Computing Machinery (ACM)",
number = "1",

}

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 journalArticle

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 -