Advertisement

Unifying Decidability Results on Protection Systems Using Simulations

  • Constantin Enea
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3866)

Abstract

We investigate two possible definitions of simulation between protection systems. The resulting simulation relations are used to unify the proofs of decidability of the safety problem for several classes of protection systems from the literature, notably the take-grant systems ([4]) and the MTAM systems with acyclic creation graphs([9]).

Keywords

Protection System Safety Problem Access Control Model Actual Argument Simulation Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ammann, P.E., Sandhu, R.: Extending the creation operation in the schematic protection model. In: Proc. of the 6th Annual Computer Security Applications Conference, pp. 304–348 (1990)Google Scholar
  2. 2.
    Harrison, M.A., Ruzzo, W.L., Ullman, J.D.: Protection in operating systems. Communications of ACM 19(8), 461–471 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Harrison, M.A., Ruzzo, W.L.: Monotonic protection systems. In: DeMillo, R.A., et al. (eds.) Foundations of Secure Computation. Academic Press, London (1978)Google Scholar
  4. 4.
    Lipton, R.J., Snyder, L.: A linear time algorithm for deciding subject security. Journal of ACM 24(3), 455–464 (1977)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Lipton, R.J., Snyder, L.: On synchronization and security. In: Demillo, et al. (eds.) Foundations of Secure Computation. Academic Press, London (1978)Google Scholar
  6. 6.
    Milner, R.: An algebraic definition of simulation between programs. In: Proc. of the 2nd International Joint Conference on Artificial Intelligence, pp. 481–489 (1971)Google Scholar
  7. 7.
    Park, D.: Concurrency and automata on infinite sequences. In: Proc. of the 5th GI-Conference on Theoretical Computer Science, pp. 167–183 (1981)Google Scholar
  8. 8.
    Sandhu, R.: The schematic protection model: its definition and analysis for acyclic attenuating schemes. Journal of ACM 35(2), 404–432 (1988)CrossRefGoogle Scholar
  9. 9.
    Sandhu, R.: The typed access matrix model. In: Proc. of the IEEE Symposium on Research in Security and Privacy, pp. 122–136 (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Constantin Enea
    • 1
  1. 1.Faculty of Computer Science“Al.I.Cuza” University of IasiRomania

Personalised recommendations