An introduction to lattice-based folding schemes

Folding schemes (also known as accumulation schemes) are a powerful tool for building scalable and concretely efficient proof systems. Lattice-based constructions retain many of the desirable properties of elliptic curve-based schemes, while offering the added benefits of potentially faster provers and plausible post-quantum security. In this talk, I will highlight key technical challenges in designing lattice-based folding schemes and present several techniques—primarily related to lattice-based range proofs—for addressing these challenges.
Based on joint work with Dan Boneh.