On bounding problems of quantitative information flow

Hirotoshi Yasuoka*, Tachio Terauchi

*この研究の対応する著者

研究成果: Conference contribution

13 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルComputer Security, ESORICS 2010 - 15th European Symposium on Research in Computer Security, Proceedings
ページ357-372
ページ数16
DOI
出版ステータスPublished - 2010 11 8
外部発表はい
イベント15th European Symposium on Research in Computer Security, ESORICS 2010 - Athens, Greece
継続期間: 2010 9 202010 9 22

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6345 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other15th European Symposium on Research in Computer Security, ESORICS 2010
国/地域Greece
CityAthens
Period10/9/2010/9/22

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On bounding problems of quantitative information flow」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル