Interactive Oracle Proofs of Proximity to Codes on Graphs

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.

Authors

Institutions

Publication Details

Published
2025-06-22
DOI
https://doi.org/10.1109/isit63088.2025.11195400
Primary Topic
Logic, programming, and type systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Interactive Oracle Proofs of Proximity to Codes on Graphs

Hugo Delavenne
Logic, programming, and type systems
article

Interactive Oracle Proofs of Proximity to Codes on Graphs

Hugo Delavenne
article en

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.

École Polytechnique (FR), Centre Inria de Saclay (FR), Institut de recherche mathématique de Rennes (FR)
Openalex Percentile: Top 99%
Logic, programming, and type systems
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Interactive Oracle Proofs of Proximity to Codes on Graphs — Hugo Delavenne · (2025) | TGRS Research Map | TGRS