Abstract—Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, ...

Apr 1, 2010 · This paper investigates the hardness and possibilities of precisely checking and inferring quantitative information flow according to such definitions.

This paper investigates the hardness and possibilities of precisely checking and inferring quantitative information flow according to such definitions. We prove ...

Quantitative Information Flow - Verification Hardness and Possibilities · Hirotoshi Yasuoka, Tachio Terauchi · Published in IEEE Computer Security… 31 March 2010 ...

Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, ...

This paper investigates the hardness and possibilities of precisely checking and inferring quantitative information flow according to such definitions. We prove ...

Bibliographic details on Quantitative Information Flow - Verification Hardness and Possibilities.

Dive into the research topics of 'Quantitative information flow-verification hardness and possibilities'. Together they form a unique fingerprint. Sort by ...

In this paper, we identify new classes of hyperproperties, k-observable hyperproperty, that is useful for classifying QIF problems.

When the amount of information is measured using mutual information, the problem is known to be PSPACE-hard and decidable in EXPTIME. We show that the problem ...