Sliding Bloom Filters. - Moni Naor; Eylon Yogev (ISAAC, 2013)

Secret-Sharing for NP from Indistinguishability Obfuscation. - Ilan Komargodski; Moni Naor; Eylon Yogev (IACR Cryptol. ePrint Arch., 2014)

Tight Bounds for Sliding Bloom Filters. - Moni Naor; Eylon Yogev (Algorithmica, 2015)

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. - Prabhanjan Ananth; Aayush Jain; Moni Naor; Amit Sahai; Eylon Yogev (CRYPTO (2), 2016)

The Deep Journey from Content to Collaborative Filtering. - Oren Barkan; Noam Koenigstein; Eylon Yogev (CoRR, 2016)

The Journey from NP to TFNP Hardness. - Pavel Hubácek; Moni Naor; Eylon Yogev (Electron. Colloquium Comput. Complex., 2016)

How to Share a Secret, Infinitely. - Ilan Komargodski; Moni Naor; Eylon Yogev (Electron. Colloquium Comput. Complex., 2016)

Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. - Prabhanjan Ananth; Aayush Jain; Moni Naor; Amit Sahai; Eylon Yogev (IACR Cryptol. ePrint Arch., 2016)

White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. - Ilan Komargodski; Moni Naor; Eylon Yogev (Electron. Colloquium Comput. Complex., 2017)

Non-Interactive Multiparty Computation without Correlated Randomness. - Shai Halevi; Yuval Ishai; Abhishek Jain 002; Ilan Komargodski; Amit Sahai; Eylon Yogev (IACR Cryptol. ePrint Arch., 2017)

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. - Ilan Komargodski; Moni Naor; Eylon Yogev (IACR Cryptol. ePrint Arch., 2017)

Distributed Computing Made Secure: A New Cycle Cover Theorem. - Merav Parter; Eylon Yogev (IACR Cryptol. ePrint Arch., 2017)

Secret-Sharing for NP. - Ilan Komargodski; Moni Naor; Eylon Yogev (J. Cryptol., 2017)

Congested Clique Algorithms for Graph Spanners. - Merav Parter; Eylon Yogev (DISC, 2018)

The Power of Distributed Verifiers in Interactive Proofs. - Moni Naor; Merav Parter; Eylon Yogev (Electron. Colloquium Comput. Complex., 2018)

Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. - Ilan Komargodski; Eylon Yogev (IACR Cryptol. ePrint Arch., 2018)

On Distributional Collision Resistant Hashing. - Ilan Komargodski; Eylon Yogev (IACR Cryptol. ePrint Arch., 2018)

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. - Ilan Komargodski; Gil Segev 001; Eylon Yogev (J. Cryptol., 2018)

Optimal Short Cycle Decomposition in Almost Linear Time. - Merav Parter; Eylon Yogev (ICALP, 2019)

Secure Distributed Computing Made (Nearly) Optimal. - Merav Parter; Eylon Yogev (PODC, 2019)

CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations. - Oren Barkan; Noam Koenigstein; Eylon Yogev; Ori Katz (RecSys, 2019)

Low Congestion Cycle Covers and Their Applications. - Merav Parter; Eylon Yogev (SODA, 2019)

Distributed Algorithms Made Secure: A Graph Theoretic Approach. - Merav Parter; Eylon Yogev (SODA, 2019)

Parallel Balanced Allocations: The Heavily Loaded Case. - Christoph Lenzen 001; Merav Parter; Eylon Yogev (SPAA, 2019)

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. - Lijie Chen 001; Ron Rothblum; Roei Tell; Eylon Yogev (Electron. Colloquium Comput. Complex., 2019)

The Adversarial Robustness of Sampling. - Omri Ben-Eliezer; Eylon Yogev (IACR Cryptol. ePrint Arch., 2019)

Distributional Collision Resistance Beyond One-Way Functions. - Nir Bitansky; Iftach Haitner; Ilan Komargodski; Eylon Yogev (IACR Cryptol. ePrint Arch., 2019)

