Information flow security in dynamic contexts

Journal of Computer Security

Volumn 14, Issue 1, 2006, Pages 65-110

  Focardi, Riccardo ^a   Rossi, Sabina ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

Bisimulation; Information flow; Mobility; Non Interference; Process calculi

Indexed keywords

COMPUTER SIMULATION; INFORMATION ANALYSIS; MATHEMATICAL MODELS; SOFTWARE AGENTS;

BISIMULATION; INFORMATION FLOW; MOBILITY; NON-INTERFERENCE; PROCESS CALCULI;

SECURITY OF DATA;

EID: 31744437624     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/JCS-2006-14103     Document Type: Article

References (57)

1. M. Abadi, Secrecy by typing in security protocols, Journal of the ACM 46(5) (1999), 749-786.
2. A. Aldini, M. Bravetti and R. Gorrieri, A process-algebraic approach for the analysis of probabilistic non-interference, Journal of Computer Security 12(2) (2004), 191-245.
3. D.E. Bell and L.J. La Padula, Secure computer systems: Unified exposition and multics interpretation, Technical Report ESD-TR-75-306, MITRE MTR-2997, 1976.
4. V. Benzaken, M. Burelle and G. Castagna, Information flow security for XML transformations, in: Proc. of Asian Computing Science Conference (ASIAN '03), Volume 2896 of LNCS, Springer, Berlin, 2003, pp. 33-53.
5. C. Bodei, P. Degano, F. Nielson and H. Riis Nielson, Static analysis for secrecy and non-interference in networks of processes, in: Proc. of International Conference on Parallel Computing Technologies, V.E. Malyshkin, ed., Volume 2127 of LNCS, Springer, Berlin, 2001, pp. 27-41.
6. A. Bossi, R. Focardi, C. Piazza and S. Rossi, Verifying persistent security properties, Computer Languages, Systems and Structures 30(3-4) (2004), 231-258.
7. A. Bouali and R. de Simone, Symbolic bisimulation minimization, in: Proc. of International Conference on Computer Aided Verification (CAV '92), G. von Bochmann and D.K. Probst, eds, Volume 663 of LNCS, Springer, Berlin, 1992, pp. 96-108.
8. C. Braghin, A. Cortesi and R. Focardi, Information leakage detection in boundary ambients, in: Proc. of Computing: The Australasian Theory Symposium (CATS '03), Electronic Notes in Theoretical Computer Science, Elsevier, 2003.
9. M. Bugliesi, G. Castagna and S. Crafa, Boxed ambients, in: TACS '01 Proc. of the 4th Int. Conference on Theoretical Aspects of Computer Science, Number 2215 in LNCS, Springer, Berlin, 2001, pp. 38-63.
10. M. Bugliesi, S. Crafa, M. Merro and V. Sassone, Communication interference in mobile boxed ambients, in: Proc. of Int. Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '02), M. Agrawal and A. Seth, eds, Volume 2556 of LNCS, Springer, Berlin, 2002, pp. 71-84.
11. L. Cardelli and A.D. Gordon, Mobile ambients, in: Proc. of Foundations of Software Science and Computation Structures (FoSSaCS), M. Nivat, ed., Volume 1378 of LNCS, Springer, 1998, pp. 140-155.
12. S. Crafa, M. Bugliesi and G. Castagna, Information flow security for boxed ambients, in: F-WAN: Int. Workshop on Foundations of Wide Area Networks, Number 66(3), Electronic Notes in Theoretical Computer Science, Elsevier, 2002.
13. A. Di Pierro, C. Hankin and H. Wiklicky, Approximate Non-interference, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW '02), IEEE Computer Society Press, 2002, pp. 3-17.
14. A. Dovier, C. Piazza and A. Policriti, A fast bisimulation algorithm, in: Proc. of International Conference on Computer Aided Verification (CAV '01), G. Berry, H. Comon and A. Finkel, eds, Volume 2102 of LNCS, Springer, Berlin, 2001, pp. 79-90.
15. R. Focardi and R. Gorrieri, A classification of security properties for process algebras, Journal of Computer Security 3(1) (1994/1995), 5-33.
16. 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) (1997), 550-571.
17. R. Focardi and R. Gorrieri, Classification of security properties (Part I: Information flow), in: Foundations of Security Analysis and Design, R. Focardi and R. Gorrieri, eds, Volume 2171 of LNCS, Springer, Berlin, 2001.
18. R. Focardi, R. Gorrieri and F. Martinelli, Non Interference for the analysis of cryptographic protocols, in: U. Montanari, J.D.P. Rolim and E. Welzl, eds, Proc. of International Colloquium on Automata, Languages and Programming (ICALP '00), Volume 1853 of LNCS, Springer, Berlin, 2000, pp. 744-755.
19. R. Focardi, R. Gorrieri and F. Martinelli, Real-time information flow analysis, IEEE Journal on Selected Areas in Communications 21(1) (2003).
20. R. Focardi and S. Rossi, Information flow security in dynamic contexts, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW '02), IEEE Computer Society Press, 2002, pp. 307-319.
21. S.N. Foley, A universal theory of information flow, in: Proc. of the IEEE Symposium on Security and Privacy (SSP '87), IEEE Computer Society Press, 1987, pp. 116-122.
22. J.A. Goguen and J. Meseguer, Security policy and security models, in: Proc, of the 1982 Symposium on Security and Privacy, IEEE Computer Society Press, 1982, pp. 11-20.
23. R. Gorrieri, E. Locatelli and F. Martinelli, A simple language for real-time cryptographic protocol analysis, in: Proc. of European Symposium on Programming (ESOP '03), P. Degano, ed., Volume 2618 of LNCS, Springer, Berlin, 2003, pp. 114-128.
24. M. Hennessy, The security picalculus and Non-interference, Technical Report CS-05-2000, University of Sussex, School of Cognitive and Computing Sciences, Brighton BN1 9QH, UK, Nov. 2000.
25. M. Hennessy and J. Riely, Information flow vs. resource access in the asynchronous Pi-calculus, ACM Transactions on Programming Languages and Systems (TOPLAS) 24(5) (2002), 566-591.
26. M. Hennessy and J. Riely, Resource access control in systems of mobile agents, Information and Computation 173 (2002), 82-120.
27. D.M. Johnson and F.J. Thayer, Security and the composition of machines, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW '88), IEEE Computer Society Press, 1988, pp. 72-89.
28. P.C. Kannellakis and S.A. Smolka, CCS Expressions, Finite state processes, and three problems of equivalence, Information and Computation 86(1) (1990), 43-68.
29. D. Lee and M. Yannakakis, Online minimization of transition systems, in: Proc. of the 24th ACM Symposium on Theory of Computing (STOC '92), ACM Press, 1992, pp. 264-274.
30. G. Lowe, Quantifying information flow, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW '02), IEEE Computer Society Press, 2002, pp. 18-31.
31. H. Mantel, Possibilistic definitions of security - an assembly kit, in: Proc. of the IEEE Computer Security Foundations Workshop (CSFW '00), IEEE Computer Society Press, 2000, pp. 185-199.
32. H. Mantel, Unwinding possibilistic security properties, in: Proc. of the European Symposium on Research in Computer Security (ESoRiCS '00), Volume 2895 of LNCS, Springer, Berlin, 2000, pp. 238-254.
33. D. McCullough, Specifications for multi-level security and a hook-up property, in: Proc, of the IEEE Symposium on Security and Privacy (SSP '87), IEEE Computer Society Press, 1987, pp. 161-166.
34. D. McCullough, Noninterference and the composability of security properties, in: Proceedings, 1988 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, 1988, pp. 177-186.
35. J. McLean, Security models and information flow, in: Proc. of the IEEE Symposium on Security and Privacy (SSP '90), IEEE Computer Society Press, 1990, pp. 180-187.
36. 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 (SSP '94), IEEE Computer Society Press, 1994, pp. 79-93.
37. J.K. Millen, Finite-state noiseless covert channels, in: Proceedings of the Computer Security Foundations Workshop II, MITRE Corporation, IEEE Computer Society Press, 1989, pp. 81-86.
38. R. Milner, Communication and Concurrency, Prentice-Hall, 1989.
39. R. Milner, J. Parrow and J. Walker, A calculus of mobile processes, I and II, Information and Computation 100(1) (1992), 1-77.
40. U. Montanari and V. Sassone, CCS dynamic bisimulation is progressing, in: Proc. of the Int. Symposium on Mathematical Foundations of Computer Science (MFCS '91), Volume 520 of LNCS, Springer, Berlin, 1991, pp. 346-356.
41. M. Müller-Olm, Derivation of characteristic formulae, Electronic Notes in Theoretical Computer Science, Elsevier, Vol. 18, 1998.
42. C. O'Halloran, A calculus of information flow, in: Proc. of the European Symposium on Research in Security and Privacy (ESoRiCS '90), AFCET, 1990, pp. 180-187.
43. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM Journal on Computing 16(6) (1987), 973-989.
44. C. Piazza, E. Pivato and S. Rossi, CoPS: Checker of persistent security, in: Proc. of Int. Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS '04), Volume 2988 of LNCS, Springer, Berlin, 2004, pp. 144-152.
45. F. Pottier, A simple view of type-secure information flow in the iπ-calculus, in: Proc. of the 15th IEEE Computer Secuiity Foundations Workshop (CSFW15), IEEE Computer Society Press, 2002, pp. 320-330.
46. A.W. Roscoe, J.C.P. Woodcock and L. Wulf, Non-interference through determinism, Journal of Computer Security 4(1) (1996).
47. P. Ryan and S. Schneider, Process algebra and Non-interference, Journal of Computer Security 9(1/2) (2001), 75-103.
48. P.Y.A. Ryan, A CSP formulation of Non-interference and unwinding, Cipher (1991), 19-27.
49. A. Sabelfed and D. Sands, Probabilistic Noninterference for multi-threaded programs, in: Proc. of the IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, 2000, pp. 200-215.
50. A. Sabelfeld and A.C. Myers, Language-based information-flow security, IEEE Journal on Selected Areas in Communication 21(1) (2003), 5-19.
51. G. Smith and D.M. Volpano, Secure information flow in a multi-threaded imperative language, in: Proc. of 25th ACM SIGPLAN-SIGACT Symposium on Principles of Progmmming Languages (POPL98), ACM Press, 1998, pp. 355-364.
52. B. Steffen and A. Ingòlfsdòttir, Characteristic formulae for processes with divergence, Information and Computation 110(1) (1994) 149-163.
53. C. Stirling, Modal and temporal logics for processes, in: Logics for Concurrency: Structures versus Automata, E. Brinksma, R. Cleaveland, K.G.T. Margaria Larsen and B. Steffen, eds, Volume 1043 of LNCS, Springer, Berlin, 1996, pp. 149-237.
54. D. Sutherland, A model of information, in: Proc. of the 9th National Computer Security Conference, 1986, pp. 175-183.
55. C.R. Tsai, V.D. Gligor and C.S. Chandersekaran, On the identification of covert storage channels in secure systems, IEEE Transactions on Software Engineering (June) (1990), 569-580.
56. J.T. Wittbold and D.M. Johnson, Information flow in nondeterministic systems, in: Proceedings of the 1990 IEEE Symposium on Research in Security and Privacy, IEEE Computer Society Press, 1990, pp. 144-161.
57. A. Zakinthinos and E.S. Lee, A general theory of security properties, in: Proc. of the IEEE Symposium on Security and Privacy (SSP '97), IEEE Computer Society Press, 1997, pp. 74-102.