How to delegate computations: the power of no-signaling proofs
We construct a 1-round delegation scheme (ie, argument-system) for every language
computable in time t= t (n), where the running time of the prover is poly (t) and the running …
computable in time t= t (n), where the running time of the prover is poly (t) and the running …
Toward probabilistic checking against non-signaling strategies with constant locality
Non-signaling strategies are a generalization of quantum strategies that have been studied
in physics over the past three decades. Recently, they have found applications in theoretical …
in physics over the past three decades. Recently, they have found applications in theoretical …
Modern Interactive Proofs
D Holden - 2022 - dspace.mit.edu
In this thesis, we study several extensions of the concept of interactive proofs. First, we
consider non-signaling multi-prover interactive proofs. Interacting with multiple non …
consider non-signaling multi-prover interactive proofs. Interacting with multiple non …