Lattice-based Succinct Arguments from Vanishing Polynomials

ePrint Report: Lattice-based Succinct Arguments from Vanishing Polynomials

Valerio Cini, Russell W. F. Lai, Giulio Malavolta

Succinct arguments allow a prover to convince a verifier of the validity of any statement in a language, with minimal communication and verifier's work. Among other approaches, lattice-based protocols offer solid theoretical foundations, post-quantum security, and a rich algebraic structure. In this work, we present some new approaches to constructing efficient lattice-based succinct arguments. Our main technical ingredient is a new commitment scheme based …

communication eprint report foundations language offer post-quantum post-quantum security protocols quantum quantum security report security solid statement work