Efficient batch zero-knowledge arguments for low degree polynomials

DOI10.1007/978-3-319-76581-5_19MaRDI QIDQ1753866zbMATH OpenOpenAlexFDO

Authors Jonathan Bootle, Jens Groth

Publication date 29 May 2018

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

zbMATH Keywords

batch-verificationdiscrete logarithm assumptionsigma-protocolzero-knowledge argument

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Efficient lattice-based polynomial evaluation and batch ZK arguments
• Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
• Efficient zero-knowledge arguments from two-tiered homomorphic commitments
• Public-coin zero-knowledge arguments with (almost) minimal time and space overheads

Cited in

(17)

• Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
• High-threshold AVSS with optimal communication complexity
• Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
• Batch proofs of partial knowledge
• Efficient zero-knowledge arguments from two-tiered homomorphic commitments
• Zero-knowledge argument for polynomial evaluation with application to blacklists
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Resumable zero-knowledge for circuits from symmetric key primitives
• Flashproofs: efficient zero-knowledge arguments of range and polynomial evaluation with transparent setup
• Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
• Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• \textsc{Zeromorph}: zero-knowledge multilinear-evaluation proofs from homomorphic univariate commitments
• Concretely efficient lattice-based polynomial commitment from standard assumptions
• : a unified framework for computational verifiable secret sharing
• On round-optimal computational VSS
• Efficient lattice-based polynomial evaluation and batch ZK arguments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753866)