Paper 2023/033

Fast amortized KZG proofs

Dankrad Feist, Ethereum Foundation
Dmitry Khovratovich, Ethereum Foundation
Abstract

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.

Note: Also known as "Fast amortized Kate proofs"

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
KZGtoeplitzfftmultiple proofslookupvector commitments
Contact author(s)
dankrad feist @ ethereum org
khovratovich @ gmail com
History
2023-01-19: approved
2023-01-11: received
See all versions
Short URL
https://ia.cr/2023/033
License
No rights reserved
CC0

BibTeX

@misc{cryptoeprint:2023/033,
      author = {Dankrad Feist and Dmitry Khovratovich},
      title = {Fast amortized KZG proofs},
      howpublished = {Cryptology ePrint Archive, Paper 2023/033},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/033}},
      url = {https://eprint.iacr.org/2023/033}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.