Verifying persistent security properties

Computer Languages, Systems and Structures

Volumn 30, Issue 3-4 SPEC. ISS., 2004, Pages 231-258

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

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Noninterference; Process algebra; Security; Verification

Indexed keywords

COMPUTER CONTROL; COMPUTER NETWORKS; COMPUTER SIMULATION; CRYPTOGRAPHY; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION DISSEMINATION; NETWORK PROTOCOLS; SECURITY OF DATA; SECURITY SYSTEMS; SEMANTICS; UNIX; USER INTERFACES;

BISIMULATION SEMANTICS; NONINTERFERENCE; PROCESS ALGEBRA; VERIFICATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 3242706680     PISSN: 14778424     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cl.2004.02.005     Document Type: Conference Paper

References (54)

1. Bossi A., Focardi R., Piazza C., Rossi S. Bisimulation and unwinding for verifying possibilistic security properties. Zuck L.D., Attie P.C., Cortesi A., Mukhopadhyay S. Proceedings of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'03), vol. 2575 of Lecture Notes in Computer Science. 2003;223-237 Springer, Berlin.
2. Bell DE, Padula LJJ, Secure Computer Systems: Unified Exposition and Multics Interpretation, ESD-TR-75-306, MITRE MTR-2997.
3. Tsai CR, Gligor VD, Chandersekaran CS. On the identification of covert storage channels in secure systems. IEEE Transactions on Software Engineering 1990; 569-80.
4. Millen JK. Finite-state noiseless covert channels., In: Proceedings of the Computer Security Foundations Workshop II, the MITRE Corporation. Silver Spring, MD: IEEE Computer Society Press, 1989. p. 81-6.
5. Goguen JA, Meseguer J. Security policies and security models. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'82). Silver Spring, MD: IEEE Computer Society Press; 1982. p. 11-20.
6. Goguen JA, Meseguer J. Inference control and unwinding. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'84). Silver Spring, MD: IEEE Computer Society Press; 1984. p. 75-86.
7. Sutherland D. A model of information. In: Proceedings of the Ninth National Computer Security Conference. 1986. p. 175-83.
8. Focardi R., Gorrieri R. A classification of security properties for process algebras. Journal of Computer Security. 3(1):19941995;5-33.
9. Foley SN. A universal theory of information flow. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'87). Silver Spring, MD: IEEE Computer Society Press; 1987. p. 161-22.
10. Mantel H. Possibilistic definitions of security - an assembly kit - In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'00). Silver Spring, MD: IEEE Computer Society Press; 2000. p. 185-99.
11. McCullough D. Specifications for multi-level security and a hook-up property. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'87). Silver Spring, MD: IEEE Computer Society Press; 1987. p. 161-6.
12. McLean J. Security models and information flow. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'90). Silver Spring, MD: IEEE Computer Society Press; 1990. p. 180-7.
13. McLean J. A general theory of composition for trace sets closed under selective interleaving functions. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'94). Silver Spring, MD: IEEE Computer Society Press; 1994. p. 79-93.
14. McLean J. Security models. Encyclopedia of Software Engineering. Wiley & Sons, Inc., 1994.
15. O'Halloran C. A calculus of information flow. In: Proceedings of the European Symposium on Research in Security and Privacy, AFCET. 1990. p. 180-7.
16. Schneider S. May testing, non-interference, and compositionality. Electronic Notes in Theoretical Computer Science 40.
17. Wittbold JT, Johnson DM. Information flow in nondeterministic systems. In: Proceedings of the 1990 IEEE Symposium on Research in Security and Privacy. Silver Spring, MD: IEEE Computer Society Press; 1990. p. 144-61.
18. Zakinthinos A, Lee ES. A general theory of security properties. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'97). Silver Spring, MD: IEEE Computer Society Press, 1997. p. 74-102.
19. Focardi R., Gorrieri R. Classification of security properties (part I: information flow). Focardi R., Gorrieri R. Foundations of Security Analysis and Design, vol. 2171 of Lecture Notes in Computer Science. 2001;331-396 Springer, Berlin.
20. Focardi R., Gorrieri R. The compositional security checker. a tool for the verification of information flow security properties IEEE Transactions on Software Engineering. 23(9):1997;550-571.
21. Durante A., Focardi R., Gorrieri R. A compiler for analysing cryptographic protocols using non-interference. ACM Transactions on Software Engineering and Methodology (TOSEM). 9(4):2000;488-528.
22. Martinelli F. Partial model checking and theorem proving for ensuring security properties. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW'98). Silver Spring, MD: IEEE Computer Society Press; 1998. p. 44-52.
23. Focardi R, Rossi S. Information flow security in dynamic contexts. In: Proceedings of the 15th IEEE Computer Security Foundations Workshop (CSFW'02). Silver Spring, MD: IEEE Computer Society Press; 2002. p. 307-19.
24. Bossi A., Focardi R., Piazza C., Rossi S. A proof system for information flow security. Leuschel M. Proceedings of International Workshop on Logic Based Program Development and Transformation (LOPSTR'02), vol. 2264 of Lecture Notes in Computer Science. 2002;199-218 Springer, Berlin.
25. Mantel H. Unwinding possibilistic security properties. In: Proceedings of the European Symposium on Research in Computer Security, vol. 2895 of Lecture Notes in Computer Science. Berlin: Springer; 2000. p. 238-54.
26. Forster R. Non-interference properties for nondeterministic processes. Ph.D. Thesis, Oxford University Computing Laboratory, 1999.
27. Müller-Olm M. Derivation of characteristic formulae. Electronic Notes in Theoretical Computer Science 18.
28. Steffen B., Ingòlfsdòttir A. Characteristic formulae for Processes with divergence. Information and Computation. 110(1):1994;149-163.
29. Kozen D. Results on the propositional. μ -calculus Theoretical Computer Science. 27:1983;333-354.
30. Cleaveland R., Sims S. The NCSU concurrency workbench. Alur R., Henzinger T. Proceedings of International Conference on Computer Aided Verification (CAV'96), vol. 1102 of Lecture Notes in Computer Science. 1996;394-397 Springer, Berlin.
31. Paige R., Tarjan R.E. Three partition refinement algorithms. SIAM Journal on computing. 16(6):1987;973-989.
32. Bouali A., de Simone R. Symbolic bisimulation minimization. von Bochmann G., Probst D.K. Proceedings of International Conference on Computer Aided Verification (CAV'92), vol. 663 of Lecture Notes in Computer Science. 1992;96-108 Springer, Berlin.
33. Lee D, Yannakakis M. Online minimization of transition systems. In: Proceedings of 24th ACM Symposium on Theory of Computing (STOC'92). New York: ACM Press; 1992. p. 264-74.
34. Dovier A., Piazza C., Policriti A. A fast bisimulation algorithm. Berry G., Comon H., Finkel A. Proceedings of International Conference on Computer Aided Verification (CAV'01), vol. 2102 of Lecture Notes in Computer Science. 2001;79-90 Springer, Berlin.
35. Bouali A. XEVE, an ESTEREL verification environment. Hu A.J., Vardi M.Y. Proceedings of International Conference on Computer Aided Verification (CAV'98), vol. 1427 of Lecture Notes in Computer Science. 1998;500-504 Springer, Berlin.
36. Roscoe A.W. The theory and practice of concurrency, Series in Computer Science. 1998;Prentice Hall, Englewood Cliffs, NJ.
37. Milner R. Communication and concurrency. 1989;Prentice-Hall, Englewood Cliffs, NJ.
38. Montanari U, Sassone V. CCS dynamic bisimulation is progressing. In: Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science (MFCS'91), vol. 520 of Lecture Notes in Computer Science. Berlin: Springer; 1991. p. 346-56.
39. McLean J. A general theory of composition for a class of "possibilistic" security properties. IEEE Transactions on Software Engineering. 22(1):1996;53-67.
40. Mantel H. On the composition of secure systems. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'02). Silver Spring, MD: IEEE Computer Society Press; 2002. p. 88-101.
41. Bossi A, Focardi R, Piazza C, Rossi S. Refinement operators and information flow security. In: Proceedings of the First IEEE International Conference on Software Engineering and Formal Methods (SEFM'03). Silver Spring, MD: IEEE Computer Society Press; 2003. p. 44-53.
42. Long D., Browne A., Clarke E., Jha S., Marrero W. An improved algorithm for the evaluation of fixpoint expressions. Dill E.L. Proceedings of International Conference on Computer Aided Verification (CAV'94), vol. 818 of Lecture Notes in Computer Science. 1994;338-350 Springer, Berlin.
43. Clarke E.M., Grumberg O., Peled D.A. Model checking. 1999;The MIT Press, Cambridge, MA.
44. Benthem Jv. Modal correspondence theory. PhD thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzoek van Exacte Wetenschappen, 1976.
45. Aczel P. Non-well-founded sets, vol. 14 of CSLI Lecture Notes, Stanford University Press. Stanford, USA: CSLI; 1988.
46. Goralcikova A, Koubek V. A reduct and closure algorithm for graphs. In: Proceedings of Mathematical Foundations of Computer Science (MFCS'79), vol. 74 of Lecture Notes in Computer Science. Berlin: Springer; 1979. p. 301-7.
47. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to algorithms. 1990;MIT Press, Cambridge, MA.
48. Coppersmith D, Winograd S. Matrix multiplication via arithmetic progression. In: Proceedings of the 19th Symposium on Theory of Computing. 1987. p. 1-6.
49. Graham-Cumming J, Sanders JW. On the refinement of non-interference. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW'91). Silver Spring, MD: IEEE Computer Society Press; 1991. p. 35-42.
50. Ryan PYA. A CSP formulation of non-interference and unwinding. Cipher 1991; 19-27.
51. Millen JK. Unwinding forward correctability. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW'94). Silver Spring, MD: IEEE Computer Society Press; 1994. p. 2-10.
52. Mantel H. Preserving information flow properties under refinement. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP'01). Silver Spring, MD: IEEE Computer Society Press; 2001. p. 78-91.
53. Johnson DM, Thayer FJ. Security and the composition of machines. In: Proceedings of the IEEE Computer Security Foundations Workshop (CSFW'88). Silver Spring, MD: IEEE Computer Society Press; 1988. p. 72-89.
54. Bossi A, Macedonio D, Piazza C, Rossi S. Secure contexts for confidential data. In: Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW'03). Silver Spring, MD: IEEE Computer Society Press; 2003. p. 14-25.