Proceedings  31st Annual Symposium on Foundations of Computer Science (1990)
St. Louis, MO, USA
Oct. 22, 1990 to Oct. 24, 1990
pp: 2-10 vol.1
C. Lund , Chicago Univ., IL, USA
L. Fortnow , Chicago Univ., IL, USA
H. Karloff , Chicago Univ., IL, USA
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 interactive 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.
program checking, polynomial value verification, program verification, program self correction, interactive proof systems, algebraic technique, language, polynomial-time hierarchy, low-degree polynomial
C. Lund, L. Fortnow, H. Karloff and N. Nisan, "Algebraic methods for interactive proof systems," Proceedings  31st Annual Symposium on Foundations of Computer Science(FOCS), St. Louis, MO, USA, 1990, pp. 2-10 vol.1.