Cryptology ePrint Archive: Report 2018/691

DIZK: A Distributed Zero Knowledge Proof System

Howard Wu and Wenting Zheng and Alessandro Chiesa and Raluca Ada Popa and Ion Stoica

Abstract: Recently there has been much academic and industrial interest in practical implementations of *zero knowledge proofs*. These techniques allow a party to *prove* to another party that a given statement is true without revealing any additional information. In a Bitcoin-like system, this allows a payer to prove validity of a payment without disclosing the payment's details.

Unfortunately, the existing systems for generating such proofs are very expensive, especially in terms of memory overhead. Worse yet, these systems are "monolithic", so they are limited by the memory resources of a single machine. This severely limits their practical applicability.

We describe DIZK, a system that *distributes* the generation of a zero knowledge proof across machines in a compute cluster. Using a set of new techniques, we show that DIZK scales to computations of up to billions of logical gates (100x larger than prior art) at a cost of 10$\mu$s per gate (100x faster than prior art). We then use DIZK to study various security applications.

Category / Keywords: implementation / zero knowledge proofs; cluster computing; SNARKs

Original Publication (with major differences): USENIX Security 2018

Date: received 18 Jul 2018

Contact author: alexch at berkeley edu

Available format(s): PDF | BibTeX Citation

Version: 20180719:135148 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]