Noninterference Proofs through Flow Analysis
نویسنده
چکیده
This note proves noninterference results (NI) for the secrecy analyses for LA and LAM presented in [1], using the inductive information ow analysis. This ow analysis is related to the secrecy typing in [1] in that, while the latter ensures safety of information ow, the former extracts ow of information. The presentation and study of ow analysis is restricted to its use in NI proofs: further study of the presented ow analysis and its extensions are left for future. Technically the note refers to [1] for LA and LAM as well as the secrecy typing in them. For lucid presentation all technical development is done in the following setting.
منابع مشابه
Proving Information Flow Noninterference by Reusing a Machine-Checked Correctness Proof for Slicing
We present a machine-checked correctness proof for information flow noninterference based on interprocedural slicing. It reuses a correctness proof of the context-sensitive interprocedural slicing algorithm of Horwitz, Reps, and Binkley. The underlying slicing framework is modular in the programming language used; by instantiating this framework the correctness proofs hold for the respective la...
متن کاملSlicing Guarantees Information Flow Noninterference
In this contribution, we show how correctness proofs for intra[8] and interprocedural slicing [9] can be used to prove that slicing is able to guarantee information flow noninterference. Moreover, we also illustrate how to lift the control flow graphs of the respective frameworks such that they fulfil the additional assumptions needed in the noninterference proofs. A detailed description of the...
متن کاملA Formalization of Assumptions and Guarantees for Compositional Noninterference
Research in information-flow security aims at developing methods to identify undesired information leaks within programs from private (high) sources to public (low) sinks. For a concurrent system, it is desirable to have compositional analysis methods that allow for analyzing each thread independently and that nevertheless guarantee that the parallel composition of successfully analyzed threads...
متن کاملProbabilistic Noninterference
We formalize a probabilistic noninterference for a multi-threaded language with uniform scheduling, where probabilistic behaviour comes from both the scheduler and the individual threads. We define notions probabilistic noninterference in two variants: resumption-based and trace-based. For the resumption-based notions, we prove compositionality w.r.t. the language constructs and establish sound...
متن کاملNoninterference Security in Communicating Sequential Processes
An extension of classical noninterference security for deterministic state machines, as introduced by Goguen and Meseguer and elegantly formalized by Rushby, to nondeterministic systems should satisfy two fundamental requirements: it should be based on a mathematically precise theory of nondeterminism, and should be equivalent to (or at least not weaker than) the classical notion in the degener...
متن کامل