Non-Locality in Interactive Proofs

Claude Crépeau; Nan Yang

Paper 2018/065

Non-Locality in Interactive Proofs

Claude Crépeau and Nan Yang

Abstract

In multi-prover interactive proofs (MIPs), the verifier is usually non-adaptive. This stems from an implicit problem which we call ``contamination'' by the verifier. We make explicit the verifier contamination problem, and identify a solution by constructing a generalization of the MIP model. This new model quantifies non-locality as a new dimension in the characterization of MIPs. A new property of zero-knowledge emerges naturally as a result by also quantifying the non-locality of the simulator.

Note: Submitted to Crypto 2019. Large revisions from previous versions.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: multi-prover interactive proofs Zero-Knowledge
Contact author(s): claude crepeau @ mcgill ca
History: 2019-03-16: last of 4 revisions; 2018-01-18: received; See all versions
Short URL: https://ia.cr/2018/065
License: CC BY

BibTeX

@misc{cryptoeprint:2018/065,
      author = {Claude Crépeau and Nan Yang},
      title = {Non-Locality in Interactive Proofs},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/065},
      year = {2018},
      url = {https://eprint.iacr.org/2018/065}
}