Skip to main content

Unifying Decidability Results on Protection Systems Using Simulations

  • Conference paper
  • 293 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNSC,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]).

The research reported in this paper was partially supported by the program ECO-NET 08112WJ/2004-2005 and by the National University Research Council of Romania, grants CNCSIS 632/28/2004 and CNCSIS 632/50/2005.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Harrison, M.A., Ruzzo, W.L., Ullman, J.D.: Protection in operating systems. Communications of ACM 19(8), 461–471 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  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. Lipton, R.J., Snyder, L.: A linear time algorithm for deciding subject security. Journal of ACM 24(3), 455–464 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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. Sandhu, R.: The schematic protection model: its definition and analysis for acyclic attenuating schemes. Journal of ACM 35(2), 404–432 (1988)

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Enea, C. (2006). Unifying Decidability Results on Protection Systems Using Simulations. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds) Formal Aspects in Security and Trust. FAST 2005. Lecture Notes in Computer Science, vol 3866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11679219_8

Download citation

  • DOI: https://doi.org/10.1007/11679219_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-32628-1

  • Online ISBN: 978-3-540-32629-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics