Unwinding possibilistic security properties

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

Volumn 1895, Issue , 2000, Pages 238-254

  Mantel, Heiko ^a  

^a GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE DFKI   (Germany)

Author keywords

Information flow; Refinement; Security models; Unwinding

Indexed keywords

COMPUTERS;

CONDITION; DETERMINISTIC SYSTEMS; INFORMATION FLOWS; NON INTERFERENCE; NONDETERMINISTIC SYSTEMS; POSSIBILISTIC; REFINEMENT; SECURITY MODELING; SECURITY PROPERTIES; UNWINDING THEOREMS;

ARTIFICIAL INTELLIGENCE;

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

References (21)

1. Bowen Alpern and Fred B. Schneider. Defining Liveness. Information Processing Letters, 21:181–185, 1985. North-Holland.
2. Riccardo Focardi and Roberto Gorrieri. A Classification of Security Properties for Process Algebras. Journal of Computer Security, 3(1):5–33, 1995.
3. Simon N. Foley. A Universal Theory of Information Flow. In Proceedings of the IEEE Symposium on Security and Privacy, pages 116–122, 1987.
4. John Graham-Cumming and J.W. Sanders. On the Refinement of Noninterference. In Proceedings of the IEEE Computer Security Foundations Workshop, pages 35–42, 1991.
5. J.A. Goguen and J. Meseguer. Security Policies and Security Models. Proceedings of the IEEE Symposium on Security and Privacy, pages 11–20, 1982.
6. J.A. Goguen and J. Meseguer. Inference Control and Unwinding. In Proceedings of the IEEE Symposium on Security and Privacy, pages 75–86, 1984.
7. Jeremy Jacob. On the Derivation of Secure Components. In Proceedings of the IEEE Symposium on Security and Privacy, pages 242–247, 1989.
8. Jeremy Jacob. Categorising Non-interference. In Proceedings of the Computer Security Workshop, pages 44–50, 1990.
9. Nancy Lynch and Frits Vaandrager. Forward and Backward Simulations, Part I: Untimed Systems. Information and Computation, 121(2):214–233, September 1995.
10. Heiko Mantel. Possibilistic Definitions of Security –An Assembly Kit–. In Proceedings of the IEEE Computer Security Foundations Workshop, 2000.
11. Daryl McCullough. Specifications for Multi-Level Security and a Hook-Up Property. In Proceedings of the IEEE Symposium on Security and Privacy, pages 161–166, 1987.
12. John McLean. A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions. In Proceedings of the IEEE Symposium on Research in Security and Privacy, pages 79–93, 1994.
13. Jonathan K. Millen. Unwinding Forward Correctability. In Proceedings of the Computer Security Foundations Workshop, pages 2–10, 1994.
14. Colin O’Halloran. A Calculus of Information Flow. In Proceedings of the European Symposium on Research in Computer Security, ESORICS 90, 1990.
15. P.Y.A. Ryan and S.A. Schneider. Process Algebra and Non-interference. In Proceedings of the 12th IEEE Computer Security Foundations Workshop, pages 214–227, 1999.
16. John Rushby. Noninterference, Transitivity, and Channel-Control Security Policies. Technical Report CSL-92-02, SRI International, 1992.
17. A.W. Roscoe, J.C.P. Woodcock, and L. Wulf. Non-interference through Determinism. In Proceedings of the European Symposium on Research in Computer Security (ESORICS), LNCS 875, pages 33–53. Springer, 1994.
18. P.Y.A. Ryan. A CSP Formulation of Non-Interference and Unwinding. Cipher, pages 19–30, Winter 1991.
19. D. Sutherland. A Model of Information. In Proceedings of 9th National Computer Security Conference, 1986.
20. R.J. van Glabbeek. The Linear Time – Branching Time Spectrum. In Proceedings of CONCUR’90, Theories of Concurrency: Unification and Extensions, LNCS 458, pages 278–297. Springer, 1990.
21. A. Zakinthinos and E.S. Lee. A General Theory of Security Properties. Proceedings of the IEEE Symposium on Security and Privacy, pp. 94–102, 1997.