離散無記憶通信路を用いた多重ビットコミットメントに対する符号化定理(知的生産活動における情報アクセス制御技術及び一般)

概要

論文の詳細を見る
The bit commitment can be realized by using a noisy channel. Winter-Nascimento-Imai [1] showed that the bit commitment capacity is given by C_b=max_<Px(x)> H(X|Y) where X and Y are the input and output of the noisy channel. In this paper, the idea of a multiplex coding, which is first introduced into the coding problem of a wiretap channel by Kobayashi-Yamamoto-Ogawa [2], in applied to the bit commitment coding. The coding theorem is proved for the multiplex bit commitment coding, and it is shown that several mutually independent secrets can be committed via a nosiy channel with the total coding rate log|X| and keeping each secret securely, where |X| is the size of channel input and log|X| is usually much larger than C_b.
社団法人電子情報通信学会の論文
2006-11-10