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

• 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

Workshop Organization

• Organizer: The 13th BIU Winter School on Cryptography

Program Committees

ZKProof 6, TCC 2023, CRYPTO 2022, ITCS 2022, Eurocrypt 2020, TCC 2020

Publications

1. Hamming Weight Proofs of Proximity with One-Sided Error

   Gal Arnon, Shany Ben-David, and Eylon Yogev

   manuscript

2. 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

3. Security Bounds for Proof-Carrying Data from Straightline Extractors

   Alessandro Chiesa, Ziyi Guan, Shahar Samocha, and Eylon Yogev

   manuscript

4. Rogue-Instance Security for Batch Knowledge Proofs

   Gil Segev, Amit Sharabi, and Eylon Yogev

   TCC 2023

5. IOPs with Inverse Polynomial Soundness Error

   Gal Arnon, Alessandro Chiesa, and Eylon Yogev

   FOCS 2023

6. Secure Distributed Network Optimization Against Eavesdroppers

   Yael Hitron, Merav Parter, and Eylon Yogev

   ITCS 2023  

7. Broadcast CONGEST Algorithms Against Eavesdroppers

   Yael Hitron, Merav Parter, and Eylon Yogev

   DISC 2022

8. A Toolbox for Barriers on Interactive Oracle Proofs

   Gal Arnon, Amey Bhangale, Alessandro Chiesa, and Eylon Yogev

   TCC 2022

9. 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

   4th NIST PQC Standardization Conference  

10. Lower Bound on SNARGs in the Random Oracle Model

    Iftach Haitner, Daniel Nukrai, and Eylon Yogev

    CRYPTO 2022  

11. Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs

    Gal Arnon, Alessandro Chiesa and Eylon Yogev

    CCC 2022  

12. Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS

    Nimrod Aviram, Benjamin Dowling, Ilan Komargodski, Kenneth G. Paterson, Eyal Ronen, and Eylon Yogev

    2022

13. A PCP Theorem for Interactive Proofs and Applications

    Gal Arnon, Alessandro Chiesa, and Eylon Yogev

    EUROCRYPT 2022

14. Subquadratic SNARGs in the Random Oracle Model

    Alessandro Chiesa and Eylon Yogev

    CRYPTO 2021  

15. Tight Security Bounds for Micali’s SNARGs

    Alessandro Chiesa and Eylon Yogev

    TCC 2021

16. Adversarial Laws of Large Numbers and Optimal Regret in Online Classification

    Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, and Eylon Yogev

    STOC 2021

    SIAM Journal on Computing (SICOMP)

17. Barriers for Succinct Arguments in the Random Oracle Model

    Alessandro Chiesa and Eylon Yogev

    TCC 2020  

18. Interactive Proofs for Social Graphs

    Liran Katzir, Clara Shikhelman, and Eylon Yogev

    CRYPTO 2020  

19. 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)

20. Transparent Error Correcting in a Computationally Bounded World

    Ofer Grossman, Justin Holmgren, and Eylon Yogev

    TCC 2020

21. 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)

22. The Adversarial Robustness of Sampling

    Omri Ben-Eliezer and Eylon Yogev

    PODS 2020

    Invited to HALG 2020

23. Secure Distributed Computing Made Optimal

    Merav Parter and Eylon Yogev

    PODC 2019

24. Optimal Short Cycle Decomposition in Almost Linear Time

    Merav Parter and Eylon Yogev

    ICALP 2019

25. Parallel Balanced Allocations: The Heavily Loaded Case

    Christoph Lenzen, Merav Parter, and Eylon Yogev

    SPAA 2019

26. Distributional Collision Resistance Beyond One-Way Functions

    Nir Bitansky, Iftach Haitner, Ilan Komargodski, and Eylon Yogev

    EUROCRYPT 2019

27. The Power of Distributed Verifiers in Interactive Proofs

    Moni Naor, Merav Parter, and Eylon Yogev

    SODA 2020

28. Low Congestion Cycle Covers and Their Applications

    Merav Parter and Eylon Yogev

    SODA 2019

29. Distributed Algorithms Made Secure: A Graph Theoretic Approach

    Merav Parter and Eylon Yogev

    SODA 2019

30. Congested Clique Algorithms for Graph Spanners

    Merav Parter and Eylon Yogev

    DISC 2018

31. On Distributional Collision Resistant Hashing

    Ilan Komargodski and Eylon Yogev

    CRYPTO 2018

32. Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation

    Ilan Komargodski and Eylon Yogev

    EUROCRYPT 2018

33. Non-Interactive Multiparty Computation without Correlated Randomness

    Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, and Eylon Yogev

    ASIACRYPT 2017

34. Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    EUROCRYPT 2018

35. 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)

36. CB2CF: A Neural Multiview Content-to-Collaborative Filtering Model for Completely Cold Item Recommendations

    Oren Barkan, Ori Katz, Noam Koenigstein, and Eylon Yogev

    RecSys 2019

37. The Journey from NP to TFNP Hardness

    Pavel Hubáček, Moni Naor, and Eylon Yogev

    ITCS 2017 (honorary invited)

38. Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds

    Pavel Hubáček and Eylon Yogev

    SODA 2017

    SIAM Journal on Computing (SICOMP)

39. Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

    Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, and Eylon Yogev

    CRYPTO 2016

40. How to Share a Secret, Infinitely

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    TCC 2016-B

    IEEE Transactions on Information Theory, 2017

41. Bloom Filters in Adversarial Environments

    Moni Naor and Eylon Yogev

    CRYPTO 2015

    ACM Transactions on Algorithms (TALG)

42. 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

43. 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)

44. Secret-Sharing for NP

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    ASIACRYPT 2014

    Invited to journal of Cryptology 2015

45. Tight Bounds for Sliding Bloom Filters

    Moni Naor and Eylon Yogev

    ISAAC 2013

    Invitation to Algorithmica 2015