Full metadata record
DC FieldValueLanguage
dc.contributor.authorCHANG, CCen_US
dc.contributor.authorHWANG, RJen_US
dc.contributor.authorWU, TCen_US
dc.date.accessioned2014-12-08T15:04:55Z-
dc.date.available2014-12-08T15:04:55Z-
dc.date.issued1992-05-01en_US
dc.identifier.issn0306-4379en_US
dc.identifier.urihttp://hdl.handle.net/11536/3437-
dc.description.abstractA cryptographic key assignment scheme for access control in a user hierarchy is proposed. The users and their owned information items are classified into disjoint sets of security classes where the hierarchy on security classes is an arbitrary partial order. Based on Newton's interpolation method and a predefined one-way function, each security class C(i) is assigned a secret key SK(i) and some public parameters (P1i, P2i). The information items owned by the security class C(i) are encrypted by an available symmetric cryptosystem with the enciphering key SK(i). Through the computing of the assigned security key and the public parameters, only the security class in the higher level can derive any of his successors' secret keys. Thus, only the security classes in the higher level can access the information items owned by the security classes in the lower level. We also show that our proposed scheme is not only secure but also practical.en_US
dc.language.isoen_USen_US
dc.subjectACCESS CONTROLen_US
dc.subjectKEY GENERATION ALGORITHMen_US
dc.subjectNEWTON INTERPOLATION POLYNOMIALSen_US
dc.subjectONE-WAY FUNCTIONen_US
dc.subjectPARTIALLY ORDERED SETen_US
dc.titleCRYPTOGRAPHIC KEY ASSIGNMENT SCHEME FOR ACCESS-CONTROL IN A HIERARCHYen_US
dc.typeArticleen_US
dc.identifier.journalINFORMATION SYSTEMSen_US
dc.citation.volume17en_US
dc.citation.issue3en_US
dc.citation.spage243en_US
dc.citation.epage247en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1992JA88700003-
dc.citation.woscount35-
Appears in Collections:Articles