Abstract

. We develop a behavioural theory of secure information ow using a typed -calculus as a metalanguage, and show its applicability to the analysis and reasoning of secrecy concerns in programming languages. The key technical novelty is a new typed bisimilarity which accurately captures the ow of information among processes based on a given type structure. A behavioural theory of secrecy is introduced, for which we establish fundamental results such as non-interference. The use of the general theory is shown by formulating and establishing a compositional soundness property for a generalisation of the multi-threaded imperative calculus by Volpano-Smith [32]; and by introducing sound typing rules for mutable and immutable references and local declaration based on the analysis using the typed process representation. The soundness of the new typing rules is again established using the general theory. 1 Introduction This paper presents a basic principle for analysing and reasoning about s...

Citations