Access control is one of the sezious problems in modern information system. In this paper we suggest a key-lock strategy to represent the privilege relationship involving linear transformations and nonlinear conetraints. The implementation shows that this strategy has got the properties of security, and information hidden, and satisfies the least privilege principle. This distributed management of sensitive data adapts the distributed systems well.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
E. L. Leiss, Principles of Data Security, Plenum Press, New York, 1982.
J. L. Peterson & A. Silberschatz, Operating System Concepts, Addison-Wesley Pub., Inc., 1983.
M. L. Wu & T. Y. Hwang, Access control with single-key-lock,IEEE Trans. on SE-10: 2 (1984), 185–190.
D. E. R. Denning, Cryptography and Data Security, Addison-Wesley Pub., Inc. 1981.
Xie Bangjie, Linear Algebra, Peoples Education Press, 1978.
Φ. P. Γ AHTMAXEP, Matrix Theory, College Education Press, 1955.
About this article
Cite this article
Huang, G., Liu, J. A key-lock access control. J. of Comput. Sci. & Technol. 2, 236–243 (1987). https://doi.org/10.1007/BF02973508
- Access Control
- Nonsingular Matrix
- Control Word
- Elementary Operation
- High Matrix