Multi-prover Interactive Proofs
Multi-Prover Interactive Proofs is an interactive proof system in which a probabilistic polynomial-time verifier interacts with multiple provers who are computationally unbounded but unable to communicate with one another, thereby enabling stronger verification power through spatially separated cooperation.
26
Publications
2.4K
Citations
41
Authors
28
Institutions
Publications per year
2017–2026
2
Parents
26
Interactive proofs and the hardness of approximating cliques
Uriel Feige, Shafi Goldwasser, László Lovász et al. · Journal of the ACM · 1996 · 524 citations · Full text
Multi-prover interactive proofs: how to remove intractability
Michael Ben-Or, Shafi Goldwasser, Joe Kilian · 1988 · 484 citations
Consequences and Limits of Nonlocal Strategies
2004 · 310 citations
Consequences and limits of nonlocal strategies
Richard Cleve, Ben Toner, John Watrous · 2004 · 166 citations
1–5 of 26
41
5
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 41
28
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
6 publications
1.2K citations

National Institute of Informatics
Tokyo, Japan
4 h-index
7 publications
307 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
94 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
5 publications
97 citations
University of Chicago
Chicago, United States
2 h-index
3 publications
99 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
2 publications
67 citations

McGill University
Montreal, Canada
2 h-index
2 publications
100 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
197 citations
1–8 of 28
Repository · 2 publications · 32 citations
2
h-index
1 publications · 100 citations
1
h-index
Conference · 1 publications · 16 citations
1
h-index
1 publications · 190 citations
1
h-index
1 publications · 45 citations
1
h-index
1–5