Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Submitting institution
-
University of the West of England, Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 876750
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-319-70700-6_12
- Title of conference / published proceedings
- Advances in Cryptology – ASIACRYPT 2017
- First page
- 336
- Volume
- 10626
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- November
- Year of publication
- 2017
- URL
-
https://link.springer.com/bookseries/558
- 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
-
5
- Research group(s)
-
-
- Citation count
- 9
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper constructs efficient zero-knowledge proofs for proving arithmetic circuit satisfiability. Our novel generic construction is modular and utilises error correction codes and non-interactive commitment schemes. Our proofs yield better efficiency than existing ones both in terms of computational cost for the prover and the verifier and the communication cost. Our construction is generic and has the potential to be instantiated using post-quantum secure components.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
