Abstract
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 language | English |
|---|---|
| Pages (from-to) | 2-10 |
| Number of pages | 9 |
| Journal | IEEE Transactions on Industry Applications |
| Volume | 27 |
| Issue number | 1 pt 1 |
| State | Published - Jan 1991 |
| Externally published | Yes |
| Event | 1989 Industry Applications Society Annual Meeting - San Diego, CA, USA Duration: 1 Oct 1989 → 5 Oct 1989 |