Efficient transparent polynomial commitments for zk-SNARKs
From MaRDI portal
Publication:6558604
Recommendations
- Transparent SNARKs from DARK compilers
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Prover-efficient commit-and-prove zero-knowledge SNARKs
Cites work
- scientific article; zbMATH DE number 1583782 (Why is no real title available?)
- scientific article; zbMATH DE number 2086711 (Why is no real title available?)
- scientific article; zbMATH DE number 7650353 (Why is no real title available?)
- A key-exchange system based on imaginary quadratic fields
- A survey on IQ cryptography
- Aurora: transparent succinct arguments for R1CS
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Constant-Size Commitments to Polynomials and Their Applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient verifiable delay functions
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Ligero: lightweight sublinear arguments without a trusted setup
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the computation of quadratic 2-class groups
- Parallel coin-tossing and constant-round secure two-party computation
- Proofs for inner pairing products and applications
- Signatures of correct computation
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Time- and space-efficient arguments from groups of unknown order
- Transparent SNARKs from DARK compilers
Cited in
(5)- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- eSTARK: extending STARKs with arguments
- BaseFold: efficient field-agnostic polynomial commitment schemes from foldable codes
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Polymath: Groth16 is not the limit
This page was built for publication: Efficient transparent polynomial commitments for zk-SNARKs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558604)
