2014
DOI: 10.1007/978-3-642-54792-8_6
View full text
|
|
Share

Abstract: Abstract. The quantitative information flow bounding problem asks, given a program P and threshold q, whether the information leaked by P is bounded by q. 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 is in fact decidable in PSPACE, thus establishing the exact complexity of the quantitative information flow bounding problem. Thus, the complexity of bounding quantitative information flow in programs…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
0
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals