Calculating bounds on information leakage using two-bit patterns
Calculating bounds on information leakage using two-bit patterns
复制标题
使用两位模式计算信息泄漏的界限
DOI：
10.1145/2166956.2166957
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Geoffrey Smith
中科院分区：
文献类型：
--
作者：
Ziyuan Meng;Geoffrey Smith
鉴于控制机密信息的泄漏的基本重要性以及务实的必要性，即直觉上的“小”泄漏的基本重要性，定量信息流的理论最近引起了人们的兴趣。鉴于这样的理论，开发自动化技术以计算系统中的泄漏至关重要。在本文中，我们在确定性的命令计划的背景下以及最近提供的最小信息泄漏量度测量的情况下解决了这个问题，该量漏洞的漏洞是根据机密信息的脆弱性泄漏的，这是对对手的一次尝试猜测的。在这种情况下，计算程序的最大泄漏减少了，以计算其可以产生的可行输出数量。我们通过确定输出对成对的模式来处理此任务，例如，确定两个位必须不平等。通过计算两位图案的解决方案的数量，我们获得了可行输出数量的上限，因此在泄漏上获得了上限。从效率和准确性方面，我们探讨了方法对许多案例研究的有效性。
Theories of quantitative information flow have seen growing interest recently, in view of the fundamental importance of controlling the leakage of confidential information, together with the pragmatic necessity of tolerating intuitively "small" leaks. Given such a theory, it is crucial to develop automated techniques for calculating the leakage in a system. In this paper, we address this question in the context of deterministic imperative programs and under the recently-proposed min-entropy measure of information leakage, which measures leakage in terms of the confidential information's vulnerability to being guessed in one try by an adversary. In this context, calculating the maximum leakage of a program reduces to counting the number of feasible outputs that it can produce. We approach this task by determining patterns among pairs of bits in the output, for instance by determining that two bits must be unequal. By counting the number of solutions to the two-bit patterns, we obtain an upper bound on the number of feasible outputs and hence on the leakage. We explore the effectiveness of our approach on a number of case studies, in terms of both efficiency and accuracy.
DOI：
10.1145/1920261.1920300
发表时间：
2010-12
期刊：
--
影响因子：
--
作者：
J. Heusser;P. Malacaria
通讯作者：
J. Heusser;P. Malacaria