Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | HWANG, MS | en_US |
dc.contributor.author | TZENG, WG | en_US |
dc.contributor.author | YANG, WP | en_US |
dc.date.accessioned | 2014-12-08T15:03:47Z | - |
dc.date.available | 2014-12-08T15:03:47Z | - |
dc.date.issued | 1994-09-01 | en_US |
dc.identifier.issn | 0916-8532 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/2327 | - |
dc.description.abstract | Many 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.iso | en_US | en_US |
dc.subject | ACCESS CONTROL | en_US |
dc.subject | KEY-LOCK-PAIR | en_US |
dc.subject | PRIME FACTORIZATION THEOREM | en_US |
dc.subject | TIME STAMP | en_US |
dc.title | A 2-KEY-LOCK-PAIR ACCESS-CONTROL METHOD USING PRIME FACTORIZATION AND TIME STAMP | en_US |
dc.type | Article | en_US |
dc.identifier.journal | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | en_US |
dc.citation.volume | E77D | en_US |
dc.citation.issue | 9 | en_US |
dc.citation.spage | 1042 | en_US |
dc.citation.epage | 1046 | 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:A1994PJ01900014 | - |
dc.citation.woscount | 5 | - |
Appears in Collections: | Articles |