In this talk, we will discuss how to construct lattice-based zero-knowledge proofs with sublinear communication complexity using recursive techniques.

The method is similar to Bulletproofs, a zero-knowledge protocol in the discrete-logarithm setting. It is based on folding techniques, which allow a commitment to a long vector to be rewritten as a commitment to a shorter one, plus some correction terms.

We explain the potential benefits and drawbacks and see what types of proof-sizes can be achieved.