Algebraic methods for interactive proof systems

Carsten Lund*, Lance Fortnow, Howard Karloff, Noam Nisan

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

58 Scopus citations


An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an active proof system. For the proof a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications for program checking, verification, and self-correction.

Original languageAmerican English
Pages (from-to)2-10
Number of pages9
JournalIEEE Transactions on Industry Applications
Issue number1 pt 1
StatePublished - Jan 1991
Externally publishedYes
Event1989 Industry Applications Society Annual Meeting - San Diego, CA, USA
Duration: 1 Oct 19895 Oct 1989


Dive into the research topics of 'Algebraic methods for interactive proof systems'. Together they form a unique fingerprint.

Cite this