Paper 2024/1609
Blaze: Fast SNARKs from Interleaved RAA Codes
Abstract
In this work we construct a new and highly efficient multilinear polynomial commitment scheme (MLPCS) over binary fields, which we call \emph{Blaze}. Polynomial commitment schemes allow a server to commit to a large polynomial and later decommit to its evaluations. Such schemes have emerged as a key component in recent efficient SNARK constructions.
Blaze has an extremely efficient prover, both asymptotically and concretely. The commitment is dominated by
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- PCSSNARKsRAA codes
- Contact author(s)
-
m a brehm @ uva nl
binyi @ cs stanford edu
ben fisch @ yale edu
n a resch @ uva nl
rothblum @ gmail com
hadas zeilberger @ yale edu - History
- 2024-10-11: approved
- 2024-10-09: received
- See all versions
- Short URL
- https://ia.cr/2024/1609
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1609, author = {Martijn Brehm and Binyi Chen and Ben Fisch and Nicolas Resch and Ron D. Rothblum and Hadas Zeilberger}, title = {Blaze: Fast {SNARKs} from Interleaved {RAA} Codes}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1609}, year = {2024}, url = {https://eprint.iacr.org/2024/1609} }