A lattice model of secure information flow
Communications of the ACM
Information and Computation
Secure Information Flow for Concurrent Processes
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Probabilistic Information Flow in a Process Algebra
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
A Fully Abstract Game Semantics for Finite Nondeterminism
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Information-Flow Security for Interactive Programs
CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination-Insensitive Noninterference Leaks More Than Just a Bit
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Channels with side information at the transmitter
IBM Journal of Research and Development
Just forget it: the semantics and enforcement of information erasure
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
| Hi-index | 0.00 |
We consider the problem of defining an appropriate notion of non-interference (NI) for deterministic interactive programs. Previous work on the security of interactive programs by O'Neill, Clarkson and Chong (CSFW 2006) builds on earlier ideas due to Wittbold and Johnson (Symposium on Security and Privacy 1990), and argues for a notion of NI defined in terms of strategies modelling the behaviour of users. We show that, for deterministic interactive programs, it is not necessary to consider strategies and that a simple stream model of the users' behaviour is sufficient. The key technical result is that, for deterministic programs, stream-based NI implies the apparently more general strategy-based NI (in fact we consider a wider class of strategies than those of O'Neill et al). We give our results in terms of a simple notion of Input-Output Labelled Transition System, thus allowing application of the results to a large class of deterministic interactive programming languages.