A Toolkit for Succinct Lattice-Based Zero Knowledge Proofs (opens in new tab)

The development of proof systems whose security relies on the hardness of lattice problems has been a fruitful research area in recent years\. By leveraging the techniques introduced in LaBRADOR \(Beullens, Seiler, Crypto 2023\), the state-of-the-art lattice-based schemes have very fast provers and have output sizes under 100KB for arbitrarily large statements\. These proofs are in fact the smallest, and often have the fastest provers, out of all post-quantum schemes\. In addition to succinct...