Paper 2024/1595
DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs
Abstract
This work presents Deepfold, a novel multilinear polynomial commitment scheme (PCS) based on Reed-Solomon code that offers optimal prover time and a more concise proof size. For the first time, Deepfold adapts the FRI-based multilinear PCS to the list decoding radius setting, requiring significantly fewer query repetitions and thereby achieving a 3
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. Usenix Security 2025
- Keywords
- SNARK
- Contact author(s)
-
guo yanpei @ u nus edu
hinsliu @ zju edu cn
Cauchy_0326xz @ outlook com
wenjiequ @ u nus edu
tianyangtao @ u nus edu
jhzhang @ nus edu sg - History
- 2025-01-30: revised
- 2024-10-08: received
- See all versions
- Short URL
- https://ia.cr/2024/1595
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1595, author = {Yanpei Guo and Xuanming Liu and Kexi Huang and Wenjie Qu and Tianyang Tao and Jiaheng Zhang}, title = {{DeepFold}: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1595}, year = {2024}, url = {https://eprint.iacr.org/2024/1595} }