Delegating Computation

@article{Goldwasser2015DelegatingC,
  title={Delegating Computation},
  author={S. Goldwasser and Y. Kalai and G. N. Rothblum},
  journal={Journal of the ACM (JACM)},
  year={2015},
  volume={62},
  pages={1 - 64}
}
  • S. Goldwasser, Y. Kalai, G. N. Rothblum
  • Published 2015
  • Computer Science, Mathematics
  • Journal of the ACM (JACM)
  • In this work we study interactive proofs for tractable languages. The (honest) prover should be efficient and run in polynomial time or, in other words, a “muggle”.1 The verifier should be super-efficient and run in nearly linear time. These proof systems can be used for delegating computation: a server can run a computation for a client and interactively prove the correctness of the result. The client can verify the result’s correctness in nearly linear time (instead of running the entire… CONTINUE READING
    324 Citations
    Non-interactive delegation and batch NP verification from standard computational assumptions
    • 27
    Non-Interactive RAM and Batch NP Delegation from any PIR
    • 8
    • PDF
    Refereed delegation of computation
    • 30
    • PDF
    Delegating Computations with (Almost) Minimal Time and Space Overhead
    • Justin Holmgren, R. Rothblum
    • Computer Science, Mathematics
    • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2018
    • 8
    • PDF
    Local Proofs Approaching the Witness Length
    • 11
    • PDF
    Verifiable computation using multiple provers
    • 15
    • PDF
    Publicly Verifiable Non-Interactive Arguments for Delegating Computation
    • 13
    • PDF
    Delegation for bounded space
    • 52
    • PDF

    References

    SHOWING 1-2 OF 2 REFERENCES
    Multi-oracle interactive protocols with space bounded verifiers
    • U. Feige, A. Shamir
    • Computer Science, Mathematics
    • [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference
    • 1989
    • 15
    • Highly Influential
    Computational models of games
    • Anne Condon
    • Mathematics, Computer Science
    • ACM distinguished dissertations
    • 1989
    • 84
    • Highly Influential