Eylon Yogev

119 papers A* 14A 6B 2Journal 69Unranked 28
YearRankTypeTitle / Venue / Authors
2026 J jnl
Accelerating Scientific Research with Gemini: Case Studies and Common Techniques.
CoRR
David P. Woodruff, Vincent Cohen-Addad, Lalit Jain, Jieming Mao, Song Zuo, MohammadHossein Bateni, Simina Brânzei, Michael P. Brenner, Lin Chen, Ying Feng, Lance Fortnow, Gang Fu, Ziyi Guan, Zahra Hadizadeh, Mohammad T. Hajiaghayi, Mahdi JafariRaviz, Adel Javanmard, Karthik C. S., Ken-ichi Kawarabayashi, Ravi Kumar, Silvio Lattanzi, Euiwoong Lee, Yi Li, Ioannis Panageas, Dimitris Paparas, Benjamin Przybocki, Bernardo Subercaseaux, Ola Svensson, Shayan Taherijam, Xuan Wu, Eylon Yogev, Morteza Zadimoghaddam, Samson Zhou, Yossi Matias, James Manyika, Vahab Mirrokni
2026 J jnl
Interactive Proofs for Batch Polynomial Evaluation.
IACR Cryptol. ePrint Arch.
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
2025 — conf
Incompressible Encryption with Everlasting Security.
TCC (2)
Shany Ben-David, Eylon Yogev
2025 J jnl
Incompressible Encryption with Everlasting Security.
IACR Cryptol. ePrint Arch.
Eylon Yogev, Shany Ben-David
2025 — conf
Instance Compression, Revisited.
EUROCRYPT (4)
Gal Arnon, Shany Ben-David, Eylon Yogev
2025 J jnl
Pairing-Based SNARGs with Two Group Elements.
IACR Cryptol. ePrint Arch.
Gal Arnon, Jesko Dujmovic, Eylon Yogev
2025 J jnl
SNARGs for NP from LWE.
IACR Cryptol. ePrint Arch.
Ziyi Guan, Eylon Yogev
2025 — conf
Towards a White-Box Secure Fiat-Shamir Transformation.
CRYPTO (6)
Gal Arnon, Eylon Yogev
2025 J jnl
Towards a White-Box Secure Fiat-Shamir Transformation.
IACR Cryptol. ePrint Arch.
Gal Arnon, Eylon Yogev
2025 — conf
WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification.
EUROCRYPT (4)
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
2024 J jnl
From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev, Eylon Yogev
2024 — conf
From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking.
TCC (3)
Lior Rotem, Gil Segev, Eylon Yogev
2024 — conf
Hamming Weight Proofs of Proximity with One-Sided Error.
TCC (1)
Gal Arnon, Shany Ben-David, Eylon Yogev
2024 J jnl
Hamming Weight Proofs of Proximity with One-Sided Error.
IACR Cryptol. ePrint Arch.
Gal Arnon, Shany Ben-David, Eylon Yogev
2024 J jnl
Instance Compression, Revisited.
IACR Cryptol. ePrint Arch.
Gal Arnon, Shany Ben-David, Eylon Yogev
2024 — conf
STIR: Reed-Solomon Proximity Testing with Fewer Queries.
CRYPTO (10)
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
2024 J jnl
STIR: Reed-Solomon Proximity Testing with Fewer Queries.
IACR Cryptol. ePrint Arch.
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
2024 — conf
Security Bounds for Proof-Carrying Data from Straightline Extractors.
TCC (2)
Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev
2024 — conf
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds.
TCC (1)
Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev
2024 J jnl
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds.
IACR Cryptol. ePrint Arch.
Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev
2024 J jnl
WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification.
IACR Cryptol. ePrint Arch.
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
2023 A* conf
IOPs with Inverse Polynomial Soundness Error.
FOCS
Gal Arnon, Alessandro Chiesa, Eylon Yogev
2023 J jnl
IOPs with Inverse Polynomial Soundness Error.
IACR Cryptol. ePrint Arch.
Gal Arnon, Alessandro Chiesa, Eylon Yogev
2023 J jnl
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds.
J. ACM
Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2023 — conf
Rogue-Instance Security for Batch Knowledge Proofs.
TCC (1)
Gil Segev, Amit Sharabi, Eylon Yogev
2023 J jnl
Rogue-Instance Security for Batch Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Gil Segev, Amit Sharabi, Eylon Yogev
2023 A* conf
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost.
SP
Andreas Hülsing, Mikhail A. Kudinov, Eyal Ronen, Eylon Yogev
2023 A conf
Secure Distributed Network Optimization Against Eavesdroppers.
ITCS
Yael Hitron, Merav Parter, Eylon Yogev
2023 J jnl
Security Bounds for Proof-Carrying Data from Straightline Extractors.
IACR Cryptol. ePrint Arch.
Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev
2022 J jnl
A Framework for Adversarially Robust Streaming Algorithms.
J. ACM
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
2022 — conf
A PCP Theorem for Interactive Proofs and Applications.
EUROCRYPT (2)
Gal Arnon, Alessandro Chiesa, Eylon Yogev
2022 — conf
A Toolbox for Barriers on Interactive Oracle Proofs.
TCC (1)
Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev
2022 J jnl
A Toolbox for Barriers on Interactive Oracle Proofs.
IACR Cryptol. ePrint Arch.
Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev
2022 A conf
Broadcast CONGEST Algorithms Against Eavesdroppers.
DISC
Yael Hitron, Merav Parter, Eylon Yogev
2022 A conf
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.
CCC
Gal Arnon, Alessandro Chiesa, Eylon Yogev
2022 J jnl
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.
IACR Cryptol. ePrint Arch.
Gal Arnon, Alessandro Chiesa, Eylon Yogev
2022 — conf
Lower Bound on SNARGs in the Random Oracle Model.
CRYPTO (3)
Iftach Haitner, Daniel Nukrai, Eylon Yogev
2022 J jnl
Lower Bound on SNARGs in the Random Oracle Model.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Daniel Nukrai, Eylon Yogev
2022 J jnl
One-Way Functions and (Im)perfect Obfuscation.
SIAM J. Comput.
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2022 J jnl
Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS.
IACR Cryptol. ePrint Arch.
Nimrod Aviram, Benjamin Dowling, Ilan Komargodski, Kenneth G. Paterson, Eyal Ronen, Eylon Yogev
2022 J jnl
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost.
IACR Cryptol. ePrint Arch.
Mikhail A. Kudinov, Andreas Hülsing, Eyal Ronen, Eylon Yogev
2021 J jnl
A Framework for Adversarially Robust Streaming Algorithms.
SIGMOD Rec.
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
2021 J jnl
A PCP Theorem for Interactive Proofs.
IACR Cryptol. ePrint Arch.
Gal Arnon, Alessandro Chiesa, Eylon Yogev
2021 J jnl
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification.
CoRR
Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
2021 A* conf
Adversarial laws of large numbers and optimal regret in online classification.
STOC
Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
2021 J jnl
Distributional Collision Resistance Beyond One-Way Functions.
CoRR
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2021 — conf
Subquadratic SNARGs in the Random Oracle Model.
CRYPTO (1)
Alessandro Chiesa, Eylon Yogev
2021 J jnl
Subquadratic SNARGs in the Random Oracle Model.
IACR Cryptol. ePrint Arch.
Alessandro Chiesa, Eylon Yogev
2021 — conf
Tight Security Bounds for Micali's SNARGs.
TCC (1)
Alessandro Chiesa, Eylon Yogev
2021 J jnl
Tight Security Bounds for Micali's SNARGs.
IACR Cryptol. ePrint Arch.
Alessandro Chiesa, Eylon Yogev
2020 A* conf
A Framework for Adversarially Robust Streaming Algorithms.
PODS
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
2020 J jnl
A Framework for Adversarially Robust Streaming Algorithms.
CoRR
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
2020 — conf
Barriers for Succinct Arguments in the Random Oracle Model.
TCC (2)
Alessandro Chiesa, Eylon Yogev
2020 J jnl
Barriers for Succinct Arguments in the Random Oracle Model.
IACR Cryptol. ePrint Arch.
Alessandro Chiesa, Eylon Yogev
2020 J jnl
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.
SIAM J. Comput.
Pavel Hubácek, Eylon Yogev
2020 — conf
Interactive Proofs for Social Graphs.
CRYPTO (3)
Liran Katzir, Clara Shikhelman, Eylon Yogev
2020 J jnl
Interactive Proofs for Social Graphs.
IACR Cryptol. ePrint Arch.
Liran Katzir, Clara Shikhelman, Eylon Yogev
2020 A* conf
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract.
FOCS
Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2020 A* conf
The Adversarial Robustness of Sampling.
PODS
Omri Ben-Eliezer, Eylon Yogev
2020 A* conf
The Power of Distributed Verifiers in Interactive Proofs.
SODA
Moni Naor, Merav Parter, Eylon Yogev
2020 — conf
Transparent Error Correcting in a Computationally Bounded World.
TCC (3)
Ofer Grossman, Justin Holmgren, Eylon Yogev
2020 J jnl
Transparent Error Correcting in a Computationally Bounded World.
IACR Cryptol. ePrint Arch.
Ofer Grossman, Justin Holmgren, Eylon Yogev
2019 J jnl
Bloom Filters in Adversarial Environments.
ACM Trans. Algorithms
Moni Naor, Eylon Yogev
2019 A conf
CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations.
RecSys
Oren Barkan, Noam Koenigstein, Eylon Yogev, Ori Katz
2019 A* conf
Distributed Algorithms Made Secure: A Graph Theoretic Approach.
SODA
Merav Parter, Eylon Yogev
2019 — conf
Distributional Collision Resistance Beyond One-Way Functions.
EUROCRYPT (3)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2019 J jnl
Distributional Collision Resistance Beyond One-Way Functions.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2019 A* conf
Low Congestion Cycle Covers and Their Applications.
SODA
Merav Parter, Eylon Yogev
2019 J jnl
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds.
Electron. Colloquium Comput. Complex.
Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev
2019 A* conf
Optimal Short Cycle Decomposition in Almost Linear Time.
ICALP
Merav Parter, Eylon Yogev
2019 B conf
Parallel Balanced Allocations: The Heavily Loaded Case.
SPAA
Christoph Lenzen, Merav Parter, Eylon Yogev
2019 J jnl
Parallel Balanced Allocations: The Heavily Loaded Case.
CoRR
Christoph Lenzen, Merav Parter, Eylon Yogev
2019 A* conf
Secure Distributed Computing Made (Nearly) Optimal.
PODC
Merav Parter, Eylon Yogev
2019 J jnl
The Adversarial Robustness of Sampling.
CoRR
Omri Ben-Eliezer, Eylon Yogev
2019 J jnl
The Adversarial Robustness of Sampling.
IACR Cryptol. ePrint Arch.
Omri Ben-Eliezer, Eylon Yogev
2019 J jnl
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing.
J. ACM
Ilan Komargodski, Moni Naor, Eylon Yogev
2018 J jnl
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Eylon Yogev
2018 — conf
Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation.
EUROCRYPT (1)
Ilan Komargodski, Eylon Yogev
2018 — conf
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions.
EUROCRYPT (2)
Ilan Komargodski, Moni Naor, Eylon Yogev
2018 A conf
Congested Clique Algorithms for Graph Spanners.
DISC
Merav Parter, Eylon Yogev
2018 J jnl
Congested Clique Algorithms for Graph Spanners.
CoRR
Merav Parter, Eylon Yogev
2018 J jnl
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
J. Cryptol.
Ilan Komargodski, Gil Segev, Eylon Yogev
2018 J jnl
How to Share a Secret, Infinitely.
IEEE Trans. Inf. Theory
Ilan Komargodski, Moni Naor, Eylon Yogev
2018 J jnl
Low Congestion Cycle Covers and their Applications.
CoRR
Merav Parter, Eylon Yogev
2018 — conf
On Distributional Collision Resistant Hashing.
CRYPTO (2)
Ilan Komargodski, Eylon Yogev
2018 J jnl
On Distributional Collision Resistant Hashing.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Eylon Yogev
2018 J jnl
The Power of Distributed Verifiers in Interactive Proofs.
CoRR
Moni Naor, Merav Parter, Eylon Yogev
2018 J jnl
The Power of Distributed Verifiers in Interactive Proofs.
Electron. Colloquium Comput. Complex.
Moni Naor, Merav Parter, Eylon Yogev
2017 J jnl
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Moni Naor, Eylon Yogev
2017 J jnl
Distributed Computing Made Secure: A New Cycle Cover Theorem.
CoRR
Merav Parter, Eylon Yogev
2017 J jnl
Distributed Computing Made Secure: A New Cycle Cover Theorem.
IACR Cryptol. ePrint Arch.
Merav Parter, Eylon Yogev
2017 A* conf
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.
SODA
Pavel Hubácek, Eylon Yogev
2017 — conf
Non-Interactive Multiparty Computation Without Correlated Randomness.
ASIACRYPT (3)
Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev
2017 J jnl
Non-Interactive Multiparty Computation without Correlated Randomness.
IACR Cryptol. ePrint Arch.
Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev
2017 J jnl
Secret-Sharing for NP.
J. Cryptol.
Ilan Komargodski, Moni Naor, Eylon Yogev
2017 A conf
The Journey from NP to TFNP Hardness.
ITCS
Pavel Hubácek, Moni Naor, Eylon Yogev
2017 A* conf
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing.
FOCS
Ilan Komargodski, Moni Naor, Eylon Yogev
2017 J jnl
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing.
Electron. Colloquium Comput. Complex.
Ilan Komargodski, Moni Naor, Eylon Yogev
2016 J jnl
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds.
Electron. Colloquium Comput. Complex.
Pavel Hubácek, Eylon Yogev
2016 — conf
How to Share a Secret, Infinitely.
TCC (B2)
Ilan Komargodski, Moni Naor, Eylon Yogev
2016 J jnl
How to Share a Secret, Infinitely.
Electron. Colloquium Comput. Complex.
Ilan Komargodski, Moni Naor, Eylon Yogev
2016 J jnl
How to Share a Secret, Infinitely.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Moni Naor, Eylon Yogev
2016 J jnl
The Deep Journey from Content to Collaborative Filtering.
CoRR
Oren Barkan, Noam Koenigstein, Eylon Yogev
2016 J jnl
The Journey from NP to TFNP Hardness.
Electron. Colloquium Comput. Complex.
Pavel Hubácek, Moni Naor, Eylon Yogev
2016 — conf
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.
CRYPTO (2)
Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
2016 J jnl
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptol. ePrint Arch.
Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
2015 — conf
Bloom Filters in Adversarial Environments.
CRYPTO (2)
Moni Naor, Eylon Yogev
2015 J jnl
Bloom Filters in Adversarial Environments.
IACR Cryptol. ePrint Arch.
Moni Naor, Eylon Yogev
2015 — conf
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
TCC (2)
Ilan Komargodski, Gil Segev, Eylon Yogev
2015 J jnl
Tight Bounds for Sliding Bloom Filters.
Algorithmica
Moni Naor, Eylon Yogev
2014 J jnl
Bloom Filters in Adversarial Environments.
CoRR
Moni Naor, Eylon Yogev
2014 J jnl
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Gil Segev, Eylon Yogev
2014 A* conf
One-Way Functions and (Im)Perfect Obfuscation.
FOCS
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014 J jnl
One-Way Functions and (Im)perfect Obfuscation.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014 J jnl
Secret-Sharing for NP from Indistinguishability Obfuscation.
CoRR
Ilan Komargodski, Moni Naor, Eylon Yogev
2014 J jnl
Secret-Sharing for NP from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Moni Naor, Eylon Yogev
2014 — conf
Secret-Sharing for NP.
ASIACRYPT (2)
Ilan Komargodski, Moni Naor, Eylon Yogev
2013 J jnl
Sliding Bloom Filters
CoRR
Moni Naor, Eylon Yogev
2013 B conf
Sliding Bloom Filters.
ISAAC
Moni Naor, Eylon Yogev