Multi-oracle interactive protocols with constant space verifiers

DOI10.1016/0022-0000(92)90021-AzbMATH Open0757.68050OpenAlexW2007426955MaRDI QIDQ1190986FDOQ1190986

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• The complexity of two-player games of incomplete information
• The Knowledge Complexity of Interactive Proof Systems
• Addendum to: Non-deterministic exponential time has two-prower interactive protocols
• Probabilistic game automata
• Title not available (Why is that?)

Cited In (8)

• Constant-space quantum interactive proofs against multiple provers
• Finite state verifiers with constant randomness
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An application of quantum finite automata to interactive proof systems
• Constant-space, constant-randomness verifiers with arbitrarily small error
• Title not available (Why is that?)

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)