The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
ICALP '86 Proceedings of the 13th International Colloquium on Automata, Languages and Programming
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
Information Flow Security in Dynamic Contexts
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
A Mathematical Theory of Communication
A Mathematical Theory of Communication
Quantifying information leakage in process calculi
Information and Computation
An Interval-based Abstraction for Quantifying Information Flow
Electronic Notes in Theoretical Computer Science (ENTCS)
On Timed Models and Full Abstraction
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantifying information leakage in process calculi
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
| Hi-index | 0.00 |
We extend definitions of information flow so as to quantify the amount of information passed; in other words, we give a formal definition of the capacity of covert channels. Our definition uses the process algebra CSP, and is based upon counting the number of different behaviours of a high level user that can be distinguished by a low level user.