Bisimulation and unwinding for verifying possibilistic security properties

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

Volumn 2575, Issue , 2003, Pages 223-237

  Bossi, Annalisa ^a   Focardi, Riccardo ^a   Piazza, Carla ^a   Rossi, Sabina ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BISIMULATIONS; COMPOSITIONALITY; EQUIVALENCE RELATIONS; INFORMATION FLOW SECURITY; POSSIBILISTIC; REFINEMENT OPERATORS; SECURE SYSTEM; SECURITY PROPERTIES;

MODEL CHECKING;

EID: 35248852380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36384-x_19     Document Type: Article

References (35)

1. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. Bisimulation and unwinding for verifying possibilistic security properties. Technical Report CS-2002-15, Dipartimento di Informatica, Università Ca' Foscari di Venezia, Italy, 2002. http://www.dsi.unive.it/ricerca/TR/index.htm.
2. A. Bossi, R. Focardi, C. Piazza, and S. Rossi. A Proof System for Information Flow Security. In M. Leuschel, editor, Proc. of Int. Workshop on Logic Based Program Development and Transformation, LNCS. Springer-Verlag, 2002. To appear.
3. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. In Proc. of the 19th Symposium on Theory of Computing, pages 1-6, 1987.
4. R. Focardi and R. Gorrieri. A Classification of Security Properties for Process Algebras. Journal of Computer Security, 3(1):5-33, 1994/1995.
5. R. Focardi and R. Gorrieri. The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties. IEEE Transactions on Software Engineering, 23(9):550-571, 1997.
6. R. Focardi and R. Gorrieri. Classification of Security Properties (Part I: Information Flow). In R. Focardi and R. Gorrieri, editors, Foundations of Security Analysis and Design, volume 2171 of LNCS. Springer-Verlag, 2001.
7. R. Focardi, C. Piazza, and S. Rossi. Proof Methods for Bisimulation based Information Flow Security. In A. Cortesi, editor, Proc. of Int. Workshop on Verification, Model Checking and Abstract Interpretation, volume 2294 of LNCS, pages 16-31. Springer-Verlag, 2002.
8. R. Focardi and S. Rossi. Information Flow Security in Dynamic Contexts. In Proc. of the IEEE Computer Security Foundations Workshop, pages 307-319. IEEE Computer Society Press, 2002.
9. S. N. Foley. A Universal Theory of Information Flow. In Proc. of the IEEE Symposium on Security and Privacy, pages 116-122. IEEE Computer Society Press, 1987.
10. R. Forster. Non-interference Properties for Nondeterministic Processes. PhD thesis, Oxford University Computing Laboratory, 1999.
11. J. A. Goguen and J. Meseguer. Security Policies and Security Models. In Proc. of the IEEE Symposium on Security and Privacy, pages 11-20. IEEE Computer Society Press, 1982.
12. J. A. Goguen and J. Meseguer. Inference Control and Unwinding. In Proc. of the IEEE Symposium on Security and Privacy, pages 75-86. IEEE Computer Society Press, 1984.
13. J. Graham-Cumming and J. W. Sanders. On the Refinement of Non-interference. In Proc. of the IEEE Computer Security Foundations Workshop, pages 35-42. IEEE Computer Society Press, 1991.
14. J. Jacob. On the Derivation of Secure Components. In Proc. of the IEEE Symposium on Security and Privacy, pages 242-247. IEEE Computer Society Press, 1989.
15. D. M. Johnson and F. J. Thayer. Security and the Composition of Machines. In Proc. of of the IEEE Computer Security Foundations Workshop, pages 72-89. IEEE Computer Society Press, 1988.
16. H. Mantel. Possibilistic Definitions of Security - An Assebly Kit -. In Proc. of the IEEE Symposium on Security and Privacy, pages 185-199. IEEE Computer Society Press, 2000.
17. H. Mantel. Unwinding Possibilistic Security Properties. In Proc. of the European Symposium on Research in Computer Security, volume 2895 of LNCS, pages 238-254. Springer-Verlag, 2000.
18. H. Mantel. Preserving Information Flow Properties under Refinement. In Proc. of the IEEE Symposium on Security and Privacy, pages 78-91. IEEE Computer Society Press, 2001.
19. H. Mantel. On the Composition of Secure Systems. In Proc. of the IEEE Symposium on Security and Privacy, pages 88-101. IEEE Computer Society Press, 2002.
20. F. Martinelli. Partial Model Checking and Theorem Proving for Ensuring Security Properties. In Proc. of the IEEE Computer Security Foundations Workshop, pages 44-52. IEEE Computer Society Press, 1998.
21. D. McCullough. Specifications for Multi-Level Security and a Hook-Up Property. In Proc. of the IEEE Symposium on Security and Privacy, pages 161-166. IEEE Computer Society Press, 1987.
22. J. McLean. Security Models and Information Flow. In Proc. of the IEEE Symposium on Security and Privacy, pages 180-187. IEEE Computer Society Press, 1990.
23. J. McLean. A General Theory of Composition for Trace Sets Closed under Selective Interleaving Functions. In Proc. of the IEEE Symposium on Security and Privacy, pages 79-93. IEEE Computer Society Press, 1994.
24. J. McLean. Security Models. Encyclopedia of Software Engineering, 1994.
25. J. McLean. A General Theory of Composition for a Class of "Possibilistic" Security Properties. IEEE Trabsactions on Software Engineering, 22(1):53-67, 1996.
26. J. K. Millen. Unwinding Forward Correctability. In Proc. of the IEEE Computer Security Foundations Workshop, pages 2-10. IEEE Computer Society Press, 1994.
27. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
28. C. O'Halloran. A Calculus of Information Flow. In Proc. of the European Symposium on Research in Security and Privacy, pages 180-187. AFCET, 1990.
29. C. O'Halloran. Refinement and Confidentiality. In Proc. of the 5th Refinement Workshop, pages 119-139, 1992.
30. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973-989, 1987.
31. A. W. Roscoe, J. C. P. Woodcock, and L. Wulf. Non-interference through Determinism. In Proc. of the European Symposium on Research in Computer Security, volume 875 of LNCS, pages 33-53. Springer-Verlag, 1994.
32. P. Y. A. Ryan. A CSP Formulation of Non-interference and Unwinding. Cipher, pages 19-27, 1991.
33. S. Schneider. May Testing, Non-Interference, and Compositionality. Electronic Notes in Theoretical Computer Science, 40, 2000.
34. D. Sutherland. A Model of Information. In Proc. of the 9th National Computer Security Conference, pages 175-183, 1986.
35. A. Zakinthinos and E. S. Lee. A General Theory of Security Properties. In Proc. of the IEEE Symposium on Security and Privacy, pages 74-102. IEEE Computer Society Press, 1997.