Results 1  10
of
10
NonDeterministic Exponential Time has TwoProver Interactive Protocols
"... We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language ..."
Abstract

Cited by 402 (40 self)
 Add to MetaCart
We determine the exact power of twoprover interactive proof systems introduced by BenOr, Goldwasser, Kilian, and Wigderson (1988). In this system, two allpowerful noncommunicating provers convince a randomizing polynomial time verifier in polynomial time that the input z belongs to the language L. It was previously suspected (and proved in a relativized sense) that coNPcomplete languages do not admit such proof systems. In sharp contrast, we show that the class of languages having twoprover interactive proof systems is nondeterministic exponential time. After the recent results that all languages in PSPACE have single prover interactive proofs (Lund, Fortnow, Karloff, Nisan, and Shamir), this represents a further step demonstrating the unexpectedly immense power of randomization and interaction in efficient provability. Indeed, it follows that multiple provers with coins are strictly stronger than without, since NEXP # NP. In particular, for the first time, provably polynomial time intractable languages turn out to admit “efficient proof systems’’ since NEXP # P. We show that to prove membership in languages in EXP, the honest provers need the power of EXP only. A consequence, linking more standard concepts of structural complexity, states that if EX P has polynomial size circuits then EXP = Cg = MA. The first part of the proof of the main result extends recent techniques of polynomial extrapolation of truth values used in the single prover case. The second part is a verification scheme for multilinearity of an nvariable function held by an oracle and can be viewed as an independent result on program verification. Its proof rests on combinatorial techniques including the estimation of the expansion rate of a graph.
Algebraic Methods for Interactive Proof Systems
, 1990
"... We present a new algebraic technique for the construction of interactive proof systems. We use our technique to prove that every language in the polynomialtime hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP=PSPACE (Shamir) and that MIP ..."
Abstract

Cited by 305 (29 self)
 Add to MetaCart
We present a new algebraic technique for the construction of interactive proof systems. We use our technique to prove that every language in the polynomialtime hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that IP=PSPACE (Shamir) and that MIP=NEXP (Babai, Fortnow and Lund).
ComplexityTheoretic Aspects of Interactive Proof Systems
, 1989
"... In 1985, Goldwasser, Micali and Rackoff formulated interactive proof systems as a tool for developing cryptographic protocols. Indeed, many exciting cryptographic results followed from studying interactive proof systems and the related concept of zeroknowledge. Interactive proof systems also have a ..."
Abstract

Cited by 19 (3 self)
 Add to MetaCart
In 1985, Goldwasser, Micali and Rackoff formulated interactive proof systems as a tool for developing cryptographic protocols. Indeed, many exciting cryptographic results followed from studying interactive proof systems and the related concept of zeroknowledge. Interactive proof systems also have an important part in complexity theory merging the well established concepts of probabilistic and nondeterministic computation. This thesis will study the complexity of various models of interactive proof systems. A perfect zeroknowledge interactive protocol convinces a verifier that a string is in a language without revealing any additional knowledge in an information theoretic sense. This thesis will show that for any language that has a perfect zeroknowledge proof system, its complement has a short interactive protocol. This result implies that there are not any perfect zeroknowledge protocols for NPcomplete languages unless the polynomialtime hierarchy collapses. Thus knowledge comp...
Email and the unexpected power of interaction
 Structure in Complexity theory
