Multi-oracle interactive protocols with constant space verifiers

DOI10.1016/0022-0000(92)90021-AzbMath0757.68050OpenAlexW2007426955MaRDI QIDQ1190986

Uriel Feige, Adi Shamir

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

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

Related Items

Constant-space quantum interactive proofs against multiple provers, Unnamed Item, An application of quantum finite automata to interactive proof systems, Constant-space, constant-randomness verifiers with arbitrarily small error

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Addendum to: Non-deterministic exponential time has two-prower interactive protocols
• Probabilistic game automata
• The Knowledge Complexity of Interactive Proof Systems