Commitment Capacity of Discrete Memoryless Channels

  • Andreas Winter
  • Anderson C. A. Nascimento
  • Hideki Imai
Conference paper

DOI: 10.1007/978-3-540-40974-8_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2898)
Cite this paper as:
Winter A., Nascimento A.C.A., Imai H. (2003) Commitment Capacity of Discrete Memoryless Channels. In: Paterson K.G. (eds) Cryptography and Coding. Cryptography and Coding 2003. Lecture Notes in Computer Science, vol 2898. Springer, Berlin, Heidelberg

Abstract

In extension of the bit commitment task and following work initiated by Crépeau, 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.

The method of proving this relates the problem to Wyner’s wire–tap channel in an amusing way. There is also an extension to quantum channels.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Andreas Winter
    • 1
  • Anderson C. A. Nascimento
    • 2
  • Hideki Imai
    • 2
  1. 1.Department of Computer ScienceUniversity of BristolBristolUnited Kingdom
  2. 2.Imai Laboratory, Information and Systems, Institute of Industrial ScienceUniversity of TokyoTokyoJapan

Personalised recommendations