Quantum commitments from complexity assumptions

Authors:
André Chailloux;Iordanis Kerenidis;Bill Rosgen
Affiliations:
Laboratoire de Recherche en Informatique, Université Paris-Sud;LIAFA, Université Paris Diderot and CNRS and Centre for Quantum Technologies, National University of Singapore;Centre for Quantum Technologies, National University of Singapore
Venue:
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Year:
2011

Citing 18
Cited 0

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
imits on the Power of Quantum Statistical Zero-Knowledge

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Everything Provable is Provable in Zero-Knowledge

CRYPTO '88 Proceedings of the 8th 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
PSPACE has constant-round quantum interactive proof systems

Theoretical Computer Science - Algorithms,automata, complexity and games
Succinct quantum proofs for properties of finite groups

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation

Classical and Quantum Computation
On the Hardness of Distinguishing Mixed-State Quantum Computations

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
An Unconditional Study of Computational Zero Knowledge

SIAM Journal on Computing
Quantum Arthur---Merlin games

Computational Complexity
One-way functions are essential for complexity based cryptography

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Zero-Knowledge against Quantum Attacks

SIAM Journal on Computing
Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function

SIAM Journal on Computing
QIP = PSPACE

Proceedings of the forty-second ACM symposium on Theory of computing
Cryptographic distinguishability measures for quantum-mechanical states

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study worst-case complexity assumptions that imply quantum bit-commitment schemes. First we show that QSZK ⊈ QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP ⊈ QMA (which is weaker than PSPACE ⊈ PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK ⊈ QMA we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA.