Algebraic Methods for Interactive Proof Systems

A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. This technique played a pivotal role in the recent proofs that 1P= PSPACE [28] and that MIP = NEXP [4].

• Type: Conference
• Year: 1990
• Where: FOCS
• Authors: Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
• Keywords: FOCS 1990, Interactive Proof System, Pivotal Role, Polynomial-time Hierarchy, Theoretical Computer Science