Eylon Yogev
Bar-Ilan University
Computer Science Department
eylon.yogev [at] biu.ac.il
Office: Building 503, Room 104
About Me
I am a faculty member in the department of Computer Science at Bar-Ilan University and a member of the Bar-Ilan Center for Research in Applied Cryptography and Cyber Security. I completed my PhD at the Weizmann Institute, where I was fortunate to have been advised by Prof. Moni Naor.
I am primarily interested in theoretical computer science, with a special focus on cryptography and interactive proof systems.
Students
- Michael Tsaban (MSc student)
- Gal Arnon (PhD student, co-advised with Moni Naor)
- Shany Ben-David (PhD student)
- Amit Sharabi (MSc student)
- Daniel Nukrai (MSc student, co-advised with Iftach Haitner)
Books
-
Building Cryptographic Proofs from Hash Functions by Alessandro Chiesa and Eylon Yogev
Publications
-
Towards a White-Box Secure Fiat-Shamir Transformation
Gal Arnon and Eylon Yogev
CRYPTO 2025, ZKProof 7
-
WHIR: Reed–Solomon Proximity Testing with Super-Fast Verification
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev
Eurocrypt 2025, ZKSummit 12
See also Giacomo's blogpost
-
From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking
Gil Segev, Lior Rotem, and Eylon Yogev
TCC 2024
-
Untangling the Security of Kilian’s Protocol: Upper and Lower Bounds
Alessandro Chiesa, Marcel Dall’Agnol, Ziyi Guan, Nicholas Spooner, and Eylon Yogev
TCC 2024
-
Hamming Weight Proofs of Proximity with One-Sided Error
Gal Arnon, Shany Ben-David, and Eylon Yogev
TCC 2024
-
STIR: Reed–Solomon Proximity Testing with Fewer Queries
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev
CRYPTO 2024 (Best Paper Award), ZKSummit 11, ZKProof 6
See also Giacomo's blogpost
-
Security Bounds for Proof-Carrying Data from Straightline Extractors
Alessandro Chiesa, Ziyi Guan, Shahar Samocha, and Eylon Yogev
TCC 2024
-
Rogue-Instance Security for Batch Knowledge Proofs
Gil Segev, Amit Sharabi, and Eylon Yogev
TCC 2023
-
IOPs with Inverse Polynomial Soundness Error
Gal Arnon, Alessandro Chiesa, and Eylon Yogev
FOCS 2023
-
Broadcast CONGEST Algorithms Against Eavesdroppers
Yael Hitron, Merav Parter, and Eylon Yogev
DISC 2022
-
A Toolbox for Barriers on Interactive Oracle Proofs
Gal Arnon, Amey Bhangale, Alessandro Chiesa, and Eylon Yogev
TCC 2022
-
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost
Eyal Ronen, Andreas Hülsing, Mikhail Kudinov, and Eylon Yogev
IEEE Symposium on Security and Privacy, 2023
-
Lower Bound on SNARGs in the Random Oracle Model
Iftach Haitner, Daniel Nukrai, and Eylon Yogev
-
A PCP Theorem for Interactive Proofs and Applications
Gal Arnon, Alessandro Chiesa, and Eylon Yogev
EUROCRYPT 2022
-
A Framework for Adversarially Robust Streaming Algorithms
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, and Eylon Yogev
PODS 2020
Best Paper Award
2021 ACM SIGMOD Research Highlight Award
Invited to the Journal of the ACM (JACM) -
Transparent Error Correcting in a Computationally Bounded World
Ofer Grossman, Justin Holmgren, and Eylon Yogev
TCC 2020
-
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
Lijie Chen, Ron Rothblum, Roei Tell, and Eylon Yogev
FOCS 2020 slides
Journal of the ACM (JACM)
-
The Adversarial Robustness of Sampling
Omri Ben-Eliezer and Eylon Yogev
PODS 2020
Invited to HALG 2020
-
Parallel Balanced Allocations: The Heavily Loaded Case
Christoph Lenzen, Merav Parter, and Eylon Yogev
SPAA 2019
-
Distributional Collision Resistance Beyond One-Way Functions
Nir Bitansky, Iftach Haitner, Ilan Komargodski, and Eylon Yogev
EUROCRYPT 2019
-
The Power of Distributed Verifiers in Interactive Proofs
Moni Naor, Merav Parter, and Eylon Yogev
SODA 2020
-
Distributed Algorithms Made Secure: A Graph Theoretic Approach
Merav Parter and Eylon Yogev
SODA 2019
-
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation
Ilan Komargodski and Eylon Yogev
EUROCRYPT 2018
-
Non-Interactive Multiparty Computation without Correlated Randomness
Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, and Eylon Yogev
ASIACRYPT 2017
-
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
Ilan Komargodski, Moni Naor, and Eylon Yogev
EUROCRYPT 2018
-
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing
Ilan Komargodski, Moni Naor, and Eylon Yogev
FOCS 2017
Journal of the ACM (JACM)
-
Oren Barkan, Ori Katz, Noam Koenigstein, and Eylon Yogev
RecSys 2019
-
The Journey from NP to TFNP Hardness
Pavel Hubáček, Moni Naor, and Eylon Yogev
ITCS 2017 (honorary invited)
-
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
Pavel Hubáček and Eylon Yogev
SODA 2017
SIAM Journal on Computing (SICOMP)
-
How to Share a Secret, Infinitely
Ilan Komargodski, Moni Naor, and Eylon Yogev
TCC 2016-B
IEEE Transactions on Information Theory, 2017
-
Bloom Filters in Adversarial Environments
Moni Naor and Eylon Yogev
CRYPTO 2015
ACM Transactions on Algorithms (TALG)
-
One-Way Functions and (Im)Perfect Obfuscation
Ilan Komargodski, Tal Moran Moni Naor, Rafael Pass, Alon Rosen, and Eylon Yogev
FOCS 2014
SIAM Journal on Computing (SICOMP)
-
Tight Bounds for Sliding Bloom Filters
Moni Naor and Eylon Yogev
ISAAC 2013
Invitation to Algorithmica 2015
Workshop Organization
- Organizer: The 13th BIU Winter School on Cryptography
Program Committees