完整後設資料紀錄
DC 欄位語言
dc.contributor.authorSUN, HMen_US
dc.contributor.authorSHIEH, SPen_US
dc.date.accessioned2014-12-08T15:03:42Z-
dc.date.available2014-12-08T15:03:42Z-
dc.date.issued1994-11-25en_US
dc.identifier.issn0020-0190en_US
dc.identifier.urihttp://hdl.handle.net/11536/2231-
dc.description.abstractAn (m, n) threshold scheme is to decompose the master key K into n secret shadows in such a way that the master key K cannot be reclaimed unless any m shadows are collected. However, any m-1 or fewer shadows provide absolutely no information about K. In 1989, Laih et al. proposed the concept of dynamic threshold schemes which allow the master key to be updated without changing the secret shadows. However, the perfect dynamic threshold scheme, which provides perfect secrecy though the master key is allowed to be changed, has not been proposed. Nor has any paper shown the existence of perfect dynamic threshold schemes. In this paper, we prove that perfect dynamic threshold schemes do not exist when their master keys need be updated [log(2)Llog(2)K] times or more without changing the secret shadows, where L is the secret shadow space and K is the master key space. Furthermore, we propose an perfect dynamic threshold scheme which allows its master key to be updated once without changing the secret shadows.en_US
dc.language.isoen_USen_US
dc.subjectSAFETY/SECURITY IN DIGITAL SYSTEMSen_US
dc.subjectCRYPTOGRAPHYen_US
dc.subjectDYNAMIC THRESHOLD SCHEMEen_US
dc.subjectINFORMATION THEORYen_US
dc.titleON DYNAMIC THRESHOLD SCHEMESen_US
dc.typeArticleen_US
dc.identifier.journalINFORMATION PROCESSING LETTERSen_US
dc.citation.volume52en_US
dc.citation.issue4en_US
dc.citation.spage201en_US
dc.citation.epage206en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1994PR79300005-
dc.citation.woscount7-
顯示於類別:期刊論文


文件中的檔案:

  1. A1994PR79300005.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。