Verifiable Computation with Massively Parallel Interactive Proofs
Justin Thaler, Mike Roberts, Michael Mitzenmacher, Hanspeter Pfister

TL;DR
This paper demonstrates how leveraging GPU parallelism significantly accelerates verifiable computation protocols, making them practical for real-world cloud computing applications.
Contribution
The authors implement a GPU-accelerated verifiable computation protocol, achieving 40-120x server speedups and enabling practical deployment in cloud systems.
Findings
GPU implementation reduces server slowdown to 100-500x
Client runtime decreased by 100x
Protocols are now practical for real cloud deployment
Abstract
As the cloud computing paradigm has gained prominence, the need for verifiable computation has grown increasingly urgent. The concept of verifiable computation enables a weak client to outsource difficult computations to a powerful, but untrusted, server. Protocols for verifiable computation aim to provide the client with a guarantee that the server performed the requested computations correctly, without requiring the client to perform the computations herself. By design, these protocols impose a minimal computational burden on the client. However, existing protocols require the server to perform a large amount of extra bookkeeping in order to enable a client to easily verify the results. Verifiable computation has thus remained a theoretical curiosity, and protocols for it have not been implemented in real cloud computing systems. Our goal is to leverage GPUs to reduce the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Complexity and Algorithms in Graphs · Stochastic Gradient Optimization Techniques
