Folding Custom Gates with Verifier Input
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910304414203904 |
|---|---|
| author | Vark, Aard Zhang, Yan X |
| author_facet | Vark, Aard Zhang, Yan X |
| contents | In the context of interactive proofs, a "folding scheme" (popularized by Nova) is a way to combine multiple instances of a constraint system into a single instance, so the validity of the multiple instances can statistically be reduced to the validity of a single one. We show how Nova folding can be generalized to ``custom'' gates and extra rounds of verifier randomness. As an application of this extension, we present Origami, the first (to our knowledge) known example of a folding scheme for lookups. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_11364 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Folding Custom Gates with Verifier Input Vark, Aard Zhang, Yan X Cryptography and Security Logic in Computer Science 94A60 In the context of interactive proofs, a "folding scheme" (popularized by Nova) is a way to combine multiple instances of a constraint system into a single instance, so the validity of the multiple instances can statistically be reduced to the validity of a single one. We show how Nova folding can be generalized to ``custom'' gates and extra rounds of verifier randomness. As an application of this extension, we present Origami, the first (to our knowledge) known example of a folding scheme for lookups. |
| title | Folding Custom Gates with Verifier Input |
| topic | Cryptography and Security Logic in Computer Science 94A60 |
| url | https://arxiv.org/abs/2401.11364 |