Perfectly concealing quantum bit commitment from any quantum one-way permutation

Authors:
Paul Dumais;Dominic Mayers;Louis Salvail
Affiliations:
Université de Montréal, Dept. of Computer Science;NEC Research Institute, Princeton, NJ;Dept. of Computer Science, University of Århus, Århus, Denmark
Venue:
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Year:
2000

Citing 9
Cited 18

Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Limits on the provable consequences of one-way permutations

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Experimental quantum cryptography

Journal of Cryptology - Eurocrypt '90
Security of quantum protocols against coherent measurements

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Unconditional security in quantum cryptography

Journal of the ACM (JACM)
Pseudorandomness and Cryptographic Applications

Pseudorandomness and Cryptographic Applications
Practical Quantum Oblivious Transfer

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Quantum Bit Commitment from a Physical Assumption

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

A new protocol and lower bounds for quantum coin flipping

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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 Public-Key Cryptosystems

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
How to Convert the Flavor of a Quantum Bit Commitment

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Quantum bit-commitment for small storage based on quantum one-way permutations

New Generation Computing - Quantum computing
A new protocol and lower bounds for quantum coin flipping

Journal of Computer and System Sciences - STOC 2001
Cryptography In the Bounded Quantum-Storage Model

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Universal test for quantum one-way permutations

Theoretical Computer Science - Mathematical foundations of computer science 2004
Statistical Zero Knowledge and quantum one-way functions

Theoretical Computer Science
A tight high-order entropic quantum uncertainty relation with applications

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
On quantum one-way permutations

Quantum Information & Computation
Classical cryptographic protocols in a quantum world

CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Exact quantum algorithms for the leader election problem

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
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.00

Visualization

Abstract

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.