How to delegate computations: the power of no-signaling proofs

    STOC, pp. 485-494, 2014.

    Cited by: 101|Bibtex|Views23|Links
    EI
    Keywords:
    algorithmsdesignmodels of computationmodes of computationtheoryMore(2+)

    Abstract:

    We construct a 1-round delegation scheme (i.e., argument system) for every language computable in time t = t(n), where the running time of the prover is poly(t) and the running time of the verifier is n · polylog(t). In particular, for every language in P we obtain a delegation scheme with almost linear time verification. Our construction...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments