Dec 19, 2011 · This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. More ...

More precisely, we study the “bounding problem” of quantitative information flow, defined as follows: Given a program M and a positive real number q, decide if ...

This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. More precisely, we ...

2.2 Bounding Problem. We define the bounding problem of quantitative information flow for each def- inition of the quantitative information flow introduced ...

It is proved that the bounding problem is not a k-safety property for any k even when q is fixed, for the Shannon-entropy-based definition with the uniform ...

bounding problem is a form of quantitative information flow checking problem ... quantitative information flow comparison problems with universally quantified.

This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. More precisely, we ...

Abstract. Researchers have proposed formal definitions of quantita- tive information flow based on information theoretic notions such as the.

This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. More precisely, we ...

Hirotoshi Yasuoka, Tachio Terauchi : On Bounding Problems of Quantitative Information Flow. ESORICS 2010: 357-372. manage site settings.