Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Non-interactive Quantum Perfect and Statistical Zero-Knowledge

Hirotada Kobayashi

Published Jan 1, 2003• 46 citations
Publisher
DOI
10.1007/978-3-540-24587-2_20

Related papers

Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model

Dominique Unruh

Lecture notes in computer science•Jan 1, 2015•173 citations

Statistical Zero Knowledge and quantum one-way functions

Elham Kashefi, Iordanis Kerenidis

arXiv:quant-ph/0511266•Theoretical Computer Science•Mar 13, 2007•24 citations

Logical Characterization of Quantum Statistical Zero-Knowledge (QSZK)

В. Г. Найденко

•Jan 1, 2026•0 citations

Unclonable Non-interactive Zero-Knowledge

Ruta Jawale, Dakshita Khurana

arXiv:2310.07118•Lecture notes in computer science•Dec 8, 2024•8 citations

Complete Problem for Perfect Zero-Knowledge Quantum Proof

Jun Yan

Lecture notes in computer science•Jan 1, 2012•2 citations

Non-Interactive Quantum Statistical and Perfect Zero-Knowledge

Hirotada Kobayashi

This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph Non-Automorphism problem, which is not known in BQP, can be reduced to our complete problem. Our results may be the first non-trivial quantum zero-knowledge proofs secure even against dishonest quantum verifiers, since our protocols are non-interactive, and thus the zero-knowledge property does not depend on whether the verifier in the protocol is honest or not. A restricted version of our complete problem derives a natural complete problem for BQP.

arXiv:quant-ph/0207158•Jul 29, 2002•3 citations
This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of non-interactive quantum perfect and statistical zero-knowledge. It is also shown that, with sharing EPR pairs a priori, the class of languages having one-sided bounded error non-interactive quantum perfect zero-knowledge proof systems has a natural complete problem. Non-triviality of such a proof system is based on the fact proved in this paper that the Graph Non-Automorphism problem, which is not known in BQP, can be reduced to our complete problem. Our results may be the first non-trivial quantum zero-knowledge proofs secure even against dishonest quantum verifiers, since our protocols are non-interactive, and thus the zero-knowledge property does not depend on whether the verifier in the protocol is honest or not. A restricted version of our complete problem derives a natural complete problem for BQP.