Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup

ePrint Report: Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup

Valerio Cini, Giulio Malavolta, Ngoc Khanh Nguyen, Hoeteck Wee

Polynomial commitment scheme allows a prover to commit to a polynomial $f \in \mathcal{R}[X]$ of degree $L$, and later prove that the committed function was correctly evaluated at a specified point $x$; in other words $f(x)=u$ for public $x,u \in\mathcal{R}$. Most applications of polynomial commitments, e.g. succinct non-interactive arguments of knowledge (SNARKs), require that (i) both the commitment …

commit eprint report fast function nguyen post-quantum post-quantum security prove quantum quantum security report security verification