On the Commitment Capacity of Unfair Noisy Channels
On the Commitment Capacity of Unfair Noisy Channels
复制标题
论不公平噪音渠道的承诺能力
DOI：
--
复制
发表时间：
2019
影响因子：
2.5
通讯作者：
Anderson C. A. Nascimento
中科院分区：
文献类型：
--
作者：
C. Crépeau;Rafael Dowsley;Anderson C. A. Nascimento
从密码学的角度来看，噪声信道是一种有价值的资源。它们可用于交换秘钥以及实现其他加密原语，如承诺和遗忘传输。为了真正发挥作用，在作弊方对信道特性有一定程度控制的情况下，必须考虑噪声信道。damgamatrd等人（EUROCRYPT 1999）提出了一个更现实的模型，在这个模型中，这种控制级别被允许给对手，即所谓的不公平噪声信道，并证明它们可以用来获得承诺和遗忘传输协议。考虑到噪声信道是用于加密目的的宝贵资源，一个重要的问题是确定可以使用它们的最佳速率。已经确定了离散无记忆信道和高斯信道的承诺容量。在这项工作中，我们解决了确定不公平噪声信道的承诺能力的问题。我们计算了不均匀噪声信道承诺容量的单字母表征。在对手无法控制信道的情况下（公平情况下），我们的容量减少到众所周知的离散无内存二进制对称信道的容量。
Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy channels have to be considered in the scenario where a cheating party has some degree of control over the channel characteristics. Damgård et al. (EUROCRYPT 1999) proposed a more realistic model where such level of control is permitted to an adversary, the so called unfair noisy channels, and proved that they can be used to obtain commitment and oblivious transfer protocols. Given that noisy channels are a precious resource for cryptographic purposes, one important question is determining the optimal rate in which they can be used. The commitment capacity has already been determined for the cases of discrete memoryless channels and Gaussian channels. In this work we address the problem of determining the commitment capacity of unfair noisy channels. We compute a single-letter characterization of the commitment capacity of unfair noisy channels. In the case where an adversary has no control over the channel (the fair case) our capacity reduces to the well-known capacity of a discrete memoryless binary symmetric channel.