How to Convert a Flavor of Quantum Bit Commitment
AbstractIn this paper we show how to convert a statistically binding
but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n^2) executions of the statistically binding scheme. As a consequence, statistically concealing but computationally binding quantum bit commitments can be based upon any family of quantum one-way functions. Such a construction is not known to exist in the classical world.
How to Cite
Crépeau, C., Légaré, F., & Salvail, L. (2000). How to Convert a Flavor of Quantum Bit Commitment. BRICS Report Series, 7(52). https://doi.org/10.7146/brics.v7i52.20219
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.