A Dynamic Secret Sharing Scheme Based on the Factoring and Diffie-Hellman Problems

スポンサーリンク

概要

• 論文の詳細を見る

• Secret sharing schemes are good for protecting the important secrets. They are, however, inefficient if the secret shadow held by the shadowholder cannot be reused after recovering the shared secret. Traditionally, the(t, n)secret sharing scheme can be used only once, where t is the threshold value and n is the number of participants. To improve the efficiency, we propose an efficient dynamic secret sharing scheme. In the new scheme, each shadowholder holds a secret key and the corresponding public key. The secret shadow is constructed from the secret key in our scheme, while in previously proposed secret sharing schemes the secret key is the shadow. In addition, the shadow is not constructed by the shadowholder unless it is necessary, and no secure delivery channel is needed. Morever, this paper will further discuss how to change the shared secret, the threshold policy and cheater detection. Therefore, this scheme provides an efficient way to maintain important secrets.

• 社団法人電子情報通信学会の論文
• 1998-08-25

著者

• CHANG Chin-Chen

  Institute of Computer Science and Information Engineering, National Chung Cheng University

• Lee Wei-bin

  Institute Of Computer Science And Information Engineering National Chung Cheng University

• Chang Chin-chen

  Institute Of Computer Science And Information Engineering National Chung Cheng University

関連論文

• Conference Key Supervision in a Level-Based Hierarchy
• An Efficient Dynamic Threshold Scheme
• A Dynamic Secret Sharing Scheme Based on the Factoring and Diffie-Hellman Problems
• A Survey of Key-to-Key User Hierarchic Representation Mechanisms

スポンサーリンク