Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
复制标题
DOI：
10.1007/3-540-45539-6_21
复制
发表时间：
2000-05
期刊：
影响因子：
2.2
通讯作者：
P. Dumais;D. Mayers;L. Salvail
中科院分区：
文献类型：
--
作者：
P. Dumais;D. Mayers;L. Salvail
我们证明了尽管无条件安全的量子比特承诺是不可能的，但它可以基于任何一族量子单向置换。所得到的方案具有无条件隐蔽性和计算约束性。与Naor、Ostrovski、Ventkatesen和Young的经典约化不同，该协议是非交互的，通信复杂度为O(N)个量子比特的NA安全参数。
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is unconditionally concealing and computationally binding. Unlike the classical reduction of Naor, Ostrovski, Ventkatesen and Young, our protocol is non-interactive and has communication complexityO(n) qubits forna security parameter.