International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 19 January 2023

Dankrad Feist, Dmitry Khovratovich
ePrint Report ePrint Report
In this note we explain how to compute $n$ KZG proofs for a polynomial of degree $d$ in time superlinear of $(t+d)$. Our technique is used in lookup arguments and vector commitment schemes.
Expand

Additional news items may be found on the IACR news page.