Paper 2025/129
DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
Abstract
We construct the first polynomial commitment scheme (PCS) that has a transparent setup, quasi-linear prover time,
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- SNARKPolynomial Commitment SchemeGroups of unknown order
- Contact author(s)
-
bb @ nyu edu
tmopuri @ upenn edu
alrshir @ upenn edu
srirams @ berkeley edu - History
- 2025-01-28: approved
- 2025-01-27: received
- See all versions
- Short URL
- https://ia.cr/2025/129
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/129, author = {Benedikt Bünz and Tushar Mopuri and Alireza Shirzad and Sriram Sridhar}, title = {{DewTwo}: a transparent {PCS} with quasi-linear prover, logarithmic verifier and 4.{5KB} proofs from falsifiable assumptions}, howpublished = {Cryptology {ePrint} Archive, Paper 2025/129}, year = {2025}, url = {https://eprint.iacr.org/2025/129} }