# Witness-Indistinguishability Against Quantum Adversaries 6 . 845 Quantum Complexity Theory – Project Report

@inproceedings{Popa2011WitnessIndistinguishabilityAQ, title={Witness-Indistinguishability Against Quantum Adversaries 6 . 845 Quantum Complexity Theory – Project Report}, author={Raluca A. Popa}, year={2011} }

Proof systems are a central concept in complexity theory and cryptography. Zero-knowledge and witnessindistinguishability are useful security properties of proof systems. Considering the increased power of quantum computation, it comes as a natural question to understand what happens to these security properties when quantum computation becomes feasible. Zero-knowledge [GMR89] is the security property of proof systems that has received the most attention. Intuitively, a proof system is zero…

## References

SHOWING 1-10 OF 19 REFERENCES

Zero-knowledge against quantum attacks

- Mathematics, Computer ScienceSTOC '06
- 2006

This paper proves that several interactive proof systems are zero-knowledge against general quantum attacks and establishes for the first time that true zero- knowledge is indeed possible in the presence of quantum information and computation.

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks

- Mathematics, Computer ScienceICALP
- 2008

We show that any problem that has a classical zero-knowledge protocol against the honest verifier also has, under a reasonable condition, a classical zero-knowledge protocol which is secure against…

Increasing the power of the verifier in Quantum Zero Knowledge

- Mathematics, Computer ScienceFSTTCS
- 2008

This paper studies what happens when an honest verifier is allowed to flip some coins in addition to using unitary operations, and shows that Quantum Statistical Zero Knowledge where the verifier applies any non-unitary operation is equal to Quantum Zero-Knowledge where theVerifier uses only unitaries.

Limits on the power of quantum statistical zero-knowledge

- Computer Science, MathematicsThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
- 2002

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/.

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

- Computer Science, MathematicsJACM
- 1991

In this paper the generality and wide applicability of Zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff is demonstrated. These are probabilistic and interactive proofs…

General Properties of Quantum Zero-Knowledge Proofs

- Mathematics, Computer ScienceTCC
- 2008

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.

Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs

- Computer Science, MathematicsCRYPTO
- 1995

Two transformations of public-coin/Arthur-Merlin proof systems which are zero-knowledge with respect to the honest verifier are presented, using ordinary hashing functions instead of the interactive hashing protocol which was used by Damgard.

Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge

- Mathematics, Computer ScienceSTOC '98
- 1998

We show how to transform any interactive proof system which is statistical zero-knowledge with respect to the honest-verifier, into a proof system which is statistical zero-knowledgewith respect to…

Everything Provable is Provable in Zero-Knowledge

- Mathematics, Computer ScienceCRYPTO
- 1988

It is shown that every language that admits an interactive proof admits a (computational) zero-knowledge interactive proof.

Zero-Knowledge twenty years after its invention

- Computer Science, MathematicsElectron. Colloquium Comput. Complex.
- 2002

The main deenitions and results regarding zero-knowledge proofs are surveyed, the basic deenitional approach and its variants are presented, results regarding the power of zero- knowledge proofs are presented as well as recent results regarding questions such as the composeability of Zero Knowledge proofs.