On the power of multi-prover interactive protocols

We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative interactive proof system model using oracle...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 134; no. 2; pp. 545 - 557
Main Authors Fortnow, Lance, Rompel, John, Sipser, Michael
Format Journal Article
LanguageEnglish
Published Elsevier B.V 21.11.1994
Online AccessGet full text

Cover

More Information
Summary:We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative interactive proof system model using oracles as provers. We also show that every language accepted by these models lies in nondeterministic exponential time. We exhibit a relativized world where a co-NP language does not have multiple prover interactive proofs. Finally, we show a simple example that one cannot parallelize multiple prover protocols as easily as the single prover model.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(94)90251-8