Quantitative information flow-verification hardness and possibilities

Yasuoka Hirotoshi*, Terauchi Tachio

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

研究成果

41 被引用数 (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 and possibilities of precisely checking and inferring quantitative information flow according to such definitions. We prove that, even for just comparing two programs on which has the larger flow, none of the definitions is a k- safety property for any k, and therefore is not amenable to the self-composition technique that has been successfully applied to precisely checking non-interference. We also show a complexity theoretic gap with non-interference by proving that, for loop-free boolean programs whose non-interference is coNP-complete, the comparison problem is #P-hard for all of the definitions. For positive results, we show that universally quantifying the distribution in the comparison problem, that is, comparing two programs according to the entropy based definitions on which has the larger flow for all distributions, is a 2-safety problem in general and is coNP-complete when restricted for loop-free boolean programs. We prove this by showing that the problem is equivalent to a simple relation naturally expressing the fact that one program is more secure than the other. We prove that the relation also refines the channel-capacity based definition, and that it can be precisely checked via the self-composition as well as the "interleaved" self-composition technique.

本文言語English
ホスト出版物のタイトル23rd IEEE Computer Security Foundations Symposium, CSF 2010
ページ15-27
ページ数13
DOI
出版ステータスPublished - 2010
外部発表はい
イベント23rd Computer Security Foundations Symposium, CSF 2010 - Edinburgh, United Kingdom
継続期間: 2010 7 172010 7 19

出版物シリーズ

名前Proceedings - IEEE Computer Security Foundations Symposium
ISSN(印刷版)1940-1434

Other

Other23rd Computer Security Foundations Symposium, CSF 2010
国/地域United Kingdom
CityEdinburgh
Period10/7/1710/7/19

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「Quantitative information flow-verification hardness and possibilities」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル