"Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability."

Jonathan Bootle et al. (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-70700-6_12

access: closed

type: Conference or Workshop Paper

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/asiacrypt/BootleCGGHJ17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/asiacrypt/BootleCGGHJ17
Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, Sune K. Jakobsen:
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability. ASIACRYPT (3) 2017: 336-365

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.