Oracle Separations Between Quantum and Non-interactive Zero-Knowledge Classes

07/06/2019
by   Benjamin Morrison, et al.
0

We study the relationship between problems solvable by quantum algorithms in polynomial time and those for which zero-knowledge proofs exist. In prior work, Aaronson [arxiv:quant-ph/0111102] showed an oracle separation between BQP and SZK, i.e. an oracle A such that SZK^A ⊈BQP^A. In this paper we give a simple extension of Aaronson's result to non-interactive zero-knowledge proofs with perfect security. This class, NIPZK, is the most restrictive zero-knowledge class. We show that even for this class we can construct an A with NIPZK^A ⊈BQP^A.

READ FULL TEXT

page 1

page 2

page 3

research
05/27/2019

Perfect zero knowledge for quantum multiprover interactive proofs

In this work we consider the interplay between multiprover interactive p...
research
01/26/2018

Oracle Separations for Quantum Statistical Zero-Knowledge

This paper investigates the power of quantum statistical zero knowledge ...
research
11/18/2019

Zero-Knowledge for QMA from Locally Simulatable Proofs

We provide several advances to the understanding of the class of Quantum...
research
08/03/2020

Demystifying the Role of zk-SNARKs in Zcash

Zero-knowledge proofs have always provided a clear solution when it come...
research
08/13/2021

Time Transitive Functions for Zero Knowledge Proofs

Verifiable delay functions have found a lot of applications in blockchai...
research
06/08/2022

Intractable Group-theoretic Problems Around Zero-knowledge Proofs

This paper gives a brief overview of zero-knowledge proof systems and en...

Please sign up or login with your details

Forgot password? Click here to reset