Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations
Efficient Protocols Achieving the Commitment Capacity of Noisy Correlations
复制标题
实现噪声相关性承诺能力的高效协议
DOI：
10.1109/isit.2006.262083
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
A. Winter
中科院分区：
文献类型：
--
作者：
H. Imai;Kirill Morozov;Anderson C. A. Nascimento;A. Winter
比特承诺是构建零知识证明和多方计算的重要工具。无条件安全比特承诺尤其可以基于噪声信道或相关性，其中噪声被认为是有价值的资源。最近，Winter、Nascimento 和 Imai 引入了承诺容量的概念，即发送方承诺的字符串长度与噪声信道/相关性使用次数之间的最大比率。他们还证明，对于任何离散的无记忆通道，都存在一个实现其承诺能力的安全协议，但是没有给出特定的构造。为了解决他们的悬而未决的问题，我们提供了一种有效的协议来实现离散无记忆系统的承诺能力（噪声通道和相关性）
Bit commitment is an important tool for constructing zero-knowledge proofs and multi-party computation. Unconditionally secure bit commitment can be based, in particular, on noisy channel or correlation where noise considered a valuable resource. Recently, Winter, Nascimento and Imai introduced the concept of commitment capacity, the maximal ratio between the length of a string which the sender commits to and the number of times the noisy channel/correlation is used. They also proved that for any discrete memoryless channel there exists a secure protocol achieving its commitment capacity however, no particular construction was given. Solving their open question, we provide an efficient protocol for achieving the commitment capacity of discrete memoryless systems (noisy channels and correlations)