Algebraic Methods for Interactive Proof Systems

Carsten Lund; Lance Fortnow; Howard Karloff; Noam Nisan

doi:10.1109/FSCS.1990.89518

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: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

80 Scopus citations

Abstract

We present a new algebraic technique for the construction of interactive proof systems. We use our technique 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 (Shamir) and that MIP=NEXP (Babai, Fortnow and Lund).

Original language	English
Title of host publication	Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990
Publisher	IEEE Computer Society
Pages	2-10
Number of pages	9
ISBN (Print)	081862082X
DOIs	https://doi.org/10.1109/FSCS.1990.89518
State	Published - 1990
Event	31st Annual Symposium on Foundations of Computer Science, FOCS 1990 - St. Louis, MO, USA, United States Duration: 22 Oct 1990 → 24 Oct 1990

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)	0272-5428

Conference

Conference	31st Annual Symposium on Foundations of Computer Science, FOCS 1990
Country/Territory	United States
City	St. Louis, MO, USA
Period	22/10/90 → 24/10/90

Bibliographical note

Publisher Copyright:
© 1990 IEEE.

Access to Document

10.1109/FSCS.1990.89518

Cite this

@inproceedings{fd485b36ad1d4abcadd052267d12e7a1,

title = "Algebraic Methods for Interactive Proof Systems",

abstract = "We present a new algebraic technique for the construction of interactive proof systems. We use our technique 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 (Shamir) and that MIP=NEXP (Babai, Fortnow and Lund).",

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

note = "Publisher Copyright: {\textcopyright} 1990 IEEE.; 31st Annual Symposium on Foundations of Computer Science, FOCS 1990 ; Conference date: 22-10-1990 Through 24-10-1990",

year = "1990",

doi = "10.1109/FSCS.1990.89518",

language = "אנגלית",

isbn = "081862082X",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "2--10",

booktitle = "Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990",

address = "ארצות הברית",

}

Lund, C, Fortnow, L, Karloff, H & Nisan, N 1990, Algebraic Methods for Interactive Proof Systems. in Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, IEEE Computer Society, pp. 2-10, 31st Annual Symposium on Foundations of Computer Science, FOCS 1990, St. Louis, MO, USA, United States, 22/10/90. https://doi.org/10.1109/FSCS.1990.89518

Algebraic Methods for Interactive Proof Systems. / Lund, Carsten; Fortnow, Lance; Karloff, Howard et al.
Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990. IEEE Computer Society, 1990. p. 2-10 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Algebraic Methods for Interactive Proof Systems

AU - Lund, Carsten

AU - Fortnow, Lance

AU - Karloff, Howard

AU - Nisan, Noam

PY - 1990

Y1 - 1990

N2 - We present a new algebraic technique for the construction of interactive proof systems. We use our technique 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 (Shamir) and that MIP=NEXP (Babai, Fortnow and Lund).

AB - We present a new algebraic technique for the construction of interactive proof systems. We use our technique 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 (Shamir) and that MIP=NEXP (Babai, Fortnow and Lund).

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

U2 - 10.1109/FSCS.1990.89518

DO - 10.1109/FSCS.1990.89518

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:105031764462

SN - 081862082X

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 2

EP - 10

BT - Proceedings - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990

PB - IEEE Computer Society

T2 - 31st Annual Symposium on Foundations of Computer Science, FOCS 1990

Y2 - 22 October 1990 through 24 October 1990

ER -

Algebraic Methods for Interactive Proof Systems

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this