Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Submitting institution
-
The University of Birmingham
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 41989480
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-662-49896-5_12
- Title of conference / published proceedings
- Advances in Cryptology – EUROCRYPT 2016 : 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II
- First page
- 327
- Volume
- 9666
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Technical exception
- Month of publication
- April
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 26
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Zero-knowledge protocols allow proof of arbitrary properties on secret values without revealing anything about them. They have numerous applications, including building digital signatures and e-voting systems. We provide new
zero-knowledge protocols for arbitrary circuit relations, under the classical assumption that discrete logarithms are hard to compute. The protocols are dramatically more efficient than previous protocols based on discrete logarithms (logarithmic vs subquadratic size). The paper was published at Eurocrypt 2016 conference, a top 2 conference in cryptography. It influenced practical and theoretical proof systems including BulletProofs, Sonic, Zether, LegoSNARK, and Halo, with applications to blockchain and verifiable computations.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -