抄録
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 |
| 外部発表 | Yes |
| イベント | 23rd Computer Security Foundations Symposium, CSF 2010 - Edinburgh, United Kingdom 継続期間: 2010 7 17 → 2010 7 19 |
Other
| Other | 23rd Computer Security Foundations Symposium, CSF 2010 |
|---|---|
| 国 | United Kingdom |
| 市 | Edinburgh |
| 期間 | 10/7/17 → 10/7/19 |
Fingerprint
ASJC Scopus subject areas
- Engineering(all)
これを引用
Quantitative information flow-verification hardness and possibilities. / Hirotoshi, Yasuoka; Terauchi, Tachio.
23rd IEEE Computer Security Foundations Symposium, CSF 2010. 2010. p. 15-27 5552655.研究成果: Conference contribution
}
TY - GEN
T1 - Quantitative information flow-verification hardness and possibilities
AU - Hirotoshi, Yasuoka
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 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.
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 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.
UR - http://www.scopus.com/inward/record.url?scp=77957590642&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77957590642&partnerID=8YFLogxK
U2 - 10.1109/CSF.2010.9
DO - 10.1109/CSF.2010.9
M3 - Conference contribution
AN - SCOPUS:77957590642
SN - 9780769540825
SP - 15
EP - 27
BT - 23rd IEEE Computer Security Foundations Symposium, CSF 2010
ER -