Verifier Non-Locality in Interactive Proofs

04/08/2018
by   Claude Crépeau, et al.
0

In multi-prover interactive proofs, the verifier interrogates the provers and attempts to steal their knowledge. Other than that, the verifier's role has not been studied. Augmentation of the provers with non-local resources results in classes of languages that may not be NEXP. We have discovered that the verifier plays a much more important role than previously thought. Simply put, the verifier has the capability of providing non-local resources for the provers intrinsically. Therefore, standard MIPs may already contain protocols equivalent to one in which the prover is augmented non-locally. Existing MIPs' proofs of soundness implicitly depend on the fact that the verifier is not a non-local resource provider. The verifier's non-locality is a new unused tool and liability for protocol design and analysis. Great care should have been taken when claiming that ZKMIP=MIP and MIP = NEXP. For the former case, we show specific issues with existing protocols and revisit the proof of this statement. For the latter case, we exhibit doubts that we do not fully resolve. To do this, we define a new model of multi-prover interactive proofs which we call "correlational confinement form".

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/14/2018

New Perspectives on Multi-Prover Interactive Proofs

The existing multi-prover interactive proof framework suffers from incom...
research
02/24/2020

On the complexity of zero gap MIP*

The class MIP^* is the set of languages decidable by multiprover interac...
research
07/29/2019

Non-Locality and Zero-Knowledge MIPs

The foundation of zero-knowledge is the simulator: a weak machine capabl...
research
08/01/2017

Rational Proofs with Non-Cooperative Provers

Interactive-proof-based approaches are widely used in verifiable computa...
research
08/21/2018

Machine learning non-local correlations

The ability to witness non-local correlations lies at the core of founda...
research
09/15/2021

Beating Classical Impossibility of Position Verification

Chandran et al. (SIAM J. Comput.'14) formally introduced the cryptograph...
research
05/28/2019

Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision

We study the problem of approximating the commuting-operator value of a ...

Please sign up or login with your details

Forgot password? Click here to reset