论文信息 - CS 6113 Lecture 19 Quantitative Information Flow 12 November 2013

CS 6113 Lecture 19 Quantitative Information Flow 12 November 2013

Quantitative information flow was first proposed by Denning [5] and Gray [6]. Its goal is to measure the amount of information leaked about a secret by observing the running of a program. Quantitative definitions of information leakage are often borrowed from information theory. Indeed, early models of quantitative information flow directly used the Shannon mutual information I(X;Y ), which measures the (expected) reduction in uncertainty about the value of random variable X given by learning the value of Y (see §2). Doing information flow quantitatively immediately raises the following issues, among others:

A. Myers | Jed Liu | S. Hopkins

[1] Dorothy E. Denning,et al. Cryptography and Data Security , 1982 .

[2] James W. Gray,et al. Toward a mathematical foundation for information flow security , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[3] David Clark,et al. A static analysis for quantifying information flow in a simple imperative language , 2007, J. Comput. Secur..

[4] Pasquale Malacaria,et al. Assessing security threats of looping constructs , 2007, POPL '07.

[5] Michael R. Clarkson,et al. Quantifying information flow with beliefs , 2009, J. Comput. Secur..

[6] Geoffrey Smith,et al. On the Foundations of Quantitative Information Flow , 2009, FoSSaCS.

[7] Gilles Barthe,et al. Information-Theoretic Bounds for Differentially Private Mechanisms , 2011, 2011 IEEE 24th Computer Security Foundations Symposium.

[8] F. Schneider,et al. When not all bits are equal : Incorporating “ worth ” into information-flow measures , 2013 .