DIZK: A Distributed Zero Knowledge Proof System

Howard Wu, Wenting Zheng, Alessandro Chiesa, 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.

Available format(s)
Category
Implementation
Publication info
Published elsewhere. MAJOR revision.USENIX Security 2018
Keywords
zero knowledge proofscluster computingSNARKs
Contact author(s)
alexch @ berkeley edu
History
Short URL
https://ia.cr/2018/691

CC BY

BibTeX

@misc{cryptoeprint:2018/691,
author = {Howard Wu and Wenting Zheng and Alessandro Chiesa and Raluca Ada Popa and Ion Stoica},
title = {DIZK: A Distributed Zero Knowledge Proof System},
howpublished = {Cryptology ePrint Archive, Paper 2018/691},
year = {2018},
note = {\url{https://eprint.iacr.org/2018/691}},
url = {https://eprint.iacr.org/2018/691}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.