Bloom Filters in Adversarial Environments. - Moni Naor; Eylon Yogev (ACM Trans. Algorithms, 2019)

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. - Lijie Chen 001; Ron D. Rothblum; Roei Tell; Eylon Yogev (FOCS, 2020)

Barriers for Succinct Arguments in the Random Oracle Model. - Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2020)

Transparent Error Correcting in a Computationally Bounded World. - Ofer Grossman; Justin Holmgren; Eylon Yogev (IACR Cryptol. ePrint Arch., 2020)

Interactive Proofs for Social Graphs. - Liran Katzir 001; Clara Shikhelman; Eylon Yogev (IACR Cryptol. ePrint Arch., 2020)

Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. - Pavel Hubácek; Eylon Yogev (SIAM J. Comput., 2020)

Adversarial laws of large numbers and optimal regret in online classification. - Noga Alon; Omri Ben-Eliezer; Yuval Dagan; Shay Moran; Moni Naor; Eylon Yogev (STOC, 2021)

A PCP Theorem for Interactive Proofs. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2021)

Tight Security Bounds for Micali's SNARGs. - Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2021)

Subquadratic SNARGs in the Random Oracle Model. - Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2021)

A Framework for Adversarially Robust Streaming Algorithms. - Omri Ben-Eliezer; Rajesh Jayaram; David P. Woodruff; Eylon Yogev (SIGMOD Rec., 2021)

A PCP Theorem for Interactive Proofs and Applications. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (EUROCRYPT (2), 2022)

Broadcast CONGEST Algorithms Against Eavesdroppers. - Yael Hitron; Merav Parter; Eylon Yogev (DISC, 2022)

A Toolbox for Barriers on Interactive Oracle Proofs. - Gal Arnon; Amey Bhangale; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS. - Nimrod Aviram; Benjamin Dowling; Ilan Komargodski; Kenneth G. Paterson; Eyal Ronen; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

Lower Bound on SNARGs in the Random Oracle Model. - Iftach Haitner; Daniel Nukrai; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost. - Mikhail A. Kudinov; Andreas Hülsing; Eyal Ronen; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

One-Way Functions and (Im)perfect Obfuscation. - Ilan Komargodski; Tal Moran; Moni Naor; Rafael Pass; Alon Rosen; Eylon Yogev (SIAM J. Comput., 2022)

Secure Distributed Network Optimization Against Eavesdroppers. - Yael Hitron; Merav Parter; Eylon Yogev (ITCS, 2023)

IOPs with Inverse Polynomial Soundness Error. - Gal Arnon; Alessandro Chiesa; Eylon Yogev (IACR Cryptol. ePrint Arch., 2023)

Security Bounds for Proof-Carrying Data from Straightline Extractors. - Alessandro Chiesa; Ziyi Guan; Shahar Samocha; Eylon Yogev (IACR Cryptol. ePrint Arch., 2023)

Rogue-Instance Security for Batch Knowledge Proofs. - Gil Segev 001; Amit Sharabi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2023)

Hamming Weight Proofs of Proximity with One-Sided Error. - Gal Arnon; Shany Ben-David; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Instance Compression, Revisited. - Gal Arnon; Shany Ben-David; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

STIR: Reed-Solomon Proximity Testing with Fewer Queries. - Gal Arnon; Alessandro Chiesa; Giacomo Fenzi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification. - Gal Arnon; Alessandro Chiesa; Giacomo Fenzi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. - Alessandro Chiesa; Marcel Dall'Agnol; Ziyi Guan; Nicholas Spooner; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking. - Lior Rotem; Gil Segev 001; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Towards a White-Box Secure Fiat-Shamir Transformation. - Gal Arnon; Eylon Yogev (IACR Cryptol. ePrint Arch., 2025)

Incompressible Encryption with Everlasting Security. - Eylon Yogev; Shany Ben-David (IACR Cryptol. ePrint Arch., 2025)