IP=PSPACE (interactive proof=polynomial space)

It is proved that, when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space. The interactive proofs introduced use only public coins, are accepted with probability one when the prover...

Full description

Saved in:
Bibliographic Details
Published inFoundations of Computer Science, 31st Symposium pp. 11 - 15 vol.1
Main Author Shamir, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1990
Subjects
Boolean functions
Mathematics
Polynomials
Online AccessGet full text
ISBN081862082X
9780818620829
DOI10.1109/FSCS.1990.89519

Cover

More Information
Summary:It is proved that, when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space. The interactive proofs introduced use only public coins, are accepted with probability one when the prover is honest, require only logarithmic workspace when the verifier is given a two-way access to his or her random tape, and by the use of known techniques can be turned into zero-knowledge proofs under the sole assumption that one-way functions exist.< >
ISBN:081862082X
9780818620829
DOI:10.1109/FSCS.1990.89519