Multi-oracle interactive protocols with constant space verifiers

DOI10.1016/0022-0000(92)90021-AMaRDI QIDQ1190986zbMATH OpenOpenAlexFDO

Authors Adi Shamir, Uriel Feige

Publication date 27 September 1992

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(92)90021-a

zbMATH Keywords

interactive protocolcollaborating provers modelopposing provers modelreasonable games of incomplete information

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Network design and communication in computer systems (68M10)

Recommendations

• On the power of multi-prover interactive protocols
• scientific article; zbMATH DE number 18527
• Alternation in interaction

Cites work

• scientific article; zbMATH DE number 4180787 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• Addendum to: Non-deterministic exponential time has two-prower interactive protocols
• Probabilistic game automata
• The Knowledge Complexity of Interactive Proof Systems
• The complexity of two-player games of incomplete information

Cited in

(8)

• Constant-space quantum interactive proofs against multiple provers
• Finite state verifiers with constant randomness
• scientific article; zbMATH DE number 7525466 (Why is no real title available?)
• scientific article; zbMATH DE number 176552 (Why is no real title available?)
• scientific article; zbMATH DE number 18527 (Why is no real title available?)
• An application of quantum finite automata to interactive proof systems
• Constant-space, constant-randomness verifiers with arbitrarily small error
• scientific article; zbMATH DE number 3992936 (Why is no real title available?)

This page was built for publication: Multi-oracle interactive protocols with constant space verifiers

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