Interactive proofs with space bounded provers

Joe Kilian, Ronitt Rubinfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Recent results in interactive proof systems [12][13][1] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it is for a prover in a multiple prover interactive proof system. We show that this is not the case for a single prover in which all but a fixed polynomial of the prover’s space is erased between each round. One consequence of this is that any multiple prover interactive protocol in which the provers need only a polynomial amount of space can be easily transformed into a single prover interactive protocol where the prover has only a fixed polynomial amount of space. This result also shows that one can easily transform checkers [5] into adaptive checkers [7] under the assumption that the program being checked has space bounded by a fixed polynomial.

Original languageEnglish
Title of host publicationAdvances in Cryptology — CRYPTO 1991, Proceedings
EditorsJoan Feigenbaum
PublisherSpringer Verlag
Number of pages7
ISBN (Print)9783540551881
StatePublished - 1992
Externally publishedYes
Event11th Confrence on Advances in Cryptology, CRYPTO 1991 - Santa Barbara, United States
Duration: 11 Aug 199115 Aug 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume576 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th Confrence on Advances in Cryptology, CRYPTO 1991
Country/TerritoryUnited States
CitySanta Barbara


Dive into the research topics of 'Interactive proofs with space bounded provers'. Together they form a unique fingerprint.

Cite this