Cryptology ePrint Archive: Report 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.

Category / Keywords: cryptographic protocols / multi-prover interactive proofs, Zero-Knowledge

Date: received 14 Jan 2018, last revised 16 Mar 2019

Contact author: claude crepeau at mcgill ca

Available format(s): PDF | BibTeX Citation

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

Version: 20190316:221958 (All versions of this report)

Short URL: ia.cr/2018/065


[ Cryptology ePrint archive ]