Perfect zero knowledge for quantum multiprover interactive proofs

05/27/2019
by   Alex B. Grilo, et al.
0

In this work we consider the interplay between multiprover interactive proofs, quantum entanglement, and zero knowledge proofs - notions that are central pillars of complexity theory, quantum information and cryptography. In particular, we study the relationship between the complexity class MIP^*, the set of languages decidable by multiprover interactive proofs with quantumly entangled provers, and the class PZKMIP^*, which is the set of languages decidable by MIP^* protocols that furthermore possess the perfect zero knowledge property. Our main result is that the two classes are equal, i.e., MIP^* = PZKMIP^*. This result provides a quantum analogue of the celebrated result of Ben-Or, Goldwasser, Kilian, and Wigderson (STOC 1988) who show that MIP = PZKMIP (in other words, all classical multiprover interactive protocols can be made zero knowledge). We prove our result by showing that every MIP^* protocol can be efficiently transformed into an equivalent zero knowledge MIP^* protocol in a manner that preserves the completeness-soundness gap. Combining our transformation with previous results by Slofstra (Forum of Mathematics, Pi 2019) and Fitzsimons, Ji, Vidick and Yuen (STOC 2019), we obtain the corollary that all co-recursively enumerable languages (which include undecidable problems as well as all decidable problems) have zero knowledge MIP^* protocols with vanishing promise gap.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2019

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

We study the relationship between problems solvable by quantum algorithm...
research
01/05/2023

Streaming Zero-Knowledge Proofs

We initiate the study of zero-knowledge proofs for data streams. Streami...
research
06/14/2023

Quantum interactive proofs using quantum energy teleportation

We present a simple quantum interactive proof (QIP) protocol using the q...
research
12/06/2022

On Zero-Knowledge Proofs over the Quantum Internet

This paper presents a new method for quantum identity authentication (QI...
research
06/23/2023

Quantum Merlin-Arthur and proofs without relative phase

We study a variant of QMA where quantum proofs have no relative phase (i...
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