Succinct delegation for low-space non-deterministic computation
STOC '18: Symposium on Theory of Computing Los Angeles CA USA June, 2018, pp. 709-721, 2018.
We construct a delegation scheme for verifying non-deterministic computations, with complexity proportional only to the non-deterministic space of the computation. Specifically, letting n denote the input length, we construct a delegation scheme for any language verifiable in non-deterministic time and space (T(n), S(n)) with communicatio...More
Full Text (Upload PDF)