New Perspectives on Multi-Prover Interactive Proofs

01/14/2018
by   Claude Crépeau, et al.
0

The existing multi-prover interactive proof framework suffers from incompleteness in terms of soundness and zero-knowledge that is not completely addressed in the literature. The problem is that the existing definitions of what is local, entangled and no-signalling are not rich enough to capture the full generality of multi-prover interaction. In general, existing proofs do not take into account possible changes in locality either during a protocol's execution or when protocols are composed together. This is especially problematic for zero-knowledge, as composing commitments is the only known way of achieving zero-knowledge outside of some NP-intermediate languages. In this work, we introduce the locality hierarchy for multiparty (multi-round) interaction, and for the first time a complete definition of multi-round multiparty no-signalling distributions and strategies. Within this framework, we define the locality of a protocol which involves the provers, verifiers, simulators and distinguishers. We show that an existing protocol for NEXP [BFL90] and a zero-knowledge variant we introduce are sound in a local sense, but are zero-knowledge in a sense that is even stronger than usually understood. All prior claims of zero-knowledge proofs in the multi-prover model were actually incorrect. Finally, we present similar constructions for entangled and no-signalling prover sets for NEXP and EXP based on [IV12] and [KRR14] using new multi-prover commitment schemes.

READ FULL TEXT

page 4

page 7

research
07/29/2019

Non-Locality and Zero-Knowledge MIPs

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

Verifier Non-Locality in Interactive Proofs

In multi-prover interactive proofs, the verifier interrogates the prover...
research
01/05/2023

Streaming Zero-Knowledge Proofs

We initiate the study of zero-knowledge proofs for data streams. Streami...
research
02/08/2022

Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths

In this paper we describe protocols which use a standard deck of cards t...
research
12/18/2019

Practical Relativistic Zero-Knowledge for NP

In this work we consider the following problem: in a Multi-Prover enviro...

Please sign up or login with your details

Forgot password? Click here to reset