Full metadata record
DC FieldValueLanguage
dc.contributor.authorHwang, SJen_US
dc.contributor.authorChang, CCen_US
dc.contributor.authorYang, WPen_US
dc.date.accessioned2014-12-08T15:02:30Z-
dc.date.available2014-12-08T15:02:30Z-
dc.date.issued1996-07-01en_US
dc.identifier.issn0916-8532en_US
dc.identifier.urihttp://hdl.handle.net/11536/1172-
dc.description.abstractTo 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.isoen_USen_US
dc.subjectsecret sharingen_US
dc.subjectthreshold schemeen_US
dc.subjectdynamic threshold schemeen_US
dc.subjectdiscrete logarithmen_US
dc.titleAn efficient dynamic threshold schemeen_US
dc.typeArticleen_US
dc.identifier.journalIEICE TRANSACTIONS ON INFORMATION AND SYSTEMSen_US
dc.citation.volumeE79Den_US
dc.citation.issue7en_US
dc.citation.spage936en_US
dc.citation.epage942en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1996UZ26800004-
dc.citation.woscount5-
Appears in Collections:Articles