Delegation for bounded space

    STOC, 2013.

    Cited by: 46|Bibtex|Views9|Links
    EI
    Keywords:
    aiello et-albounded spacecomputation delegationno-signaling strategy1-round delegation schemeMore(7+)

    Abstract:

    We construct a 1-round delegation scheme for every language computable in time t=t(n) and space s=s(n), where the running time of the prover is poly(t) and the running time of the verifier is ~O(n + poly(s)) (where ~O hides polylog(t) factors). The proof exploits a curious connection between the problem of computation delegation and the m...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments