Non-Locality in Interactive Proofs
Quantum Physics
2019-03-19 v4 Cryptography and Security
Information Theory
math.IT
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.
Cite
@article{arxiv.1801.04598,
title = {Non-Locality in Interactive Proofs},
author = {Claude Crépeau and Nan Yang},
journal= {arXiv preprint arXiv:1801.04598},
year = {2019}
}
Comments
32 pages, 14 figures. Submitted to Crypto 2019, Feb 2019. Report arXiv:1804.02724 merged here in the update process