@inproceedings{9b6933849d694016b4d1b5b86ca3090e,
title = "Interactive proofs with space bounded provers",
abstract = "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{\textquoteright}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.",
author = "Joe Kilian and Ronitt Rubinfeld",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1992.; null ; Conference date: 11-08-1991 Through 15-08-1991",
year = "1992",
doi = "10.1007/3-540-46766-1_17",
language = "אנגלית",
isbn = "9783540551881",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "225--231",
editor = "Joan Feigenbaum",
booktitle = "Advances in Cryptology — CRYPTO 1991, Proceedings",
}