| 2026 | CRYPTO | Pairing-Based SNARGs with Two Group Elements. | Gal Arnon, Jesko Dujmovic, Eylon Yogev |
| 2025 | CRYPTO | Towards a White-Box Secure Fiat-Shamir Transformation. | Gal Arnon, Eylon Yogev |
| 2025 | EuroCrypt | Instance Compression, Revisited. | Gal Arnon, Shany Ben-David, Eylon Yogev |
| 2025 | EuroCrypt | WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification. | Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev |
| 2025 | TCC | Incompressible Encryption with Everlasting Security. | Shany Ben-David, Eylon Yogev |
| 2024 | CRYPTO | STIR: Reed-Solomon Proximity Testing with Fewer Queries. | Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev |
| 2024 | TCC | Hamming Weight Proofs of Proximity with One-Sided Error. | Gal Arnon, Shany Ben-David, Eylon Yogev |
| 2024 | TCC | Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. | Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev |
| 2024 | TCC | Security Bounds for Proof-Carrying Data from Straightline Extractors. | Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev |
| 2024 | TCC | From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking. | Lior Rotem, Gil Segev, Eylon Yogev |
| 2023 | FOCS | IOPs with Inverse Polynomial Soundness Error. | Gal Arnon, Alessandro Chiesa, Eylon Yogev |
| 2023 | SP | SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost. | Andreas Hlsing, Mikhail A. Kudinov, Eyal Ronen, Eylon Yogev |
| 2023 | TCC | Rogue-Instance Security for Batch Knowledge Proofs. | Gil Segev, Amit Sharabi, Eylon Yogev |
| 2022 | CRYPTO | Lower Bound on SNARGs in the Random Oracle Model. | Iftach Haitner, Daniel Nukrai, Eylon Yogev |
| 2022 | EuroCrypt | A PCP Theorem for Interactive Proofs and Applications. | Gal Arnon, Alessandro Chiesa, Eylon Yogev |
| 2022 | TCC | A Toolbox for Barriers on Interactive Oracle Proofs. | Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev |
| 2021 | CRYPTO | Subquadratic SNARGs in the Random Oracle Model. | Alessandro Chiesa, Eylon Yogev |
| 2021 | STOC | Adversarial laws of large numbers and optimal regret in online classification. | Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev |
| 2021 | TCC | Tight Security Bounds for Micali's SNARGs. | Alessandro Chiesa, Eylon Yogev |
| 2020 | CRYPTO | Interactive Proofs for Social Graphs. | Liran Katzir, Clara Shikhelman, Eylon Yogev |
| 2020 | FOCS | On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. | Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev |
| 2020 | PODS | A Framework for Adversarially Robust Streaming Algorithms. | Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev |
| 2020 | PODS | The Adversarial Robustness of Sampling. | Omri Ben-Eliezer, Eylon Yogev |
| 2020 | SODA | The Power of Distributed Verifiers in Interactive Proofs. | Moni Naor, Merav Parter, Eylon Yogev |
| 2020 | TCC | Barriers for Succinct Arguments in the Random Oracle Model. | Alessandro Chiesa, Eylon Yogev |
| 2020 | TCC | Transparent Error Correcting in a Computationally Bounded World. | Ofer Grossman, Justin Holmgren, Eylon Yogev |
| 2019 | EuroCrypt | Distributional Collision Resistance Beyond One-Way Functions. | Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev |
| 2019 | ICALP | Optimal Short Cycle Decomposition in Almost Linear Time. | Merav Parter, Eylon Yogev |
| 2019 | PODC | Secure Distributed Computing Made (Nearly) Optimal. | Merav Parter, Eylon Yogev |
| 2019 | RecSys | CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations. | Oren Barkan, Noam Koenigstein, Eylon Yogev, Ori Katz |
| 2019 | SODA | Low Congestion Cycle Covers and Their Applications. | Merav Parter, Eylon Yogev |
| 2019 | SODA | Distributed Algorithms Made Secure: A Graph Theoretic Approach. | Merav Parter, Eylon Yogev |
| 2019 | SPAA | Parallel Balanced Allocations: The Heavily Loaded Case. | Christoph Lenzen, Merav Parter, Eylon Yogev |
| 2018 | CRYPTO | On Distributional Collision Resistant Hashing. | Ilan Komargodski, Eylon Yogev |
| 2018 | EuroCrypt | Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2018 | EuroCrypt | Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation. | Ilan Komargodski, Eylon Yogev |
| 2017 | ASIACRYPT | Non-Interactive Multiparty Computation Without Correlated Randomness. | Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev |
| 2017 | FOCS | White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2017 | SODA | Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. | Pavel Hubcek, Eylon Yogev |
| 2016 | CRYPTO | Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. | Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev |
| 2016 | TCC | How to Share a Secret, Infinitely. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2015 | CRYPTO | Bloom Filters in Adversarial Environments. | Moni Naor, Eylon Yogev |
| 2015 | TCC | Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. | Ilan Komargodski, Gil Segev, Eylon Yogev |
| 2014 | ASIACRYPT | Secret-Sharing for NP. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2014 | FOCS | One-Way Functions and (Im)Perfect Obfuscation. | Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev |
| 2013 | ISAAC | Sliding Bloom Filters. | Moni Naor, Eylon Yogev |