| No. |
Title |
Author |
Year |
| 1 |
Efficient Interactive Proofs for Non-Deterministic Bounded Space |
Cook, Joshua et al. |
2023 |
| 2 |
Delegation for Search Problems |
Holmgren, Justin et al. |
2022 |
| 3 |
PCPs and Instance Compression from a Cryptographic Lens |
Bronfman, Liron et al. |
2022 |
| 4 |
Small Circuits Imply Efficient Arthur-Merlin Protocols |
Ezra, Michael et al. |
2022 |
| 5 |
Hard Properties with (Very) Short PCPPs and Their Applications |
Ben-Eliezer, Omri et al. |
2020 |
| 6 |
An Exponential Separation Between MA and AM Proofs of Proximity |
Gur, Tom et al. |
2018 |
| 7 |
Efficient Batch Verification for UP |
Reingold, Omer et al. |
2018 |
| 8 |
Relaxed Locally Correctable Codes |
Gur, Tom et al. |
2018 |
| 9 |
Zero-Knowledge Proofs of Proximity |
Berman, Itay et al. |
2018 |
| 10 |
A Hierarchy Theorem for Interactive Proofs of Proximity |
Gur, Tom et al. |
2017 |
