How to Convert the Flavor of a Quantum Bit Commitment

Authors:
Claude Crépeau;Frédéric Légaré;Louis Salvail
Affiliations:
-;-;-
Venue:
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Year:
2001

Citing 11
Cited 7

How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Security of quantum protocols against coherent measurements

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Limits on the Provable Consequences of One-way Permutations

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Practical Quantum Oblivious Transfer

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Achieving oblivious transfer using weakened security assumptions

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Perfectly concealing quantum bit commitment from any quantum one-way permutation

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function

CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
A Quantum Goldreich-Levin Theorem with Cryptographic Applications

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Quantum commitments from complexity assumptions

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Exact Quantum Algorithms for the Leader Election Problem

ACM Transactions on Computation Theory (TOCT)
Computational indistinguishability between quantum states and its cryptographic application

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Statistically-Hiding quantum bit commitment from approximable-preimage-size quantum one-way function

TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Two provers in isolation

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 QBC scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n2) 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.