Hierarchical Take-Grant Protection systems

ABSTRACT

The application of the Take-Grant Protection Model to hierarchical protection systems is explored. The proposed model extends the results of Wu [7] and applies the results of Bishop and Snyder [2] to obtain necessary and sufficient conditions for a hierarchical protection graph to be secure. In addition, restrictions on the take and grant rules are developed that ensure the security of all graphs generated by these restricted rules.

REFERENCES

• 1: Bell, D. and LaPadula, L., "Secure Computer Systems: Mathematical Foundations and Model," Technical Report M74-244, The Mitre Corporation, Bedford, MS (October 1974).
• 2: Matt Bishop , Lawrence Snyder, The transfer of information and authority in a protection system, Proceedings of the seventh ACM symposium on Operating systems principles, p.45-54, December 10-12, 1979, Pacific Grove, California, United States [doi>10.1145/800215.806569]
• 3: Dorothy E. Denning, A lattice model of secure information flow, Communications of the ACM, v.19 n.5, p.236-243, May 1976 [doi>10.1145/360051.360056]
• 4: Denning, D., Cryptography and Data Security. to be published.
• 5: Jones, A., Lipton, R., and Snyder, L., "A Linear Time Algorithm for Deciding Security," Proc. 17th Annual Symp. on Foundations of Computer Science, (1976).
• 6: R. J. Lipton , L. Snyder, A Linear Time Algorithm for Deciding Subject Security, Journal of the ACM (JACM), v.24 n.3, p.455-464, July 1977 [doi>10.1145/322017.322025]
• 7: Margaret Schlosser Wu, Hierarchical protection systems, 1980

INDEX TERMS

Primary Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.6 Security and Protection

Additional Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.7 Organization and Design

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory

General Terms:
Design, Security, Theory