Multiplex Coding of Bit Commitment Based on a Discrete Memoryless Channel
H. Yamamoto, Daichi Isami
The bit commitment can be realized by using a noisy channel. Winter-Nascimento-Imai showed that the bit commitment capacity of a noisy channel is given by Cb= maxpNH(X\Y) where X and Y are the input and output of the channel. In this paper, the idea of a multiplex coding, which was first introduced into the coding problem of a wiretap channel by Kobayashi-Yamamoto-Ogawa, is applied to the bit commitment coding. The coding theorem is proved for the multiplex coding of bit commitment based on a noisy channel, and it is shown that several mutually independent secrets can be committed at the same time via a nosiy channel attaining the perfect secrecy of each secret with the total coding rate log \X\, where \X\ is the cardinality of channel input alphabet.
IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•7 citations