Intro to folding schemes and its lattice variant

This talk will give an introduction to folding schemes which are widely used to reduce many incremental verifiable computations to a smaller one in zk proving systems. Original folding schemes  (Nova, HyperNova) are based on elliptic curve cryptography, whose security is based on discrete log problem and is subject to quantum computer attacks.

To address this, new schemes have been designed using post quantum cryptography, and lattice-based is one of them. The audience will then learn the intuitions and techniques behind these lattice-based folding schemes, as well as the challenges they face.