Algebraic Methods for Interactive Proof Systems

Carsten Lund; Lance Fortnow; Howard Karloff; Noam Nisan

doi:10.1145/146585.146605

Algebraic Methods for Interactive Proof Systems

Carsten Lund, Lance Fortnow, Howard Karloff, Noam Nisan

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

434 Scopus citations

Abstract

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 IP = PSPACE [28] and that MIP = NEXP [4].

Original language	English
Pages (from-to)	859-868
Number of pages	10
Journal	Journal of the ACM
Volume	39
Issue number	4
DOIs	https://doi.org/10.1145/146585.146605
State	Published - 10 Jan 1992

Access to Document

10.1145/146585.146605

Cite this

@article{908c38ae262a4a45ad4a04b63f33d2d3,

title = "Algebraic Methods for Interactive Proof Systems",

abstract = "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 IP = PSPACE [28] and that MIP = NEXP [4].",

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

year = "1992",

month = jan,

day = "10",

doi = "10.1145/146585.146605",

language = "אנגלית",

volume = "39",

pages = "859--868",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "4",

}

TY - JOUR

T1 - Algebraic Methods for Interactive Proof Systems

AU - Lund, Carsten

AU - Fortnow, Lance

AU - Karloff, Howard

AU - Nisan, Noam

PY - 1992/1/10

Y1 - 1992/1/10

N2 - 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 IP = PSPACE [28] and that MIP = NEXP [4].

AB - 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 IP = PSPACE [28] and that MIP = NEXP [4].

UR - http://www.scopus.com/inward/record.url?scp=0026930922&partnerID=8YFLogxK

U2 - 10.1145/146585.146605

DO - 10.1145/146585.146605

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0026930922

SN - 0004-5411

VL - 39

SP - 859

EP - 868

JO - Journal of the ACM

JF - Journal of the ACM

IS - 4

ER -

Algebraic Methods for Interactive Proof Systems

Abstract

Access to Document

Other files and links

Fingerprint

Cite this