[Resource Topic] 2025/2113: Single-Server Private Outsourcing of zk-SNARKs

Welcome to the resource topic for 2025/2113

Title:
Single-Server Private Outsourcing of zk-SNARKs

Authors: Kasra Abbaszadeh, Hossein Hafezi, Jonathan Katz, Sarah Meiklejohn

Abstract:

Succinct zero-knowledge arguments (zk-SNARKs) enable a prover to convince a verifier of the truth of a statement via a succinct and efficiently verifiable proof without revealing any additional information about the secret witness. A barrier to practical deployment of zk-SNARKs is their high proving cost. With this motivation, we study server-aided zk-SNARKs, where a client/prover outsources most of its work to a single, untrusted server while the server learns nothing about the witness or even the proof. We formalize this notion and show how to realize server-aided proving for widely deployed zk-SNARKs, including Nova, Groth16, and Plonk.

The key building block underlying our designs is a new primitive, encrypted multi-scalar multiplication (EMSM), that enables private delegation of multi-scalar multiplications (MSMs). We construct an EMSM from variants of the learning parity with noise assumption in which the client does O(1) group operations, while the server’s work matches that of the plaintext MSM.

We implement and evaluate our constructions. Compared to local proving, our techniques lower the client’s computation by up to 20\times and reduce the proving latency by up to 9\times.

ePrint: https://eprint.iacr.org/2025/2113

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .