Complete Problem for Perfect Zero-Knowledge Quantum Proof

@inproceedings{Yan2012CompletePF,
  title={Complete Problem for Perfect Zero-Knowledge Quantum Proof},
  author={Jun Yan},
  booktitle={SOFSEM},
  year={2012}
}
  • Jun Yan
  • Published in SOFSEM 21 January 2012
  • Computer Science, Mathematics
The main purpose of this paper is to prove that (promise) problem Quantum State Identicalness (abbreviated QSI) is essentially complete for perfect zero-knowledge quantum interactive proof (QPZK). Loosely speaking, problem QSI is to decide whether two efficiently preparable quantum states (captured by quantum circuit of polynomial size) are identical or far apart (in trace distance). It is worthy noting that our result does not have classical counterpart yet; natural complete problem for… 

Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)

TLDR
This paper showed that plugging quantum bit commitment scheme into the GMW-type construction of zero- knowledge also gives a quantum zero-knowledge proof, as one expects, and proposed a formalization of non-interactive quantum bit commit scheme, which may come in handy in other places.

General Properties of Quantum Bit Commitments

  • Jun Yan
  • Computer Science, Physics
  • 2022
TLDR
This work obtains the following two results: Any complexity-based quantum bit commitment scheme can be converted into the canonical (non-interactive) form (with its sum-binding property preserved) and implies (unconditionally) that complexity- based quantum bitcommitments is symmetric.

General Properties of Quantum Bit Commitments

  • Jun Yan
  • Computer Science, Physics
  • 2022
TLDR
The question of whether canonical quantum bit commitment schemes exist is interesting in its own right in quantum complexity theory and may serve as an alternative foundation of complexity-based quantum cryptography.

How to Base Security on the Perfect/Statistical Binding Property of Quantum Bit Commitment?

TLDR
It is shown that the (quantum) security can still be established for zero-knowledge proof, oblivious transfer, and proof-of-knowledge and the corresponding security analyses are by no means trivial extensions of their classical analyses; new techniques are needed to handle possible superposition attacks by the cheating sender of quantum bit commitments.

General Properties of Quantum Bit Commitments∗

  • Jun Yan
  • Computer Science, Physics
  • 2022
TLDR
The formulation of canonical quantum bit commitment is so clean and simple that itself can be viewed as a plausible complexity assumption as well, and is proposed to explore from perspectives of both quantum cryptography and quantum complexity theory in the future.

References

SHOWING 1-10 OF 34 REFERENCES

Limits on the power of quantum statistical zero-knowledge

  • J. Watrous
  • Computer Science, Mathematics
    The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
TLDR
A definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems is proposed and the resulting complexity class is studied, which is denote QSZK/sub HV/.

General Properties of Quantum Zero-Knowledge Proofs

TLDR
All the four properties above hold also for the statistical zero-knowledge case and the first two properties hold even for the perfect zero- knowledge case, and it is proved that allowing a simulator to output "FAIL" does not change the power of quantum perfect zeroknowledge proofs.

Non-interactive Quantum Perfect and Statistical Zero-Knowledge

TLDR
It is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge proof systems and the Graph Non-Automorphism problem is shown to have a non-Interactive quantumperfect zero- knowledge proof system.

Succinct quantum proofs for properties of finite groups

  • J. Watrous
  • Mathematics, Computer Science
    Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
TLDR
It is proved that for an arbitrary group oracle, there exist succinct (polynomial-length) quantum proofs for the Group Non-Membership problem that can be checked with small error in polynomial time on a quantum computer.

Quantum NP - A Survey

We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA

Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

TLDR
It is proved that any polynomial-round quan tum interactiveProof system with two-sided bounded error can be parallelized to a quantum interactive proof system with exponentially small one-sided error, in which the prover and verifier exchange only 3 messages.

How to Achieve Perfect Simulation and a Complete Problem for Non-interactive Perfect Zero-Knowledge

  • Lior Malka
  • Mathematics, Computer Science
    Journal of Cryptology
  • 2013
TLDR
A new error shifting technique for building perfect simulators is introduced and is given the first complete problem for the class of problems admitting non-interactive perfect zero-knowledge (NIPZK) proofs, a hard problem forThe class of Problems admitting public-coin PZK proofs, and other applications.

Comparing entropies in statistical zero knowledge with applications to the structure of SZK

  • Oded GoldreichS. Vadhan
  • Mathematics, Computer Science
    Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
  • 1999
TLDR
An alternative proof of Okamoto's result by which HVSZK: (i.e., honest-verifier statistical zero knowledge) equals public-coin HVSzK is obtained, and an equivalence of a weak notion of statisticalzero knowledge to the standard one is obtained.

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model

TLDR
It is shown that interactive and noninteractive zero-knowledge are equivalent in the 'help model' of Ben-Or and Gutfreund and hold for statistical zero knowledge, for computational zero knowledge restricted to AM, and for quantum zero knowledge when the help is a pure quantum state.

The knowledge complexity of interactive proof-systems

TLDR
A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.