Computer Science – Cryptography and Security
Scientific paper
2011-12-19
Computer Science
Cryptography and Security
To appear in Journal of Computer Security, IOS Press. arXiv admin note: substantial text overlap with arXiv:1004.0062
Scientific paper
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, belief, 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 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.
Terauchi Tachio
Yasuoka Hirotoshi
No associations
LandOfFree
On Bounding Problems of Quantitative Information Flow does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Bounding Problems of Quantitative Information Flow, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Bounding Problems of Quantitative Information Flow will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-210115