Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
From MaRDI portal
Publication:6132419
Recommendations
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- scientific article; zbMATH DE number 1031001
- Round-efficient sub-linear zero-knowledge arguments for linear algebra
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Efficient batch zero-knowledge arguments for low degree polynomials
Cites work
- scientific article; zbMATH DE number 1878329 (Why is no real title available?)
- Aurora: transparent succinct arguments for R1CS
- Complete addition formulas for prime order elliptic curves
- Complete systems of two addition laws for elliptic curves
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Discrete logarithm problems with auxiliary inputs
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Interactive oracle proofs
- Libra: succinct zero-knowledge proofs with optimal prover computation
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the size of pairing-based non-interactive arguments
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Proofs for inner pairing products and applications
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Reducing elliptic curve logarithms to logarithms in a finite field
- Round-efficient sub-linear zero-knowledge arguments for linear algebra
- Scalable zero knowledge via cycles of elliptic curves
- Short pairing-based non-interactive zero-knowledge arguments
- Short signatures from the Weil pairing
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Structure-preserving signatures and commitments to group elements
- Transparent SNARKs from DARK compilers
- Updateable Inner Product Argument with Logarithmic Verifier and Applications
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Zero-knowledge argument for polynomial evaluation with application to blacklists
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
Cited in
(7)- Round-efficient sub-linear zero-knowledge arguments for linear algebra
- Precise zero-knowledge arguments with poly-logarithmic efficiency
- Time- and space-efficient arguments from groups of unknown order
- Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
This page was built for publication: Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132419)
