I have completed my Ph.D. at Weizmann Institute of Science, where I was extremely lucky to be advised by Prof. Moni Naor. I completed my M.Sc at Weizmann in 2013 under the same supervisor. Currently, I'm a postdoc hosted by Dr. Merav Parter working on the synergy of cryptography and distributed computation.
I am interested in Cryptography in general and its various connections to other areas in theoretical computer science such as complexity, data structures, distributed algorithms, search problems and more. Send me an email if you are interested in such connections too!
Email: eylony at gmail dot com
Publications - [New!] Congested Clique Algorithms for Graph Spanners
Merav Parter and Eylon Yogev. [PDF]
- [New!] On Distributional Collision Resistant Hashing
Ilan Komargodski and Eylon Yogev. CRYPTO 2018. [PDF]
- Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation
Ilan Komargodski and Eylon Yogev. EUROCRYPT 2018. [PDF]
- Distributed Computing Made Secure: A New Cycle Cover Theorem
Merav Parter and Eylon Yogev. [PDF]
- Non-Interactive Multiparty Computation without Correlated Randomness
Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai and Eylon Yogev. ASIACRYPT 2017. [PDF]
- Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
Ilan Komargodski, Moni Naor, and Eylon Yogev. EUROCRYPT 2018.
[PDF]
- White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing
Ilan Komargodski, Moni Naor, and Eylon Yogev. FOCS 2017.
[PDF] [Goldreich's take]
- The Deep Journey from Content to Collaborative Filtering
Oren Barkan, Noam Koenigstein, and Eylon Yogev.
[PDF]
- The Journey from NP to TFNP Hardness
Pavel Hubáček, Moni Naor, and Eylon Yogev.
ITCS 2017 (honorary invited).
[PDF] [Lecture Notes]
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
Pavel Hubáček and Eylon Yogev.
SODA 2017.
[PDF]
-
-
-
Bloom Filters in Adversarial Environments
Moni Naor and Eylon Yogev.
CRYPTO 2015.
[PDF]
-
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
Ilan Komargodski, Gil Segev, and Eylon Yogev.
TCC 2015.
Journal of Cryptology 2017.
[PDF] [Journal]
-
-
-
Tight Bounds for Sliding Bloom Filters
Moni Naor and Eylon Yogev.
ISAAC 2013.
Algorithmica (by invitation).
[PDF] [Journal]
|
|