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: Contribution to journal › Conference article › peer-review

77 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
Pages (from-to)	2-10
Number of pages	9
Journal	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
DOIs	https://doi.org/10.1109/FSCS.1990.89518
State	Published - 1990
Event	Proceedings of the 31st Annual Symposium on Foundations of Computer Science - St. Louis, MO, USA Duration: 22 Oct 1990 → 24 Oct 1990

Bibliographical note

Publisher Copyright:
© 1990 IEEE.

Access to Document

10.1109/FSCS.1990.89518

Cite this

@article{1bf85003a5fb47a48644918a139ba0e5,

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.; Proceedings of the 31st Annual Symposium on Foundations of Computer Science ; Conference date: 22-10-1990 Through 24-10-1990",

year = "1990",

doi = "10.1109/FSCS.1990.89518",

language = "אנגלית",

pages = "2--10",

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

issn = "0272-5428",

}

TY - JOUR

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.contributiontojournal.conferencearticle???

AN - SCOPUS:105031764462

SN - 0272-5428

SP - 2

EP - 10

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

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

T2 - Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Y2 - 22 October 1990 through 24 October 1990

ER -

Algebraic Methods for Interactive Proof Systems

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this