Interactive Oracle Proofs of Proximity to Codes on Graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910939995963392 |
|---|---|
| author | Delavenne, Hugo Medevielle, Tanguy Roussel, Élina |
| author_facet | Delavenne, Hugo Medevielle, Tanguy Roussel, Élina |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_14337 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Interactive Oracle Proofs of Proximity to Codes on Graphs Delavenne, Hugo Medevielle, Tanguy Roussel, Élina Computational Complexity Cryptography and Security 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. |
| title | Interactive Oracle Proofs of Proximity to Codes on Graphs |
| topic | Computational Complexity Cryptography and Security |
| url | https://arxiv.org/abs/2501.14337 |