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 …
Delegating computations with (almost) minimal time and space overhead
J Holmgren, R Rothblum - 2018 IEEE 59th Annual Symposium …, 2018 - ieeexplore.ieee.org
The problem of verifiable delegation of computation considers a setting in which a client
wishes to outsource an expensive computation to a powerful, but untrusted, server. Since …
wishes to outsource an expensive computation to a powerful, but untrusted, server. Since …
Non-signaling proofs with o (√ log n) provers are in PSPACE
Non-signaling proofs, motivated by quantum computation, have found applications in
cryptography and hardness of approximation. An important open problem is characterizing …
cryptography and hardness of approximation. An important open problem is characterizing …
No-signaling linear PCPs
S Kiyoshima - Theory of Cryptography: 16th International Conference …, 2018 - Springer
In this paper, we give a no-signaling linear probabilistically checkable proof (PCP) system
for polynomial-time deterministic computation, ie, a PCP system for PP such that (1) the PCP …
for polynomial-time deterministic computation, ie, a PCP system for PP such that (1) the PCP …
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 …
On Local Testability in the Non-Signaling Setting
Non-signaling strategies are a generalization of quantum strategies that have been studied
in physics for decades, and have recently found applications in theoretical computer …
in physics for decades, and have recently found applications in theoretical computer …
Non-Signaling Proofs with Provers are in PSPACE
Non-signaling proofs, motivated by quantum computation, have found applications in
cryptography and hardness of approximation. An important open problem is characterizing …
cryptography and hardness of approximation. An important open problem is characterizing …
No-Signaling Linear PCPs
S Kiyoshima - Journal of Cryptology, 2023 - Springer
In this paper, we give a no-signaling linear probabilistically checkable proof (PCP) system
for polynomial-time deterministic computation, ie, a PCP system for P such that (1) the …
for polynomial-time deterministic computation, ie, a PCP system for P such that (1) the …