Communicating sequential processes
Communicating sequential processes
Separability and the detection of hidden channels
Information Processing Letters
Specifying security properties
Developments in concurrency and communication
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Testing and Refinement for Nondeterministic and Probabilistic Processes
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
Comparing Two Information Flow Security Properties
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Information Flow Analysis in a Discrete-Time Process Algebra
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
CSFW '02 Proceedings of the 15th IEEE workshop on Computer Security Foundations
CSP and determinism in security modelling
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Information Flow Properties for Distributed Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
On declassification and the non-disclosure policy
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
A tool for the synthesis of controller programs
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
| Hi-index | 0.00 |
In the past, several definitions of information flow have been presented, based upon process algebras. Unfortunately, all these appear to be either too weak--failing to identify certain subtle forms of information flow or too strong--indicating information flow when there is none. In this paper, we produce a definition that aims to overcome these shortcomings. We base our definition upon an operational model of CSP that reasons about the ways in which nondeterministic choices can be resolved, and so is more discriminating than previous models. Our definition of information flow is then that the behaviour of one agent can have some influence upon another agent's view of the system. This definition gives the expected results on all thought experiments tried to date, and also satisfies certain desirable properties.