\textsf{Orbweaver}: succinct linear functional commitments from lattices

DOI10.1007/978-3-031-38545-2_4MaRDI QIDQ6186699zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

succinct non-interactive argument of knowledge protocols,

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Functional commitments for all functions, with transparent setup and from SIS
• Vector and functional commitments from lattices
• Succinct vector, polynomial, and functional commitments from lattices
• Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
• Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions

Cites work

• A compressed \(\varSigma \)-protocol theory for lattices
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Aurora: transparent succinct arguments for R1CS
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Constant-Size Commitments to Polynomials and Their Applications
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Fast Reed-Solomon interactive oracle proofs of proximity
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Functional commitments for all functions, with transparent setup and from SIS
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• Ligero: lightweight sublinear arguments without a trusted setup
• Marlin: preprocessing zkSNARKs with universal and updatable SRS
• New directions in nearest neighbor searching with applications to lattice sieving
• On the size of pairing-based non-interactive arguments
• Orion: zero knowledge proof with linear prover time
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
• Quadratic span programs and succinct NIZKs without PCPs
• Recursive composition and bootstrapping for SNARKs and proof-carrying data
• Scalable zero knowledge with no trusted setup
• Short pairing-based non-interactive zero-knowledge arguments
• Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
• Some easy instances of ideal-SVP and implications on the partial Vandermonde knapsack problem
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• Succinct non-interactive arguments via linear interactive proofs
• Sumcheck arguments and their applications
• Transparent SNARKs from DARK compilers
• Trapdoors for hard lattices and new cryptographic constructions
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems

Cited in

(9)

• Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
• Lattice-based functional commitments: fast verification and cryptanalysis
• Updatable, aggregatable, succinct mercurial vector commitment from lattice
• SLAP: succinct lattice-based polynomial commitments from standard assumptions
• Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
• Greyhound: fast polynomial commitments from lattices
• Concretely efficient lattice-based polynomial commitment from standard assumptions
• Functional commitments and SNARGs for P/poly from SIS
• Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)

This page was built for publication: \textsf{Orbweaver}: succinct linear functional commitments from lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186699)