Non-Locality in Interactive Proofs

January 14, 2018 Β· Declared Dead Β· πŸ› Electron. Colloquium Comput. Complex.

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Claude CrΓ©peau, Nan Yang arXiv ID 1801.04598 Category quant-ph: Quantum Computing Cross-listed cs.CR, cs.IT Citations 1 Venue Electron. Colloquium Comput. Complex. Last Checked 5 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted