Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Quantum-Secure Coin-Flipping and Applications
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The complexity of zero knowledge
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
General properties of quantum zero-knowledge proofs
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Interactive and noninteractive zero knowledge are equivalent in the help model
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Secure two-party quantum evaluation of unitaries against specious adversaries
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On parallel composition of zero-knowledge proofs with black-box quantum simulators
Quantum Information & Computation
Quantum commitments from complexity assumptions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Complete problem for perfect zero-knowledge quantum proof
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
A surprisingly simple way of reversing trace distance via entanglement
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
QMA variants with polynomially many provers
Quantum Information & Computation
| Hi-index | 0.00 |
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including:The following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close together or far apart in the trace norm metric? This problem is a quantum generalization of the complete promise problem of Sahai and Vadhan [25] for (classical) statistical zero-knowledge.QSZKHV is closed under complement.QSZKHV \subseteq PSPACE. (At present it is not known if arbitrary quantum interactive proof systems can be simulated in PSPACE, even for one-round proof systems.)Any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a two-message (i.e., one-round) honest verifier quantum statistical zero-knowledge proof system. Similarly, any polynomial-round honest verifier quantum statistical zero-knowledge proof system can be simulated by a three-message public-coin honest verifier quantum statistical zero-knowledge proof system.These facts establish close connections between classical statistical zero-knowledge and our definition for quantum statistical zero-knowledge, and give some insight regarding the effect of this zero-knowledge restriction on quantum interactive proof systems. The relationship between our definition and possible definitions of general (i.e., not necessarily honest) quantum statistical zero-knowledge are also discussed.