Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems

Multi-prover interactive proofs: how to remove intractability assumptions

M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson · 1988

Earlier work this paper cites.

Non-deterministic exponential time has two-prover interactive protocols

L. Babai, L. Fortnow, and C. Lund · 1991

Earlier work this paper cites.

On the success probability of two provers in one-round proof systems

U. Feige · 1991

Earlier work this paper cites.

Two-prover one-round proof systems: their power and their problems

U. Feige and L. Lovász · 1992

Earlier work this paper cites.

On the power of multi-prover interactive protocols

L. Fortnow, J. Rompel, and M. Sipser · 1994

Earlier work this paper cites.

PSPACE has constant-round quantum interactive proof systems

J. Watrous · 1999

Cited alongside, same era.

Non-malleable cryptography

D. Dolev, C. Dwork and M. Naor · 2000

Cited alongside, same era.

Parallelization, amplification, and exponential time simulation of

A. Kitaev and J. Watrous · 2000

Cited alongside, same era.

Some optimal inapproximability results

J. Håstad · 2001

Cited alongside, same era.

Quantum multi-prover interactive proof systems with limited

H. Kobayashi and K. Matsumoto · 2003

Cited alongside, same era.

Consequences and limits of nonlocal strategies

R. Cleve, P. Høyer, B. Toner, J. Watrous · 2004

Later among the works it cites.

On the power of entangled quantum provers

J. Kempe and T. Vidick · 2006

Later among the works it cites.

No quantum advantage for nonlocal computation

N. Linden, S. Popescu, A. J. Short, and A. Winter · 2006

Later among the works it cites.

Entanglement in interactive proof systems with binary answers

Original

S. Wehner · 2006

Later among the works it cites.

On the power of entangled provers: immunizing games against

J. Kempe, H. Kobayashi, K. Matsumoto, B. Toner, and T. Vidick · 2007

Closest in time.