Paper 2026/2681
Improving Code Rate and Query Complexity for the Ligero-IOP System
, IMDEA Software InstituteAbstract
This work presents two main contributions to the analysis and design of Ligero-style zero-knowledge proof systems. First, we analyze the original Ligero IOP in the list-decoding regime and show that mutual correlated agreement suffices to obtain improved soundness guarantees and lower query complexity, without modifying the protocol. Second, we propose a new variant of Ligero that incorporates out-of-domain sampling, leading to further soundness improvements and enabling Reed--Solomon code rates above $1/2$. The new protocol preserves the constant-round structure of the Ligero IOP and its compatibility with memory-efficient proving, while achieving perfect honest-verifier zero knowledge.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Zero knowledge proofsLigero
- Contact author(s)
-
ignacio cascudo @ software imdea org
carmit @ ligero-inc com
muthu @ ligero-inc com - History
- 2026-10-31: approved
- 2026-10-29: received
- See all versions
- Short URL
- https://ia.cr/2026/2681
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2681,
author = {Ignacio Cascudo and Carmit Hazay and Muthu Venkitasubramaniam},
title = {Improving Code Rate and Query Complexity for the Ligero-{IOP} System},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2681},
year = {2026},
url = {https://eprint.iacr.org/2026/2681}
}
