Quantum Commitments from Complexity Assumptions

Details Quantum Commitments from Complexity Assumptions Quantum Commitments from Complexity Assumptions

2010-10-13

arxiv.org/abs/1010.2793v2

Physics

Quantum Physics

v2 30p

Scientific paper

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and the quantum regime, we need to look at computationally secure commitment schemes. In this paper, we study worst-case complexity assumptions that imply quantum bit-commitment schemes. First, we show that QSZK not included in QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. Additionally, we give auxiliary-input commitment schemes using quantum advice that depend on the much weaker assumption that QIP is not included in QMA (which is weaker than PSPACE not included in PP). Finally, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time.

Affiliated with

Also associated with

No associations

Rating

Quantum Commitments from Complexity Assumptions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Commitments from Complexity Assumptions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Commitments from Complexity Assumptions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284573