Commitment Capacity of Discrete Memoryless Channels

Simple item page
dc.creatorWinter, Andreas
dc.creatorNascimento, Anderson C. A.
dc.creatorImai, Hideki
dc.date2003-04-10
dc.date.accessioned2026-07-07T03:19:35Z
dc.date.available2026-07-07T03:19:35Z
dc.descriptionIn 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.
dc.description20 pages, LaTeX2e
dc.identifierhttps://arxiv.org/abs/cs/0304014
dc.identifierhttp://arxiv.org/abs/cs/0304014
dc.identifierProc. 9th Cirencester Crypto and Coding Conf., LNCS 2989, pp 35-51, Springer, Berlin 2003.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31520
dc.subjectCryptography and Security
dc.subjectQuantum Physics
dc.subjectE.3;H.1
dc.titleCommitment Capacity of Discrete Memoryless Channels
dc.typetext

Files

Collections

arXiv