Eylon Yogev

Bar-Ilan University
Computer Science Department
eylon.yogev [at] biu.ac.il
Office: 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.


  • 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)


Workshop Organization

Program Committees

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


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

    Gal Arnon, Shany Ben-David, and Eylon Yogev


  2. Rogue-Instance Security for Batch Knowledge Proofs

    Gil Segev, Amit Sharabi, and Eylon Yogev

    TCC 2023

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

  4. Lower Bound on SNARGs in the Random Oracle Model

    Iftach Haitner, Daniel Nukrai, and Eylon Yogev

    CRYPTO 2022  

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

  6. The Adversarial Robustness of Sampling

    Omri Ben-Eliezer and Eylon Yogev

    PODS 2020

    Invited to HALG 2020

  7. The Journey from NP to TFNP Hardness

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

    ITCS 2017 (honorary invited)

  8. How to Share a Secret, Infinitely

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    TCC 2016-B

    IEEE Transactions on Information Theory, 2017

  9. Bloom Filters in Adversarial Environments

    Moni Naor and Eylon Yogev

    CRYPTO 2015

    ACM Transactions on Algorithms (TALG)

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

  11. Secret-Sharing for NP

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    ASIACRYPT 2014

    Invited to journal of Cryptology 2015

  12. Tight Bounds for Sliding Bloom Filters

    Moni Naor and Eylon Yogev

    ISAAC 2013

    Invitation to Algorithmica 2015