ZKBoo: Faster Zero-Knowledge for Boolean Circuits

In this paper we describe ZKBoo1, a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and report on a proof-ofconcept implementation. As an highlight, we can generate (resp. verify) a non-interactive proof for the SHA-1 circuit in approximately 13ms (resp. 5ms), with a proof size of 444KB. Our techniques… (More)

12 Figures & Tables



Citations per Year

Citation Velocity: 15

Averaging 15 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.