Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
From MaRDI portal
Recommendations
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Greyhound: fast polynomial commitments from lattices
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Succinct vector, polynomial, and functional commitments from lattices
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Algebraic reductions of knowledge
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Computationally binding quantum commitments
- Constant-Size Commitments to Polynomials and Their Applications
- Constructive post-quantum reductions
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fast Reed-Solomon interactive oracle proofs of proximity
- Functional commitments for all functions, with transparent setup and from SIS
- Gemini: elastic SNARKs for diverse environments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Ligero: lightweight sublinear arguments without a trusted setup
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the size of pairing-based non-interactive arguments
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Quantum rewinding for many-round protocols
- Revisiting post-quantum Fiat-Shamir
- Short pairing-based non-interactive zero-knowledge arguments
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Streaming authenticated data structures
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Succinct vector, polynomial, and functional commitments from lattices
- Sumcheck arguments and their applications
- Time- and space-efficient arguments from groups of unknown order
- Transparent SNARKs from DARK compilers
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(14)- Private polynomial commitments and applications to MPC
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Greyhound: fast polynomial commitments from lattices
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
- Blaze: fast SNARKs from interleaved RAA codes
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- Samaritan: linear-time prover SNARK from new multilinear polynomial commitments
- SNARK lower bounds via communication complexity
This page was built for publication: Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660298)
