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 complexity class resulting from non-interactive quantum perfect zero-knowledge proof systems of perfect completeness has a natural complete promise problem. Using our complete promise problem, the Graph Non-Automorphism problem is shown to have a non-interactive quantum perfect zero-knowledge proof system. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Kobayashi, H. (2003). Non-interactive quantum perfect and statistical zero-knowledge. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2906, 178–188. https://doi.org/10.1007/978-3-540-24587-2_20
Mendeley helps you to discover research relevant for your work.