Paper 2003/165
Commitment Capacity of Discrete Memoryless Channels
Andreas Winter, Anderson C. A. Nascimento, and Hideki Imai
Abstract
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.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Commitment SchemesInformation TheoryNoisy Channels
- Contact author(s)
- anderson @ imailab iis u-tokyo ac jp
- History
- 2003-08-11: received
- Short URL
- https://ia.cr/2003/165
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/165,
author = {Andreas Winter and Anderson C. A. Nascimento and Hideki Imai},
title = {Commitment Capacity of Discrete Memoryless Channels},
howpublished = {Cryptology ePrint Archive, Paper 2003/165},
year = {2003},
note = {\url{https://eprint.iacr.org/2003/165}},
url = {https://eprint.iacr.org/2003/165}
}
