Algebraic methods for interactive proof systems

Carsten Lund; Lance Fortnow; Howard Karloff; Noam Nisan

Algebraic methods for interactive proof systems

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

^*Corresponding author for this work

Research output: Contribution to journal › Conference article › peer-review

63 Scopus citations

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

Cite this

@article{19fdd49bd43842c78d01d5fd2475144d,

title = "Algebraic methods for interactive proof systems",

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.",

author = "Carsten Lund and Lance Fortnow and Howard Karloff and Noam Nisan",

year = "1991",

month = jan,

language = "אנגלית",

volume = "27",

pages = "2--10",

journal = "IEEE Transactions on Industry Applications",

issn = "0093-9994",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1 pt 1",

note = "1989 Industry Applications Society Annual Meeting ; Conference date: 01-10-1989 Through 05-10-1989",

}

TY - JOUR

T1 - Algebraic methods for interactive proof systems

AU - Lund, Carsten

AU - Fortnow, Lance

AU - Karloff, Howard

AU - Nisan, Noam

PY - 1991/1

Y1 - 1991/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0025838554

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0025838554

SN - 0093-9994

VL - 27

SP - 2

EP - 10

JO - IEEE Transactions on Industry Applications

JF - IEEE Transactions on Industry Applications

IS - 1 pt 1

T2 - 1989 Industry Applications Society Annual Meeting

Y2 - 1 October 1989 through 5 October 1989

ER -

Algebraic methods for interactive proof systems

Abstract

Other files and links

Fingerprint

Cite this