Hierarchical Take-Grant Protection Systems

Citation

• M. Bishop, “Hierarchical Take-Grant Protection Systems,” Proceedings of the Eighth Symposium in Operating Systems Principles pp. 109–122 (Dec. 1981). DOI: 10.1145/1067627.806598

Paper

• Publisher’s version (free, goes to the ACM Digital Library)  
• Publisher’s version (behind a paywall; contact the author for a copy)

Bibliographic Information

• DOI: 10.1145/1067627.806598
• BibTeX
• EndNote

Abstract

The application of the Take-Grant Protection Model to hierarchical protection systems is explored. The proposed model extends the results of Wu and applies the results of Bishop and Snyder 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.

Copyright Notice

©1981 by the Association for Computing Machinery (ACM). The definitive version was published in Proceedings of the Eighth Symposium in Operating Systems Principles, 1981, and is available at http://dx.doi.org/10.1145/1067627.806598.