, 1988
"... This is a true fable about Merlin, the infinitely intelligent but never trusted magician; and Arthur, the reasonable but impatient sovereign with an occasional unorthodox request; about the concept of an efficient proof; about polynomials and interpolation, electronic mail, coin flipping, and the in ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
This is a true fable about Merlin, the infinitely intelligent but never trusted magician; and Arthur, the reasonable but impatient sovereign with an occasional unorthodox request; about the concept of an efficient proof; about polynomials and interpolation, electronic mail, coin flipping, and the incredible power of interaction. About MIP, IP, #P, P SP ACE, NEXP T IME, and new techniques that do not relativize. About fast progress, fierce competition, and email ethics. 1 How did Merlin end up in the cave? In the court of King Arthur1 there lived 150 knights and 150 ladies. “Why not 150 married couples, ” the King contemplated one rainy afternoon, and action followed the thought. He asked the Royal Secret Agent (RSA) to draw up a diagram with all the 300 names, indicating bonds of mutual interest between lady and knight by a red line; and the lack thereof, by a blue line. The diagram, with its 1502 = 22, 500 colored lines, looked somewhat confusing, yet it should not confuse Merlin, the court magician, to whom it was subsequently presented by Arthur with the express order to find a perfect matching consisting exclusively of red lines. Merlin walked away, looked at the diagram, and, with his unlimited intellectual ability, immediately recognized that none of the 150! possibilities gave an allred perfect matching. He quickly completed the 150! diagrams, highlighting the wrong blue line in
A Short History of Computational Complexity
 IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY
, 2002
"... this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quit ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quite young eld
The Power Of Interaction
, 1991
"... : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : vii Chapter 1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : 1 2. PRELIMINARIES : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1 Basic Definitions : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.1 Basics : : ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : vii Chapter 1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : 1 2. PRELIMINARIES : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1 Basic Definitions : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.1 Basics : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.2 Boolean Formulas : : : : : : : : : : : : : : : : : 4 2.1.3 Arithmetic Formulas and Expressions : : : : : : 5 2.2 Computational Models : : : : : : : : : : : : : : : : : : : : 9 2.2.1 Deterministic Computation : : : : : : : : : : : : 9 2.2.2 Probabilistic Computation : : : : : : : : : : : : 11 2.2.3 NonDeterministic Computation : : : : : : : : : 12 2.2.4 Alternating Computations : : : : : : : : : : : : 13 2.2.5 Interactive Proof Systems : : : : : : : : : : : : : 13 2.2.6 Multiple Prover Interactive Proof Systems : : : 15 2.2.7 Computation relative to an Oracle : : : : : : : : 15 2.3 Complexity Classes : : : : : : : : : : : : : : : : : : : : ...
On helping and interactive proof systems
 International Journal of Foundations of Computer Science
, 1995
"... We investigate the complexity of honest provers in interactive proof systems. This corresponds precisely to the complexity of oracles helping the computation of robust probabilistic oracle machines. We obtain upper bounds for languages in FewEXP and for sparse sets in NP. Further, interactive protoc ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
We investigate the complexity of honest provers in interactive proof systems. This corresponds precisely to the complexity of oracles helping the computation of robust probabilistic oracle machines. We obtain upper bounds for languages in FewEXP and for sparse sets in NP. Further, interactive protocols with provers that are reducible to sets of low information content are considered. Specifically, if the verifier communicates only with provers in P=poly, then the accepted language is low for \Sigma p 2. In the case that the provers are polynomialtime reducible to logsparse sets or to sets in strongP/log then the protocol can be simulated by the verifier even without the help of provers. As a consequence we obtain new collapse results under the assumption that intractable sets reduce to sets with low information content. 1 Introduction and overview of results Two extensions of the concept of NP (as the class of languages with efficient proofs of
My Favorite Ten Complexity Theorems of the Past Decade
"... We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discuss work done in various areas of complexity theory. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We review the past ten years in computational complexity theory by focusing on ten theorems that the author enjoyed the most. We use each of the theorems as a springboard to discuss work done in various areas of complexity theory.
The Computational Complexity Column
"... this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quit ..."
Abstract
 Add to MetaCart
this article mention all of the amazing research in computational complexity theory. We survey various areas in complexity choosing papers more for their historical value than necessarily the importance of the results. We hope that this gives an insight into the richness and depth of this still quite young eld
Quantum interactive proofs with weak error bounds Tsuyoshi Ito ∗ Hirotada Kobayashi † John Watrous ∗
"... A full version is available as arXiv.org ePrint 1012.4427 [quantph]. ..."