Aniket Kate, Gregory M. Zaverucha, and Ian Goldberg. “Constant-size commitments to polynomials and their applications.” In Advances in Cryptology — ASIACRYPT 2010, Lecture Notes in Computer Science, vol. 6477, pp. 177–194. Springer, 2010.

Introduced the KZG polynomial commitment scheme, which allows a prover to commit to a polynomial $f\in {\mathbb{F}}_p[X]$ with a single group element and later prove evaluations $f(z)=y$ with a single group element proof (O(1) size). Security relies on the $q$-Strong Diffie-Hellman assumption in a bilinear group and requires a structured reference string (trusted setup) of the form $(g,g^{\tau },g^{{\tau }^2},\dots ,g^{{\tau }^d})$ for secret $\tau$. KZG is the polynomial commitment underlying most practical SNARKs, including Plonk and Marlin, and is used in Ethereum’s KZG ceremony (EIP-4844).