Semantic models for information flow

Theoretical Computer Science

Volumn 315, Issue 1, 2004, Pages 209-256

  Lowe, Gavin ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; SECURITY OF DATA; SIGNAL INTERFERENCE;

INFORMATION FLOW; MULTILEVEL SECURITY; NONDEDUCIBILITY; NONINTERFERENCE;

SEMANTICS;

EID: 2042514961     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.11.019     Document Type: Conference Paper

References (23)

1. P.G. Allen, A comparison of non-interference and non-deducibility using CSP, In: Proc. 4th IEEE Computer Security Foundations Workshop, 1991.
2. R. Focardi, Comparing two information flow security properties, in: Proc. 9th IEEE Computer Security Foundations Workshop, 1996, pp. 116-122.
3. R. Focardi, R. Gorrieri, A classification of security properties, J. Comput. Security (1995).
4. R. Focardi, R. Gorrieri, F. Martinelli, Information flow analysis in a discrete-time process algebra, in: Proc. 13th IEEE Computer Security Foundations Workshop, 2000, pp. 170-184.
5. Formal Systems (Europe) Ltd, Failures-Divergence Refinement - FDR 2 User Manual, 1997. Available via URL http://www.formal.demon.co.uk/FDR2.html.
6. R. Forster, Non-interference properties for nondeterministic processes, D.Phil., Oxford University, 1999. Available from http://www.comlab.ox.ac.uk/ oucl/research/areas/concurrency/papers/thesis.ps.gz.
7. J.A. Goguen, J. Meseguer, Security policies and security models, in: Proc. IEEE Symposium on Research in Security and Privacy, 1982, p. 11-20.
8. J.C. Graham-Cumming, The formal development of secure systems, D.Phil., Oxford University, 1992.
9. H.A. Hansson, Time and probability in formal design of distributed systems, Ph.D. Thesis, Swedish Institute of Computer Science, 1991; Published as SICS Dissertation Series, No. 05.
10. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice-Hall, Englewood Cliffs, NJ.
11. Jacob J.L. Seperability and the detection of hidden channels. Inform. Process. Lett. 34:1990;27-29.
12. Jacob J.L. Specifying security properties. Hoare C.A.R. Developments in Concurrency and Communication. 1990;Addison-Wesley, Reading, MA.
13. Jonsson B., Stuart C.H., Yi W. Testing and refinement for nondeterministic and probabilistic processes. Langmaack H., de Roever W.-P., Vytopil J. Formal Techniques in Real-Time and Fault-Tolerant Systems. Lecture Notes in Computer Science. 863:1994;418-430 Springer, New York.
14. C.-C. Jou, S.A. Smolka, Equivalences, congruences and complete axiomatizations for probabilistic processes, in: Concur '90, LNCS, Springer, New York, 1990.
15. G. Lowe, Semantic models for information flow, Technical Report 2000/25, Department of Mathematics and Computer Science, University of Leicester, 2000.
16. G. Lowe, Quantifying information flow, in: Proc. 15th IEEE Computer Security Foundations Workshop, 2002, pp. 18-31.
17. Morgan C., McIver A., Seidel K., Sanders J. Refinement-oriented probability for CSP. Formal Aspects Comput. 8(6):1995;617-647.
18. A.W. Roscoe, CSP and determinism in security modelling, in: Proc. 1995 IEEE Symposium on Security and Privacy, 1995.
19. Roscoe A.W. The Theory and Practice of Concurrency. 1997;Prentice-Hall, Englewood Cliffs, NJ.
20. P.Y.A. Ryan, A CSP formulation of non-interference, Cipher (1991), 19-27. Also in Proc. 3rd IEEE Computer Security Foundations Workshop, 1990.
21. P.Y.A. Ryan, A CSP formulation of non-interference, Cipher (1991), 19-27. Also in Proc. 3rd IEEE Computer Security Foundations Workshop, 1990.
22. D. Sutherland, A model of information, in: Proc. 9th National Computer Security Conference, 1986, p. 175-183.
23. J. Todd Wittbold, D.M. Johnson, Information flow in nondeterministic systems, in: Proceedings of the IEEE Symposium on Research in Security and Privacy, 1990, pp. 144-161.