Now showing items 1-8 of 8
Concurrent Bounded Model Checking
Abstract Model Counting: A Novel Approach for Quantification of Information Leaks
We present a novel method for Quantitative Information Flow analysis. We show how the problem of computing information leakage can be viewed as an extension of the Satisfiability Modulo Theories (SMT) problem. This view ...
Quantifying Information Leaks Using Reliability Analysis
We report on our work-in-progress into the use of reliability analysis to quantify information leaks. In recent work we have proposed a software reliability analysis technique that uses symbolic execution and model counting ...
Studying Maximum Information Leakage Using Karush-Kuhn-Tucker Conditions
When studying the information leakage in programs or protocols, a natural question arises: "what is the worst case scenario?". This problem of identifying the maximal leakage can be seen as a channel capacity problem in ...
Algebraic Foundations for Information Theoretical, Probabilistic and Guessability measures of Information Flow
Several mathematical ideas have been investigated for Quantitative Information Flow. Information theory, probability, guessability are the main ideas in most proposals. They aim to quantify how much information is leaked, ...
Full abstraction for PCF