Sciweavers

14 search results - page 1 / 3
» Interactive Proofs with Space Bounded Provers
Sort
View
CRYPTO
1991
Springer
144views Cryptology» more  CRYPTO 1991»
13 years 8 months ago
Interactive Proofs with Space Bounded Provers
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
Joe Kilian, Ronitt Rubinfeld
COCO
2008
Springer
97views Algorithms» more  COCO 2008»
13 years 6 months ago
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda, Xi...
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
13 years 10 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
ECCC
2010
98views more  ECCC 2010»
13 years 3 months ago
Verifying Computations with Streaming Interactive Proofs
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
Graham Cormode, Justin Thaler, Ke Yi
CSL
2007
Springer
13 years 11 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart