Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation

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 complexity O(n) qubits for n a security parameter.

• Type: Conference
• Year: 2000
• Where: EUROCRYPT
• Authors: Paul Dumais, Dominic Mayers, Louis Salvail
• Keywords: Classical Reduction, Cryptology, EUROCRYPT 2000, Quantum Bit Commitment, Quantum One-way Permutations