An Efficient Dynamic Threshold Scheme
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1996-07-25
著者
-
Hwang Shin-jia
Institute Of Computer And Information Science National Chiao Tung University
-
Hwang S‐j
The Department Of Information Management Chaoyang University Of Technology Wufeng
-
Yang W‐p
National Chiao Tung Univ. Hsinchu Twn
-
CHANG Chin-Chen
Institute of Computer Science and Information Engineering, National Chung Cheng University
-
Chang C‐c
National Chung Cheng Univ. Chiayi Twn
-
Yang Wei-pang
Institute Of Computer And Information Science National Chiao Tung University
-
Chang Chin-chen
Institute Of Computer Science And Information Engineering National Chung Cheng University
関連論文
- Generalization of Threshold Signature and Authenticated Encryption for Group Communications
- Conference Key Supervision in a Level-Based Hierarchy
- A New Efficient Server-Aided RSA Secret Computation Protocol against Active Attacks
- Two Efficient Server-Aided RSA Secret Computation Protocols Against Active Attacks
- An Efficient Dynamic Threshold Scheme
- A Mechanism for Concurrency Control in a Coupled Knowledge Base Management System
- A Dynamic Secret Sharing Scheme Based on the Factoring and Diffie-Hellman Problems
- A Survey of Key-to-Key User Hierarchic Representation Mechanisms