Two new logics for verification of hyperproperties are proposed. Hyperproperties
characterize security policies, such as noninterference, as a property of sets of computation …

Computing systems often deliberately release (or declassify) sensitive information. A
principal security concern for systems permitting information release is whether this release …

We consider a framework in which anonymity protocols are interpreted as noisy channels in
the information-theoretic sense, and we explore the idea of using the notion of capacity as a …

We propose an approach to quantify interference in a simple imperative language that
includes a looping construct. In this paper we focus on a particular case of this definition of …

We present a new technique for determining how much information about a program's secret
inputs is revealed by its public outputs. In contrast to previous techniques based on …

There is a clear intuitive connection between the notion of leakage of information in a
program and concepts from information theory. This intuition has not been satisfactorily …

This paper uses Shannon's information theory to give a quantitative definition of information
flow in systems that transform inputs to outputs. For deterministic systems, the definition is …

Information leakage traditionally has been defined to occur when uncertainty about secret
data is reduced. This uncertainty-based approach is inadequate for measuring information …

Hyperproperties are properties of sets of computation traces. In this paper, we study
quantitative hyperproperties, which we define as hyperproperties that express a bound on …

We study the reactive synthesis problem for hyperproperties given as formulas of the
temporal logic HyperLTL. Hyperproperties generalize trace properties, ie, sets of traces, to …