| STIR: Reed-Solomon proximity testing with fewer queries G Arnon, A Chiesa, G Fenzi, E Yogev Annual International Cryptology Conference, 380-413, 2024 | 23 | 2024 |
| IOPs with inverse polynomial soundness error G Arnon, A Chiesa, E Yogev 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 11 | 2023 |
| A PCP Theorem for Interactive Proofs and Applications G Arnon, A Chiesa, E Yogev Annual International Conference on the Theory and Applications of …, 2022 | 11 | 2022 |
| Hardness of approximation for stochastic problems via interactive oracle proofs G Arnon, A Chiesa, E Yogev Cryptology ePrint Archive, 2022 | 6 | 2022 |
| Whir: Reed–solomon proximity testing with super-fast verification G Arnon, A Chiesa, G Fenzi, E Yogev Cryptology ePrint Archive, 2024 | 4 | 2024 |
| A Toolbox for Barriers on Interactive Oracle Proofs G Arnon, A Bhangale, A Chiesa, E Yogev Cryptology ePrint Archive, 2022 | 3 | 2022 |
| On Prover-Efficient Public-Coin Emulation of Interactive Proofs G Arnon, GN Rothblum 2nd Conference on Information-Theoretic Cryptography (ITC 2021), 2021 | 2 | 2021 |
| Min-Entropic Optimality. G Arnon, T Grossman Electron. Colloquium Comput. Complex., TR21-152, 2021 | 1 | 2021 |
| Hamming Weight Proofs of Proximity with One-Sided Error G Arnon, S Ben-David, E Yogev Theory of Cryptography Conference, 125-157, 2024 | | 2024 |
| Instance Compression, Revisited G Arnon, S Ben-David, E Yogev Cryptology ePrint Archive, 2024 | | 2024 |
Eylon YogevBar-Ilan UniversityVerified email at biu.ac.il