离散无记忆信道的承诺容量
Commitment Capacity of Discrete Memoryless Channels
摘要：
在扩展的位承诺的任务和以下工作Crepeau和Kilian发起的，我们介绍和解决的问题，表征的最佳速率，在该离散的无记忆通道可以用于位承诺。事实证明，答案是非常直观的：它是信道的最大模糊度（在去除微不足道的冗余之后），即使在允许无限无噪声双向侧通信的情况下。通过一个众所周知的减少，这一结果提供了一个下限的信道的能力，实现抛硬币，我们推测是一个平等的。证明这一点的方法与Wyner的有线窃听信道问题有关。我们还讨论了量子信道的扩展。
英文摘要：
In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used 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, which we conjecture to be an equality. The method of proving this relates the problem to Wyner's wire--tap channel in an amusing way. We also discuss extensions to quantum channels.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
