\textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems

DOI10.1007/978-981-95-5099-9_11MaRDI QIDQ7228249zbMATH OpenFDO

Authors Dan Boneh, Binyi Chen

Publication date 13 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5099-9_11

zbMATH Keywords

lattice-based folding protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• \textsf{LatticeFold+}: faster, simpler, shorter lattice-based folding for succinct proof systems
• A compressed \(\varSigma \)-protocol theory for lattices
• Algebraic methods for interactive proof systems
• Algebraic reductions of knowledge
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• Generalized Compact Knapsacks Are Collision Resistant
• scientific article; zbMATH DE number 1256724 (Why is no real title available?)
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Lattice-based Cryptography
• Lova: lattice-based folding scheme from unstructured lattices
• Nova: recursive zero-knowledge arguments from folding schemes
• On the concrete hardness of learning with errors
• On zeros of a polynomial in a finite grid
• Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
• Practical product proofs for lattice commitments
• Proof-carrying data without succinct arguments
• Protostar: generic efficient accumulation/folding for special-sound protocols
• Recursive proof composition from accumulation schemes
• RoK, paper, SISsors toolkit for lattice-based succinct arguments (extended abstract)
• Scalable zero knowledge via cycles of elliptic curves
• Short lattice-based one-out-of-many proofs and applications to ring signatures
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• Theory of Cryptography
• Verifiable delay functions
• Worst-case to average-case reductions for module lattices

Cited in

(2)

• Cyclo: lightweight lattice-based folding via partial range checks
• How to prove post-quantum security for succinct non-interactive reductions

This page was built for publication: \textsf{LatticeFold}: a lattice-based folding scheme and its applications to succinct proof systems

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