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 has the same complexity as safety verification of programs. We also show that the same bounds apply when comparing information leaked by two programs. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Chadha, R., Kini, D., & Viswanathan, M. (2014). Quantitative information flow in Boolean programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8414 LNCS, pp. 103–119). Springer Verlag. https://doi.org/10.1007/978-3-642-54792-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
