Name
Abstract | ||
|---|---|---|
Zero-knowledge arguments have become practical, and widely used, especially in the world of Blockchain, for example in Zcash. This work revisits zero-knowledge proofs in the discrete logarithm setting. First, we identify and carve out basic techniques (partly being used implicitly before) to optimise proofs in this setting. In particular, the linear combination of protocols is a useful tool to obtain zero-knowledge and/or reduce communication. With these techniques, we are able to devise zero-knowledge variants of the logarithmic communication arguments by Bootle et al. (EUROCRYPT '16) and Bünz et al. (S&P '18) thereby introducing almost no overhead. We then construct a conceptually simple commit-and-prove argument for satisfiability of a set of quadratic equations. Unlike previous work, we are not restricted to rank 1 constraint systems (R1CS). This is, to the best of our knowledge, the first work demonstrating that general quadratic constraints, not just R1CS, are a natural relation in the dlog (or ideal linear commitment) setting. This enables new possibilities for optimisation, as, eg., any degree n2 polynomial f(X) can now be "evaluated" with at most 2n quadratic constraints. Our protocols are modular. We easily construct an efficient, logarithmic size shuffle proof, which can be used in electronic voting. Additionally, we take a closer look at quantitative security measures, eg. the efficiency of an extractor. We formalise short-circuit extraction, which allows us to give tighter bounds on the efficiency of an extractor.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3319535.3354251 | Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security |
Keywords | Field | DocType |
argument system, arithmetic circuit satisfiability, discrete logarithm assumption, quadratic equations, zero-knowledge | Computer security,Computer science,Theoretical computer science,Zero-knowledge proof,Discrete logarithm | Conference |
Volume | ISBN | Citations |
2019 | 978-1-4503-6747-9 | 1 |
PageRank | References | Authors |
0.36 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Max Hoffmann | 1 | 16 | 5.40 |
| Michael Klooß | 2 | 1 | 0.70 |
| Andy Rupp | 3 | 196 | 16.95 |