Efficient transparent polynomial commitments for zk-SNARKs
From MaRDI portal
Publication:6558604
DOI10.1007/978-3-031-51479-1_18MaRDI QIDQ6558604
Yulim Shin, Sun-Mi Kim, Sungwook Kim, Sungju Kim, Hyunok Oh, Ji-Hye Kim
Publication date: 19 June 2024
Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computation of quadratic 2-class groups
- A key-exchange system based on imaginary quadratic fields
- Parallel coin-tossing and constant-round secure two-party computation
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Time- and space-efficient arguments from groups of unknown order
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Aurora: transparent succinct arguments for R1CS
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- A survey on IQ cryptography
- Constant-Size Commitments to Polynomials and Their Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Signatures of Correct Computation
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Efficient verifiable delay functions
- Ligero: lightweight sublinear arguments without a trusted setup
- Proofs for inner pairing products and applications
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)
