Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A key-lock access control

Abstract

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.

References

  1. [1]

    E. L. Leiss, Principles of Data Security, Plenum Press, New York, 1982.

  2. [2]

    J. L. Peterson & A. Silberschatz, Operating System Concepts, Addison-Wesley Pub., Inc., 1983.

  3. [3]

    M. L. Wu & T. Y. Hwang, Access control with single-key-lock,IEEE Trans. on SE-10: 2 (1984), 185–190.

  4. [4]

    D. E. R. Denning, Cryptography and Data Security, Addison-Wesley Pub., Inc. 1981.

  5. [5]

    Xie Bangjie, Linear Algebra, Peoples Education Press, 1978.

  6. [6]

    Φ. P. Γ AHTMAXEP, Matrix Theory, College Education Press, 1955.

Download references

Author information

Rights and permissions

Reprints and Permissions

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

Download citation

Keywords

  • Access Control
  • Nonsingular Matrix
  • Control Word
  • Elementary Operation
  • High Matrix