Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency

ePrint Report: Lattice-Based Polynomial Commitments: Towards Asymptotic and Concrete Efficiency

Giacomo Fenzi, Ngoc Khanh Nguyen

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 evaluates to a certain value $z$ at a specified point $u$, i.e. $p(u) = z$, without revealing any additional information about the polynomial. Recently, polynomial commitments have been extensively used as a cryptographic building block to transform polynomial interactive …

efficiency eprint report function nguyen party point prove report tool value