Full metadata record
DC FieldValueLanguage
dc.contributor.authorHWANG, MSen_US
dc.contributor.authorTZENG, WGen_US
dc.contributor.authorYANG, WPen_US
dc.date.accessioned2014-12-08T15:03:47Z-
dc.date.available2014-12-08T15:03:47Z-
dc.date.issued1994-09-01en_US
dc.identifier.issn0916-8532en_US
dc.identifier.urihttp://hdl.handle.net/11536/2327-
dc.description.abstractMany methods, based on the concept of key-lock-pair have been proposed for access control in computer protection systems. However, the proposed methods still either lack of dynamic ability or need quite a lot of computation in performing requests of deleting users/files, inserting users/files, or updating access rights of users to files. In this paper we propose a two-key-lock-pair access control method that is based on the unique factorization theorem and a time stamp mechanism. Our method is dynamic and needs a minimum amount of computation in the sense that it only updates at most one key/lock for each access request, which has not been achieved before.en_US
dc.language.isoen_USen_US
dc.subjectACCESS CONTROLen_US
dc.subjectKEY-LOCK-PAIRen_US
dc.subjectPRIME FACTORIZATION THEOREMen_US
dc.subjectTIME STAMPen_US
dc.titleA 2-KEY-LOCK-PAIR ACCESS-CONTROL METHOD USING PRIME FACTORIZATION AND TIME STAMPen_US
dc.typeArticleen_US
dc.identifier.journalIEICE TRANSACTIONS ON INFORMATION AND SYSTEMSen_US
dc.citation.volumeE77Den_US
dc.citation.issue9en_US
dc.citation.spage1042en_US
dc.citation.epage1046en_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:A1994PJ01900014-
dc.citation.woscount5-
Appears in Collections:Articles