Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
From MaRDI portal
Publication:2697847
DOI10.1007/978-3-030-90453-1_1OpenAlexW3213340422MaRDI QIDQ2697847
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90453-1_1
Related Items (11)
Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ HyperPlonk: Plonk with linear-time prover and high-degree custom gates ⋮ Functional commitments for all functions, with transparent setup and from SIS ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ DualDory: logarithmic-verifier linkable ring signatures through preprocessing ⋮ Brakedown: linear-time and field-agnostic SNARKs for R1CS ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Algebraic reductions of knowledge ⋮ Practical dynamic group signatures without knowledge extractors ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Pairings for cryptographers
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Time- and space-efficient arguments from groups of unknown order
- Aurora: transparent succinct arguments for R1CS
- Elligator Squared: Uniform Points on Elliptic Curves of Prime Order as Uniform Random Strings
- Constant-Size Commitments to Polynomials and Their Applications
- Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
- Linear Algebra with Sub-linear Zero-Knowledge Arguments
- How to Hash into Elliptic Curves
- On Compressible Pairings and Their Computation
- Structure-Preserving Signatures and Commitments to Group Elements
- Signatures of Correct Computation
- Pairing-Friendly Elliptic Curves of Prime Order
- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Algorithmic Number Theory
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
