Quantifying information flow in cryptographic systems
Quantifying information flow in cryptographic systems
复制标题
量化密码系统中的信息流
DOI：
10.1017/s0960129513000662
复制
发表时间：
2014
影响因子：
0.5
通讯作者：
Boris Köpf
中科院分区：
文献类型：
--
作者：
M. Backes;Boris Köpf
我们给出了定量信息流的新定义，称为可传输信息流，它适用于关于信息理论安全(或非密码)系统的推理，以及关于具有多项式有界对手的密码系统、错误概率等的推理。可传输信息流捕获了两个进程之间的有意通信，并且它安全地过近似了一个进程无意中泄露给另一个进程的信息量。我们证明了可传输信息在通用可合成性下被保存，这构成了安全实现的流行密码学概念。这一结果使我们能够将可传输信息的量化界限从密码任务的简单理想功能提升到实际的密码系统。基于Shannon编码定理的弱逆，我们进一步证明了无条件设置下的可传输信息与信道容量之间的关系。这种联系使我们能够使用来自定量信息流的现有技术来计算受限类协议的可传输信息的上界。
We provide a novel definition of quantitative information flow, called transmissible information, that is suitable for reasoning about informational-theoretically secure (or non-cryptographic) systems, as well as about cryptographic systems with their polynomially bounded adversaries, error probabilities, etc. Transmissible information captures deliberate communication between two processes, and it safely over-approximates the quantity of information that a process unintentionally leaks to another process. We show that transmissible information is preserved under universal composability, which constitutes the prevalent cryptographic notion of a secure implementation. This result enables us to lift quantitative bounds of transmissible information from simple ideal functionalities of cryptographic tasks to actual cryptographic systems. We furthermore prove a connection between transmissible information in the unconditional setting and channel capacity, based on the weak converse of Shannon's coding theorem. This connection enables us to compute an upper bound on the transmissible information for a restricted class of protocols, using existing techniques from quantitative information flow.
影响因子：
1.2
作者：
Clark, David;Hunt, Sebastian;Malacaria, Pasquale
通讯作者：
Malacaria, Pasquale
DOI：
10.1145/1920261.1920300
发表时间：
2010-12
期刊：
--
影响因子：
--
作者：
J. Heusser;P. Malacaria
通讯作者：
J. Heusser;P. Malacaria