Paper 2024/1843
Khatam: Reducing the Communication Complexity of Code-Based SNARKs
Abstract
Every linear code satisfies the property of ``correlated agreement", meaning that if
Note: - Corrected various errata - Prove security above the one-and-a-half Johnson bound, rather than the double Johnson bound
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- IOPPFRIProximity GapsSNARKs
- Contact author(s)
- hadas zeilberger @ yale edu
- History
- 2025-02-20: last of 4 revisions
- 2024-11-09: received
- See all versions
- Short URL
- https://ia.cr/2024/1843
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1843, author = {Hadas Zeilberger}, title = {Khatam: Reducing the Communication Complexity of Code-Based {SNARKs}}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1843}, year = {2024}, url = {https://eprint.iacr.org/2024/1843} }