z-logo
open-access-imgOpen Access
How to Convert a Flavor of Quantum Bit Commitment
Author(s) -
Claude Crépeau,
Frédéric Légaré,
Louis Salvail
Publication year - 2000
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v7i52.20219
Subject(s) - scheme (mathematics) , commitment scheme , quantum , bit (key) , computer science , theoretical computer science , mathematics , arithmetic , algorithm , discrete mathematics , computer security , cryptography , quantum mechanics , physics , mathematical analysis
In 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here