In this work, we present some new approaches to constructing efficient lattice-based succinct arguments. Our main technical ingredient is a new commitment ...

Aug 9, 2023 · Succinct arguments allow a prover to convince a verifier of the validity of any statement in a language, with minimal communication and ...

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.

Lattice-Based Succinct Arguments from Vanishing Polynomials · List of references · Publications that cite this publication.

May 3, 2023 · Lattice-based Succinct Arguments from Vanishing Polynomials. Lai, R. W. F. (Speaker). Professorship Lai Russell · Department of Computer Science ...

The authors propose two concrete instantiations, which either achieve polylogarithmic verifica- tion time (using subtractive sets), or negligible soundness ...

Aug 25, 2023 · Lattice-based Succinct Arguments from Vanishing Polynomials · present some new approaches to constructing efficient lattice-based succinct ...

Apr 30, 2024 · In this note, we collect mostly known formulas and methods to compute the standard and virtual Poincar\'e polynomials of the configuration ...

May 26, 2024 · In this work, we propose the first lattice-based non-interactive extractable polynomial commitment scheme which achieves polylogarithmic proof ...

Polynomial commitments schemes are a powerful tool that enables one party to commit to a polynomial p of degree d, and prove that the committed function.