完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hwang, SJ | en_US |
dc.contributor.author | Chang, CC | en_US |
dc.contributor.author | Yang, WP | en_US |
dc.date.accessioned | 2014-12-08T15:02:30Z | - |
dc.date.available | 2014-12-08T15:02:30Z | - |
dc.date.issued | 1996-07-01 | en_US |
dc.identifier.issn | 0916-8532 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/1172 | - |
dc.description.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. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | secret sharing | en_US |
dc.subject | threshold scheme | en_US |
dc.subject | dynamic threshold scheme | en_US |
dc.subject | discrete logarithm | en_US |
dc.title | An efficient dynamic threshold scheme | en_US |
dc.type | Article | en_US |
dc.identifier.journal | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | en_US |
dc.citation.volume | E79D | en_US |
dc.citation.issue | 7 | en_US |
dc.citation.spage | 936 | en_US |
dc.citation.epage | 942 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | 資訊工程學系 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.contributor.department | Department of Computer Science | en_US |
dc.identifier.wosnumber | WOS:A1996UZ26800004 | - |
dc.citation.woscount | 5 | - |
顯示於類別: | 期刊論文 |