• Publications
  • Influence
Calculating bounds on information leakage using two-bit patterns
TLDR
In this paper, we address this question in the context of deterministic imperative programs and under the recently-proposed min-entropy measure of information leakage, which measures leakage in terms of the confidential information's vulnerability to being guessed in one try by an adversary. Expand
  • 42
  • 7
  • PDF
Faster Two-Bit Pattern Analysis of Leakage
TLDR
Two-bit pattern analysis can be done more efficiently through the use of four new techniques: implication graphs, random execution, STP counterexamples, and deductive closure. Expand
  • 8
  • 1
  • PDF
Short Paper: Bounding Information Leakage Using Implication Graph
TLDR
We address this question in the context of deterministic imperative programs and under the min-entropy measure of information leakage. Expand
Two-bit pattern analysis for quantitative information flow
TLDR
Program analysis for calculating the maximum leakage, or capacity, of confidential information in the context of deterministic systems and under three proposed entropy measures of information leakage. Expand