To improve the efficiency for the threshold schemes, the major problem is that the secret shadows cannot be reused after renewing or recovering the shared secret. However, if the secret shadows cannot be reused, the established threshold scheme is limited to be used only once. It is inefficient to reconstruct the whole secret sharing system. Therefore, we introduce an efficient dynamic threshold scheme. In the new scheme, the shadowholders can reuse the secret shadows no matter that the shared secret is renewed or recovered. In addition, the new scheme provides a way by which the dealer can renew the shared secret or reconstruct the secret sharing system, efficiently. Therefore, this scheme is good for maintaining the important secrets.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shin-Jia HWANG, Chin-Chen CHANG, Wei-Pang YANG, "An Efficient Dynamic Threshold Scheme" in IEICE TRANSACTIONS on Information,
vol. E79-D, no. 7, pp. 936-942, July 1996, doi: .
Abstract: To improve the efficiency for the threshold schemes, the major problem is that the secret shadows cannot be reused after renewing or recovering the shared secret. However, if the secret shadows cannot be reused, the established threshold scheme is limited to be used only once. It is inefficient to reconstruct the whole secret sharing system. Therefore, we introduce an efficient dynamic threshold scheme. In the new scheme, the shadowholders can reuse the secret shadows no matter that the shared secret is renewed or recovered. In addition, the new scheme provides a way by which the dealer can renew the shared secret or reconstruct the secret sharing system, efficiently. Therefore, this scheme is good for maintaining the important secrets.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_7_936/_p
Copy
@ARTICLE{e79-d_7_936,
author={Shin-Jia HWANG, Chin-Chen CHANG, Wei-Pang YANG, },
journal={IEICE TRANSACTIONS on Information},
title={An Efficient Dynamic Threshold Scheme},
year={1996},
volume={E79-D},
number={7},
pages={936-942},
abstract={To improve the efficiency for the threshold schemes, the major problem is that the secret shadows cannot be reused after renewing or recovering the shared secret. However, if the secret shadows cannot be reused, the established threshold scheme is limited to be used only once. It is inefficient to reconstruct the whole secret sharing system. Therefore, we introduce an efficient dynamic threshold scheme. In the new scheme, the shadowholders can reuse the secret shadows no matter that the shared secret is renewed or recovered. In addition, the new scheme provides a way by which the dealer can renew the shared secret or reconstruct the secret sharing system, efficiently. Therefore, this scheme is good for maintaining the important secrets.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - An Efficient Dynamic Threshold Scheme
T2 - IEICE TRANSACTIONS on Information
SP - 936
EP - 942
AU - Shin-Jia HWANG
AU - Chin-Chen CHANG
AU - Wei-Pang YANG
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 1996
AB - To improve the efficiency for the threshold schemes, the major problem is that the secret shadows cannot be reused after renewing or recovering the shared secret. However, if the secret shadows cannot be reused, the established threshold scheme is limited to be used only once. It is inefficient to reconstruct the whole secret sharing system. Therefore, we introduce an efficient dynamic threshold scheme. In the new scheme, the shadowholders can reuse the secret shadows no matter that the shared secret is renewed or recovered. In addition, the new scheme provides a way by which the dealer can renew the shared secret or reconstruct the secret sharing system, efficiently. Therefore, this scheme is good for maintaining the important secrets.
ER -