Quantifying information flow

Proceedings of the Computer Security Foundations Workshop

Volumn 2002-January, Issue , 2002, Pages 18-31

  Lowe, G ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Algebra; Books; Channel capacity; Computer security; Conferences; Information security; Laboratories; Performance analysis

Indexed keywords

ALGEBRA; CHANNEL CAPACITY; LABORATORIES; SECURITY SYSTEMS;

AMOUNT OF INFORMATION; BOOKS; CONFERENCES; COVERT CHANNELS; FORMAL DEFINITION; INFORMATION FLOWS; PERFORMANCE ANALYSIS; PROCESS ALGEBRAS;

SECURITY OF DATA;

EID: 84948775168     PISSN: 10636900     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSFW.2002.1021804     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:83-133, 1984.
3. R. Focardi. Comparing two information flow security properties. In Proceedings of 9th IEEE Computer Security Foundations Workshop, pages 116-122, 1996.
4. R. Focardi and R. Gorrieri. A classification of security properties. Journal of Computer Security, 1995.
5. 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, pages 170-184, 2000.
6. R. Focardi and S. Rossi. A security property for processes in dynamic contexts. In Proceedings of the Workshop on Issues in the Theory of Security (WITS '02), 2002.
7. 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.
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, pages 1-33, 1988.
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, pages 304-313. Spring Verlag, 1986.
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, pages 19-27, 1991.
16. 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.