Efficient batch zero-knowledge arguments for low degree polynomials

DOI10.1007/978-3-319-76581-5_19zbMath1420.94040OpenAlexW2900186171MaRDI QIDQ1753866

Jonathan Bootle, Jens Groth

Publication date: 29 May 2018

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10045412/

zbMATH Keywords

zero-knowledge argumentdiscrete logarithm assumptionsigma-protocolbatch-verification

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ High-threshold AVSS with optimal communication complexity ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup ⋮ Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers

This page was built for publication: Efficient batch zero-knowledge arguments for low degree polynomials