Commitment Capacity of Discrete Memoryless Channels
<|reference_start|>Commitment Capacity of Discrete Memoryless Channels: 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.<|reference_end|>
@article{winter2003commitment,
    title={Commitment Capacity of Discrete Memoryless Channels},
    author={Andreas Winter, Anderson C. A. Nascimento, Hideki Imai},
    journal={Proc. 9th Cirencester Crypto and Coding Conf., LNCS 2989, pp
  35-51, Springer, Berlin 2003.},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0304014},
    primaryClass={cs.CR quant-ph}
}