Safety analysis of the dynamic-typed access matrix model

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1895, Issue , 2000, Pages 106-121

  Soshi, Masakazu ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

Access control; Access matrix model; Computational complexity; Decidability; Safety problem

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY;

ACCESS MATRIX; ACCESS MATRIX MODEL; CONSTRAINED SYSTEMS; MATRIX MODEL; MONOTONIC SYSTEMS; MONOTONICS; PROTECTION SYSTEMS; SAFETY ANALYSIS; SAFETY PROBLEMS;

ACCESS CONTROL;

EID: 84944079173     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722599_7     Document Type: Conference Paper

References (7)

1. D. Bailey. A philosophy of security management. In M. D. Abrams, S. Jajodia, and H. J. Podell, editors, Information Security: An Integrated Collection of Essays, pages 98-110. IEEE Computer Society Press, 1995.
2. S. N. Foley, L. Gong, and X. Qian. A security model of dynamic labeling providing a tiered approach to verification. In Proceedings of the IEEE Symposium on Security and Privacy, pages 142-153, 1996.
3. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-completeness. W. H. Freeman and Co., 1979.
4. M. A. Harrison, W. L. Ruzzo, and J. D. Ullman. Protection in operating systems. Commun. ACM, 19(8):461-471, Aug. 1976.
5. C. Meadows. Policies for dynamic upgrading. In S. Jajodia and C. E. Landwehr, editors, Database Security, IV: Status and Prospects, pages 241-250. Elsevier Science Publishers B. V (North-Holland), 1991.
6. R. S. Sandhu. The typed access matrix model. In Proceedings of the IEEE Symposium on Security and Privacy, pages 122-136, May 1992.
7. R. S. Sandhu. Undecidability of the safety problem for the schematic protection model with cyclic creates. J. Comput. Syst. Sci., 44(1):141-159, Feb. 1992.