|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b10. 学術雑誌論文等 >
b10-1. 雑誌掲載論文 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/4453
|
| タイトル: | Efficient and Unconditionally Secure Verifiable Threshold Changeable Scheme |
| 著者: | Maeda, Ayako
Miyaji, Atsuko
Tada, Mitsuru |
| 発行日: | 2001 |
| 出版者: | Springer |
| 誌名: | Lecture Notes in Computer Science |
| 巻: | 2119/2001 |
| 開始ページ: | 403 |
| 終了ページ: | 416 |
| DOI: | 10.1007/3-540-47719-5 |
| 抄録: | In this paper, we describe how to construct an efficient and unconditionally secure verifiable threshold changeable scheme, in which any participants can verify whether the share given by the dealer is correct or not, in which the combiner can verify whether the pooled shares are correct or not, and in which the threshold can be updated plural times to the values determined in advance. An optimal threshold changeable scheme was defined and given by Martin et. al., and an unconditionally secure verifiable threshold scheme was given by Pedersen. Martin's scheme is based on Blakley's threshold scheme whereas Pedersen's is based on Shamir's. Hence these two schemes cannot directly be combined. Then we first construct an almost optimal threshold changeable scheme based on Shamir's, and after that using Pedersen's scheme, construct a unconditionally secure verifiable threshold scheme in which the threshold can be updated plural times, say N times. Furthermore, our method can decrease the amount of information the dealer has to be publish, comparing with simply applying Pedersen's scheme N times. |
| Rights: | This is the author-created version of Springer, Ayako Maeda, Atsuko Miyaji, Mitsuru Tada, Lecture Notes in Computer Science, 2119/2001, 2001, 403-416.The original publication is available at www.springerlink.com, http://www.springerlink.com/content/tjg8l80fl2qcx3w4 |
| URI: | http://hdl.handle.net/10119/4453 |
| 資料タイプ: | author |
| 出現コレクション: | b10-1. 雑誌掲載論文 (Journal Articles)
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| 73-45.pdf | | 171Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
