Interactive proofs with space bounded provers

DOI10.1007/3-540-46766-1_17MaRDI QIDQ4035721zbMATH OpenFDO

Authors Joe Kilian, Ronitt Rubinfeld

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46766-1_17

zbMATH Keywords

adaptive checkersinteractive proof systemsmultiple prover interactive protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 512981
• Multi-oracle interactive protocols with constant space verifiers
• scientific article; zbMATH DE number 66620
• On the power of multi-prover interactive protocols
• PSPACE is provable by two provers in one round

Cited in

(5)

• PSPACE is provable by two provers in one round
• Efficient rational proofs for space bounded computations
• On the complexity of interactive proofs with bounded communication
• Interactive proof systems and alternating time-space complexity
• A low communication competitive interactive proof system for promised quadratic residuosity

This page was built for publication: Interactive proofs with space bounded provers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035721)