ZKBoo: Faster Zero-Knowledge for Boolean Circuits

Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

In this paper we describe ZKBoo, a proposal for practically efficient zero-knowledge arguments especially tailored for Boolean circuits and report on a proof-of- concept 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 are based on the “MPC-in-the-head” approach to zero-knowledge of Ishai et al. (IKOS), which has been successfully used to achieve significant asymp- totic improvements. Our contributions include:
◦ A thorough analysis of the different variants of IKOS, which highlights their pros and cons for practically rele- vant soundness parameters;
◦ A generalization and simplification of their approach, which leads to faster Σ-protocols (that can be made non-interactive using the Fiat-Shamir heuristic) for state- ments of the form “I know x such that y = φ (x)” (where φ is a circuit and y a public value);
◦ A case study, where we provide explicit protocols, implementations and benchmarking of zero-knowledge protocols for the SHA-1 and SHA-256 circuits.
Titel25th USENIX Security Symposium : (USENIX Security 16)
Antal sider16
ForlagUSENIX - The Advanced Computing Systems Association
ISBN (Elektronisk) 978 -1- 931971-32- 4
StatusUdgivet - 2016
Begivenhed25th USENIX Security Symposium - Austin, USA
Varighed: 10 aug. 201612 aug. 2016


Konference25th USENIX Security Symposium

Se relationer på Aarhus Universitet Citationsformater

ID: 103554316