Interactive Oracle Proofs of Proximity to Codes on Graphs
Hugo Delavenne (GRACE), Tanguy Medevielle (IRMAR, GRACE), \'Elina Roussel (GRACE)
TL;DR
This paper introduces an improved Interactive Oracle Proof of Proximity for codes on graphs, enhancing soundness and flexibility, which could advance code-based SNARKs.
Contribution
It presents a new IOPP for codes on graphs with better soundness and no field restrictions, expanding possibilities for code-based SNARKs.
Findings
Enhanced soundness over FRI protocol
Comparable complexity parameters to FRI
No restrictions on the underlying field
Abstract
We design an Interactive Oracle Proof of Proximity (IOPP) for codes on graphs inspired by the FRI protocol. The soundness is significantly improved compared to the FRI, the complexity parameters are comparable, and there are no restrictions on the field used, enabling to consider new codes to design code-based SNARKs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.