\textsf{Orbweaver}: succinct linear functional commitments from lattices
From MaRDI portal
Publication:6186699
DOI10.1007/978-3-031-38545-2_4OpenAlexW4385654215MaRDI QIDQ6186699
Ben Fisch, Zeyu Liu, Psi Vesely
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_4
Cites Work
- Unnamed Item
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Sumcheck arguments and their applications
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Trapdoors for hard lattices and new cryptographic constructions
- New directions in nearest neighbor searching with applications to lattice sieving
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Ligero: lightweight sublinear arguments without a trusted setup
- Functional commitments for all functions, with transparent setup and from SIS
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
- Orion: zero knowledge proof with linear prover time
This page was built for publication: \textsf{Orbweaver}: succinct linear functional commitments from lattices
