Defining information flow quantity

Journal of Computer Security

Volumn 12, Issue 3-4 SPEC. ISS., 2004, Pages 619-653

  Lowe, Gavin ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); DATA TRANSFER; MATHEMATICAL MODELS; PROBABILITY; SEMANTICS;

COVERT CHANNELS; CPS PROCESS ALGEBRA; INFORMATION FLOW;

SECURITY OF DATA;

EID: 3042651614     PISSN: 0926227X     EISSN: None     Source Type: Journal    
DOI: 10.3233/jcs-2004-123-410     Document Type: Conference Paper

References (20)

1. P.G. Allen, A comparison of non-interference and non-deducibility using CSP, in: Proceedings of the 4th IEEE Computer Security Foundations Workshop, 1991.
2. R. de Nicola and M.C.B. Hennessy, Testing equivalences for processes, Theoretical Computer Science 34 (1984), 83-133.
3. R. Focardi and R. Gorrieri, A classification of security properties, Journal of Computer Security, 1995.
4. R. Focardi, R. Gorrieri and F. Martinelli, Information flow analysis in a discrete-time process algebra, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop, 2000, pp. 170-184.
5. R. Focardi, Comparing two information flow security properties, in: Proceedings of 9th IEEE Computer Security Foundations Workshop, 1996, pp. 116-122.
6. R. Forster, Non-interference properties for nondeterministic processes, DPhil thesis, Oxford University, 1999. Available from http://www.comlab.ox.ac. uk/oucl/research/areas/concurrency/papers/thesis.ps.gz.
7. R. Focardi and S. Rossi, Information flow security in dynamic contexts, in: Proceedings of the 15th IEEE Computer Security Foundations Workshop, 2002, pp. 307-319.
8. J.W. Gray, III. Towards a mathematical foundation for information flow security, in: Proceedings of the 1991 IEEE Computer Society Symposium on Research in Computer Security and Privacy, 1991.
9. D. McCullough, Covert channels and degrees of insecurity, in: Proceedings of the First IEEE Computer Security Foundations Workshop, 1988, pp. 1-33.
10. J. Millen, Covert channel capacity, in: Proceedings of the 1987 IEEE Computer Society Symposium on Computer Security and Privacy, 1987.
11. J. Ouaknine, Discrete analysis of continuous behaviour in real-time concurrent systems, D.Phil thesis, Oxford University, 2000.
12. I. Phillips, Refusal testing, in: Proceedings of 13th International Colloquium on Automata, Languages and Programming, LNCS 226, Springer-Verlag, 1986, pp. 304-313.
13. A. W. Roscoe, CSP and determinism in security modelling, in: Proceedings of 1995 IEEE Symposium on Security and Privacy, 1995.
14. A.W. Roscoe, The Theory and Practice of Concurrency, Prentice Hall, 1997.
15. P.Y.A. Ryan, A CSP formulation of non-interference, Cipher, 1991, pp. 19-27. Also in Proceedings of the 3rd IEEE Computer Security Foundations Workshop, 1990.
16. P.Y.A. Ryan, A CSP formulation of non-interference, Cipher, 1991, pp. 19-27. Also in Proceedings of the 3rd IEEE Computer Security Foundations Workshop, 1990.
17. S. Schneider, Concurrent and Real-time Systems: The CSP Approach, Wiley, 1999.
18. C.E. Shannon and W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, 1963.
19. US Department of Defense, DoD Trusted Computer System Evaluation Criteria, 1985, DOD 5200.28-STD.
20. J.T. Wittbold and D. Johnson, Information flow in nondeterministic systems, in: Proceedings of the 1990 IEEE Computer Society Symposium on Research in Computer Security and Privacy, 1990.