LatticeFold, w/ Binyi Chen

In this module, Guillermo Angeris and Binyi Chen, Postdoc Researcher at Stanford University, present LatticeFold. LatticeFold is a ZK folding scheme designed for lattice-based cryptography. Binyi begins by establishing the building blocks: Defining polynomial rings and commitments, and the concept of folding schemes. He goes on to explain the techniques, and the central challenge of applying folding techniques in a lattice setting and explores solutions to these problems, such as the decomposition technique to manage the norm, and introducing a range proof to ensure security. Finally, Binyi contrasts the initial LatticeFold approach with LatticeFold+, which leverages the rich algebraic structure of the underlying rings and includes more efficient range proofs.