IEICE TRANSACTIONS on Information
A Two-Key-Lock-Pair Access Control Method Using Prime Factorization and Time Stamp
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E77-D No.9 pp.1042-1046
- Publication Date
- 1994/09/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Min-Shiang HWANG, Wen-Guey TZENG, Wei-Pang YANG, "A Two-Key-Lock-Pair Access Control Method Using Prime Factorization and Time Stamp" in IEICE TRANSACTIONS on Information,
vol. E77-D, no. 9, pp. 1042-1046, September 1994, doi: .
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e77-d_9_1042/_p
Copy
@ARTICLE{e77-d_9_1042,
author={Min-Shiang HWANG, Wen-Guey TZENG, Wei-Pang YANG, },
journal={IEICE TRANSACTIONS on Information},
title={A Two-Key-Lock-Pair Access Control Method Using Prime Factorization and Time Stamp},
year={1994},
volume={E77-D},
number={9},
pages={1042-1046},
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.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Two-Key-Lock-Pair Access Control Method Using Prime Factorization and Time Stamp
T2 - IEICE TRANSACTIONS on Information
SP - 1042
EP - 1046
AU - Min-Shiang HWANG
AU - Wen-Guey TZENG
AU - Wei-Pang YANG
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E77-D
IS - 9
JA - IEICE TRANSACTIONS on Information
Y1 - September 1994
AB - 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.
ER -
English
