In this talk we show that casting the problem in a process algebraic framework sheds light on many of the sources of controversy. In particular we argue that non-interference reduces to characterizing the equivalence of processes, itself a difficult and controversial problem in theoretical computer science. Viewing non-interference in this way also clarifies other questions such as that of compositionality.
We also discuss the role of bi-simulation in information security and argue that it corresponds to the notion of "unwinding" as developed in the security literature. Finally we discuss some generalisations to handle richer information flow policies and to deal with the problem of characterising secrecy in the presence of encrypted channels.
Back to schedule.