Abstract Information flow control allows untrusted code to access sensitive and trustworthy
information without leaking this information. However, the presence of covert channels …

We present a new algorithm for checking probabilistic noninterference in concurrent
programs. The algorithm, named RLSOD, is based on the Low-Security Observational …

Confidentiality is an important concern in today's information society: electronic payment and
personal data should be protected appropriately. This holds in particular for multi-threaded …

Low-security observable determinism (LSOD), as introduced by Roscoe and Zdancewic [18,
24], is the simplest criterion which guarantees probabilistic noninterference for concurrent …

Observational determinism is a property that ensures the confidentiality in concurrent
programs. It conveys that public variables are independent of private variables during the …

This paper studies how confidentiality properties of multi-threaded programs can be verified
efficiently by a combination of newly developed and existing model checking algorithms. In …

Building on our published mechanisation of the probabilistic program logic pGCL we
present a verified lattice scheduler, a standard covert-channel mitigation technique …

We present a new algorithm, together with a full soundness proof, which guarantees
probabilistic noninterference (PN) for concurrent programs. The algorithm follows the “low …

Secure information flow checks whether sensitive information leak to public outputs of a
program or not. It has been widely used to analyze the security of various programs and …

Quantitative theories of information flow give us an approach to relax the absolute
confidentiality properties that are difficult to satisfy for many practical programs. The classical …