On bounding problems of quantitative information flow

Hirotoshi Yasuoka, Tachio Terauchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channel capacity. This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. 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 the quantitative information flow of M is less than or equal to q. We prove 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 distribution), and therefore is not amenable to the self-composition technique that has been successfully applied to checking non-interference. We also prove complexity theoretic hardness results for the case when the program is restricted to loop-free boolean programs. Specifically, we show that the problem is PP-hard for all the definitions, showing a gap with non-interference which is coNP-complete for the same class of programs. The paper also compares the results with the recently proved results on the comparison problems of quantitative information flow.

Original languageEnglish
Title of host publicationComputer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings
Pages357-372
Number of pages16
Volume6345 LNCS
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event15th European Symposium on Research in Computer Security, ESORICS 2010 - Athens, Greece
Duration: 2010 Sep 202010 Sep 22

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6345 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other15th European Symposium on Research in Computer Security, ESORICS 2010
CountryGreece
CityAthens
Period10/9/2010/9/22

Fingerprint

Information Flow
Entropy
Noninterference
Shannon Entropy
Hardness
Channel capacity
Channel Capacity
Less than or equal to
Uniform distribution
Safety
Chemical analysis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Yasuoka, H., & Terauchi, T. (2010). On bounding problems of quantitative information flow. In Computer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings (Vol. 6345 LNCS, pp. 357-372). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6345 LNCS). https://doi.org/10.1007/978-3-642-15497-3_22

On bounding problems of quantitative information flow. / Yasuoka, Hirotoshi; Terauchi, Tachio.

Computer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings. Vol. 6345 LNCS 2010. p. 357-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6345 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yasuoka, H & Terauchi, T 2010, On bounding problems of quantitative information flow. in Computer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings. vol. 6345 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6345 LNCS, pp. 357-372, 15th European Symposium on Research in Computer Security, ESORICS 2010, Athens, Greece, 10/9/20. https://doi.org/10.1007/978-3-642-15497-3_22
Yasuoka H, Terauchi T. On bounding problems of quantitative information flow. In Computer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings. Vol. 6345 LNCS. 2010. p. 357-372. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-15497-3_22
Yasuoka, Hirotoshi ; Terauchi, Tachio. / On bounding problems of quantitative information flow. Computer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings. Vol. 6345 LNCS 2010. pp. 357-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{e2eae13e6b2c4eee9a495f25349e3a1a,
title = "On bounding problems of quantitative information flow",
abstract = "Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channel capacity. This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. 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 the quantitative information flow of M is less than or equal to q. We prove 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 distribution), and therefore is not amenable to the self-composition technique that has been successfully applied to checking non-interference. We also prove complexity theoretic hardness results for the case when the program is restricted to loop-free boolean programs. Specifically, we show that the problem is PP-hard for all the definitions, showing a gap with non-interference which is coNP-complete for the same class of programs. The paper also compares the results with the recently proved results on the comparison problems of quantitative information flow.",
author = "Hirotoshi Yasuoka and Tachio Terauchi",
year = "2010",
doi = "10.1007/978-3-642-15497-3_22",
language = "English",
isbn = "3642154964",
volume = "6345 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "357--372",
booktitle = "Computer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings",

}

TY - GEN

T1 - On bounding problems of quantitative information flow

AU - Yasuoka, Hirotoshi

AU - Terauchi, Tachio

PY - 2010

Y1 - 2010

N2 - Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channel capacity. This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. 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 the quantitative information flow of M is less than or equal to q. We prove 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 distribution), and therefore is not amenable to the self-composition technique that has been successfully applied to checking non-interference. We also prove complexity theoretic hardness results for the case when the program is restricted to loop-free boolean programs. Specifically, we show that the problem is PP-hard for all the definitions, showing a gap with non-interference which is coNP-complete for the same class of programs. The paper also compares the results with the recently proved results on the comparison problems of quantitative information flow.

AB - Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the guessing entropy, and channel capacity. This paper investigates the hardness of precisely checking the quantitative information flow of a program according to such definitions. 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 the quantitative information flow of M is less than or equal to q. We prove 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 distribution), and therefore is not amenable to the self-composition technique that has been successfully applied to checking non-interference. We also prove complexity theoretic hardness results for the case when the program is restricted to loop-free boolean programs. Specifically, we show that the problem is PP-hard for all the definitions, showing a gap with non-interference which is coNP-complete for the same class of programs. The paper also compares the results with the recently proved results on the comparison problems of quantitative information flow.

UR - http://www.scopus.com/inward/record.url?scp=78049387502&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78049387502&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-15497-3_22

DO - 10.1007/978-3-642-15497-3_22

M3 - Conference contribution

AN - SCOPUS:78049387502

SN - 3642154964

SN - 9783642154966

VL - 6345 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 357

EP - 372

BT - Computer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings

ER -