Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
From MaRDI portal
Publication:6660298
DOI10.1007/978-3-031-68403-6_7MaRDI QIDQ6660298
Ngoc Khanh Nguyen, Hoeteck Wee, Valerio Cini, Giulio Malavolta
Publication date: 10 January 2025
Cites Work
- Unnamed Item
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Sumcheck arguments and their applications
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- Time- and space-efficient arguments from groups of unknown order
- Gemini: elastic SNARKs for diverse environments
- Revisiting post-quantum Fiat-Shamir
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Streaming Authenticated Data Structures
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Computationally Binding Quantum Commitments
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Ligero: lightweight sublinear arguments without a trusted setup
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- 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
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Constructive post-quantum reductions
- Quantum rewinding for many-round protocols
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Algebraic reductions of knowledge
- LaBRADOR: compact proofs for R1CS from Module-SIS
This page was built for publication: Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
