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

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2018-78

May 18, 2018

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2018/EECS-2018-78.pdf

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”, meaning 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 (100 times larger than prior art) at a cost of 10 μs per gate (100 times faster than prior art). We then use DIZK to study various security applications.

Advisors: Alessandro Chiesa

---

BibTeX citation:

@mastersthesis{Wu:EECS-2018-78,
    Author= {Wu, Howard and Zheng, Wenting and Chiesa, Alessandro and Popa, Raluca Ada and Stoica, Ion},
    Title= {DIZK: A Distributed Zero-Knowledge Proof System},
    School= {EECS Department, University of California, Berkeley},
    Year= {2018},
    Month= {May},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2018/EECS-2018-78.html},
    Number= {UCB/EECS-2018-78},
    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”, meaning 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 (100 times larger than prior art) at a cost of 10 μs per gate (100 times faster than prior art). We then use DIZK to study various security applications.},
}

EndNote citation:

%0 Thesis
%A Wu, Howard 
%A Zheng, Wenting 
%A Chiesa, Alessandro 
%A Popa, Raluca Ada 
%A Stoica, Ion 
%T DIZK: A Distributed Zero-Knowledge Proof System
%I EECS Department, University of California, Berkeley
%D 2018
%8 May 18
%@ UCB/EECS-2018-78
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2018/EECS-2018-78.html
%F Wu:EECS-2018-78