2018/01/14 by Claude Crépeau, Nan Yang, Crépeau, Claude +1
Computer Science · #Artificial Intelligence in Games #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1801.04598
openalex publication_date 2018/01/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.