Commitment Capacity of Discrete Memoryless Channels
Commitment Capacity of Discrete Memoryless Channels
复制标题
离散无记忆通道的承诺容量
DOI：
10.1007/978-3-540-40974-8_4
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
H. Imai
中科院分区：
文献类型：
--
作者：
A. Winter;Anderson C. A. Nascimento;H. Imai
在比特承诺任务的扩展和 Crepeau 发起的后续工作中，我们引入并解决了表征离散无记忆通道可用于比特承诺的最佳速率的问题。事实证明，答案非常直观：即使允许无限的无噪声双向侧通信，它也是通道的最大歧义（在消除琐碎的冗余之后）。通过众所周知的减少，这个结果提供了通道实施抛硬币的能力的下限。
In extension of the bit commitment task and following work initiated by Crepeau, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used to for bit commitment. It turns out that the answer is very intuitive: it is the maximum equivocation of the channel (after removing trivial redundancy), even when unlimited noiseless bidirectional side communication is allowed. By a well–known reduction, this result provides a lower bound on the channel’s capacity for implementing coin tossing.