About Me

I am an Associate Professor in the Department of Computer Science at Bar-Ilan University and a researcher at the Bar-Ilan Center for Research in Applied Cryptography and Cyber Security. I got my PhD from the Weizmann Institute under the supervision of Prof. Moni Naor.


My research is in cryptography and theoretical computer science. I study proof systems that let someone verify a long computation without rerunning it — checking a few hundred bytes instead of gigabytes, and still being convinced. Much of my work concerns the security and efficiency of these systems.


I am always glad to hear from students interested in cryptography — feel free to get in touch.

Book Building Cryptographic Proofs from Hash Functions New video Can You Trust a Proof Without Reading It? Best Paper · CRYPTO 2024 STIR: Reed–Solomon Proximity Testing with Fewer Queries Quanta Magazine Computer Scientists Figure Out How to Prove Lies

Students

Current
  • Michael Tsaban (MSc student)
  • Dor Shroitman (MSc student)
  • Shany Ben-David (PhD student)
  • Rachel Kerem (PhD student)
Past
  • Gal Arnon (PhD, co-advised with Moni Naor)
  • Amit Sharabi (MSc)
  • Daniel Nukrai (MSc, co-advised with Iftach Haitner)

Books & Media

Publications

  1. Preprints

  2. SNARGs for NP via Fiat-Shamir in the Plain Model

    Ziyi Guan and Eylon Yogev

  3. 2026

  4. How to Build Succinct Arguments From Succinct Commitments

    Alessandro Chiesa, Ziyi Guan, Christian Knabenhans, and Eylon Yogev

    Proceedings of the IEEE, 2026

  5. Interactive Proofs for Batch Polynomial Evaluation

    Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, and Eylon Yogev

    ITC 2026

  6. Pairing-Based SNARGs with Two Group Elements

    Gal Arnon, Jesko Dujmovic and Eylon Yogev

    CRYPTO 2026, ZKProof 8

  7. 2025

  8. Incompressible Encryption with Everlasting Security

    Shany Ben-David and Eylon Yogev

    TCC 2025

  9. Towards a White-Box Secure Fiat-Shamir Transformation

    Gal Arnon and Eylon Yogev

    CRYPTO 2025, ZKProof 7

    Featured on Quanta Magazine

  10. Instance Compression, Revisited

    Gal Arnon, Shany Ben-David, and Eylon Yogev

    Eurocrypt 2025

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

  12. 2024

  13. From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking

    Gil Segev, Lior Rotem, and Eylon Yogev

    TCC 2024

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

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

    Gal Arnon, Shany Ben-David, and Eylon Yogev

    TCC 2024

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

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

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

    TCC 2024

  18. 2023

  19. Rogue-Instance Security for Batch Knowledge Proofs

    Gil Segev, Amit Sharabi, and Eylon Yogev

    TCC 2023

  20. IOPs with Inverse Polynomial Soundness Error

    Gal Arnon, Alessandro Chiesa, and Eylon Yogev

    FOCS 2023

  21. Secure Distributed Network Optimization Against Eavesdroppers

    Yael Hitron, Merav Parter, and Eylon Yogev

    ITCS 2023

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

  23. 2022

  24. Broadcast CONGEST Algorithms Against Eavesdroppers

    Yael Hitron, Merav Parter, and Eylon Yogev

    DISC 2022

  25. A Toolbox for Barriers on Interactive Oracle Proofs

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

    TCC 2022

  26. Lower Bound on SNARGs in the Random Oracle Model

    Iftach Haitner, Daniel Nukrai, and Eylon Yogev

    CRYPTO 2022

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

    Gal Arnon, Alessandro Chiesa and Eylon Yogev

    CCC 2022

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

  29. A PCP Theorem for Interactive Proofs and Applications

    Gal Arnon, Alessandro Chiesa, and Eylon Yogev

    EUROCRYPT 2022

  30. 2021

  31. Subquadratic SNARGs in the Random Oracle Model

    Alessandro Chiesa and Eylon Yogev

    CRYPTO 2021

  32. Tight Security Bounds for Micali’s SNARGs

    Alessandro Chiesa and Eylon Yogev

    TCC 2021

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

  34. 2020

  35. Barriers for Succinct Arguments in the Random Oracle Model

    Alessandro Chiesa and Eylon Yogev

    TCC 2020

  36. Interactive Proofs for Social Graphs

    Liran Katzir, Clara Shikhelman, and Eylon Yogev

    CRYPTO 2020

  37. 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 JACM

  38. Transparent Error Correcting in a Computationally Bounded World

    Ofer Grossman, Justin Holmgren, and Eylon Yogev

    TCC 2020

  39. On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds

    Lijie Chen, Ron Rothblum, Roei Tell, and Eylon Yogev

    FOCS 2020, Journal of the ACM (JACM) [slides]

  40. The Adversarial Robustness of Sampling

    Omri Ben-Eliezer and Eylon Yogev

    PODS 2020, Invited to HALG 2020

  41. The Power of Distributed Verifiers in Interactive Proofs

    Moni Naor, Merav Parter, and Eylon Yogev

    SODA 2020

  42. 2019

  43. Secure Distributed Computing Made Optimal

    Merav Parter and Eylon Yogev

    PODC 2019

  44. Optimal Short Cycle Decomposition in Almost Linear Time

    Merav Parter and Eylon Yogev

    ICALP 2019

  45. Parallel Balanced Allocations: The Heavily Loaded Case

    Christoph Lenzen, Merav Parter, and Eylon Yogev

    SPAA 2019

  46. Distributional Collision Resistance Beyond One-Way Functions

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

    EUROCRYPT 2019

  47. Low Congestion Cycle Covers and Their Applications

    Merav Parter and Eylon Yogev

    SODA 2019

  48. Distributed Algorithms Made Secure: A Graph Theoretic Approach

    Merav Parter and Eylon Yogev

    SODA 2019

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

  50. 2018

  51. Congested Clique Algorithms for Graph Spanners

    Merav Parter and Eylon Yogev

    DISC 2018

  52. On Distributional Collision Resistant Hashing

    Ilan Komargodski and Eylon Yogev

    CRYPTO 2018

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

    Ilan Komargodski and Eylon Yogev

    EUROCRYPT 2018

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

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    EUROCRYPT 2018

  55. 2017

  56. Non-Interactive Multiparty Computation without Correlated Randomness

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

    ASIACRYPT 2017

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

  58. The Journey from NP to TFNP Hardness

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

    ITCS 2017 (honorary invited)

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

    Pavel Hubáček and Eylon Yogev

    SODA 2017, SIAM Journal on Computing (SICOMP)

  60. 2016

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

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

    CRYPTO 2016

  62. How to Share a Secret, Infinitely

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    TCC 2016-B, IEEE Transactions on Information Theory, 2017

  63. 2015

  64. Bloom Filters in Adversarial Environments

    Moni Naor and Eylon Yogev

    CRYPTO 2015, ACM Transactions on Algorithms (TALG)

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

  66. 2014

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

  68. Secret-Sharing for NP

    Ilan Komargodski, Moni Naor, and Eylon Yogev

    ASIACRYPT 2014, Invited to journal of Cryptology 2015

  69. 2013

  70. Tight Bounds for Sliding Bloom Filters

    Moni Naor and Eylon Yogev

    ISAAC 2013, Invitation to Algorithmica 2015

Technical Reports

Professional Service

Workshop Organization
Program Committees