Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
复制标题
DOI：
10.1007/978-3-642-10698-9_4
复制
发表时间：
2009-05
期刊：
影响因子：
--
通讯作者：
Takeshi Koshiba;T. Odaira
中科院分区：
文献类型：
--
作者：
Takeshi Koshiba;T. Odaira
我们提供了一种量子比特承诺方案，它具有来自任何近似原像大小的量子单向函数的统计隐藏和计算绑定特性，这是基于杜迈斯、迈耶斯和萨尔维尔的量子单向排列的完美隐藏量子比特承诺方案的推广。在经典情况下，统计隐藏比特承诺方案可以从任何单向函数构造。然而，众所周知，对于安全参数n，经典统计隐藏比特承诺方案的轮复杂度为Ω(n/logn)。我们的量子方案以及Dumais-Mayers-Salvail方案都是非交互式的，这比经典方案更有优势。
We provide a quantum bit commitment scheme which has statistically-hiding and computationally-binding properties from any approximable-preimage-size quantum one-way function, which is a generalization of perfectly-hiding quantum bit commitment scheme based on quantum one-way permutation due to Dumais, Mayers and Salvail. In the classical case, statistically-hiding bit commitment scheme is constructible from any one-way function. However, it is known that the round complexity of the classical statistically-hiding bit commitment scheme is Ω(n/logn) for the security parametern. Our quantum scheme as well as the Dumais-Mayers-Salvail scheme is non-interactive, which is advantageous over the classical schemes.