Quantitative Information Flow in Boolean Programs

  • Rohit Chadha
  • Dileep Kini
  • Mahesh Viswanathan
Conference paper

DOI: 10.1007/978-3-642-54792-8_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8414)
Cite this paper as:
Chadha R., Kini D., Viswanathan M. (2014) Quantitative Information Flow in Boolean Programs. In: Abadi M., Kremer S. (eds) Principles of Security and Trust. POST 2014. Lecture Notes in Computer Science, vol 8414. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Rohit Chadha
    • 1
  • Dileep Kini
    • 2
  • Mahesh Viswanathan
    • 2
  1. 1.University of MissouriUSA
  2. 2.University of Illinois, Urbana-ChampaignUSA

Personalised recommendations