Eylon Yogev

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 88

Top Venues

IACR Cryptol. ePrint Arch.

CoRR

Electron. Colloquium Comput. Complex.

SODA

Publications

Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
STIR: Reed-Solomon Proximity Testing with Fewer Queries. CRYPTO (10) (2024)
Gal Arnon, Shany Ben-David, Eylon Yogev
Hamming Weight Proofs of Proximity with One-Sided Error. IACR Cryptol. ePrint Arch. 2024 (2024)
Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev
STIR: Reed-Solomon Proximity Testing with Fewer Queries. IACR Cryptol. ePrint Arch. 2024 (2024)
Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM 70 (4) (2023)
Yael Hitron, Merav Parter, Eylon Yogev
Secure Distributed Network Optimization Against Eavesdroppers. ITCS (2023)
Gal Arnon, Alessandro Chiesa, Eylon Yogev
IOPs with Inverse Polynomial Soundness Error. FOCS (2023)
Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev
Security Bounds for Proof-Carrying Data from Straightline Extractors. IACR Cryptol. ePrint Arch. 2023 (2023)
Andreas Hülsing, Mikhail A. Kudinov, Eyal Ronen, Eylon Yogev
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost. SP (2023)
Gil Segev, Amit Sharabi, Eylon Yogev
Rogue-Instance Security for Batch Knowledge Proofs. IACR Cryptol. ePrint Arch. 2023 (2023)
Gal Arnon, Alessandro Chiesa, Eylon Yogev
IOPs with Inverse Polynomial Soundness Error. IACR Cryptol. ePrint Arch. 2023 (2023)
Gil Segev, Amit Sharabi, Eylon Yogev
Rogue-Instance Security for Batch Knowledge Proofs. TCC (1) (2023)
Gal Arnon, Alessandro Chiesa, Eylon Yogev
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. CCC (2022)
Iftach Haitner, Daniel Nukrai, Eylon Yogev
Lower Bound on SNARGs in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2022 (2022)
Mikhail A. Kudinov, Andreas Hülsing, Eyal Ronen, Eylon Yogev
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost. IACR Cryptol. ePrint Arch. 2022 (2022)
Iftach Haitner, Daniel Nukrai, Eylon Yogev
Lower Bound on SNARGs in the Random Oracle Model. CRYPTO (3) (2022)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51 (6) (2022)
Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev
A Toolbox for Barriers on Interactive Oracle Proofs. TCC (1) (2022)
Gal Arnon, Alessandro Chiesa, Eylon Yogev
A PCP Theorem for Interactive Proofs and Applications. EUROCRYPT (2) (2022)
Gal Arnon, Alessandro Chiesa, Eylon Yogev
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2022 (2022)
Nimrod Aviram, Benjamin Dowling, Ilan Komargodski, Kenneth G. Paterson, Eyal Ronen, Eylon Yogev
Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS. IACR Cryptol. ePrint Arch. 2022 (2022)
Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev
A Toolbox for Barriers on Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2022 (2022)
Yael Hitron, Merav Parter, Eylon Yogev
Broadcast CONGEST Algorithms Against Eavesdroppers. DISC (2022)
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
A Framework for Adversarially Robust Streaming Algorithms. J. ACM 69 (2) (2022)
Alessandro Chiesa, Eylon Yogev
Subquadratic SNARGs in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2021 (2021)
Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. CoRR (2021)
Gal Arnon, Alessandro Chiesa, Eylon Yogev
A PCP Theorem for Interactive Proofs. IACR Cryptol. ePrint Arch. 2021 (2021)
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
A Framework for Adversarially Robust Streaming Algorithms. SIGMOD Rec. 50 (1) (2021)
Alessandro Chiesa, Eylon Yogev
Tight Security Bounds for Micali's SNARGs. TCC (1) (2021)
Alessandro Chiesa, Eylon Yogev
Subquadratic SNARGs in the Random Oracle Model. CRYPTO (1) (2021)
Alessandro Chiesa, Eylon Yogev
Tight Security Bounds for Micali's SNARGs. IACR Cryptol. ePrint Arch. 2021 (2021)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. CoRR (2021)
Noga Alon, Omri Ben-Eliezer, Yuval Dagan, Shay Moran, Moni Naor, Eylon Yogev
Adversarial laws of large numbers and optimal regret in online classification. STOC (2021)
Alessandro Chiesa, Eylon Yogev
Barriers for Succinct Arguments in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2020 (2020)
Pavel Hubácek, Eylon Yogev
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SIAM J. Comput. 49 (6) (2020)
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
A Framework for Adversarially Robust Streaming Algorithms. CoRR (2020)
Ofer Grossman, Justin Holmgren, Eylon Yogev
Transparent Error Correcting in a Computationally Bounded World. IACR Cryptol. ePrint Arch. 2020 (2020)
Alessandro Chiesa, Eylon Yogev
Barriers for Succinct Arguments in the Random Oracle Model. TCC (2) (2020)
Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev
A Framework for Adversarially Robust Streaming Algorithms. PODS (2020)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. SODA (2020)
Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. FOCS (2020)
Ofer Grossman, Justin Holmgren, Eylon Yogev
Transparent Error Correcting in a Computationally Bounded World. TCC (3) (2020)
Liran Katzir, Clara Shikhelman, Eylon Yogev
Interactive Proofs for Social Graphs. IACR Cryptol. ePrint Arch. 2020 (2020)
Liran Katzir, Clara Shikhelman, Eylon Yogev
Interactive Proofs for Social Graphs. CRYPTO (3) (2020)
Omri Ben-Eliezer, Eylon Yogev
The Adversarial Robustness of Sampling. PODS (2020)
Christoph Lenzen, Merav Parter, Eylon Yogev
Parallel Balanced Allocations: The Heavily Loaded Case. SPAA (2019)
Merav Parter, Eylon Yogev
Distributed Algorithms Made Secure: A Graph Theoretic Approach. SODA (2019)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. 26 (2019)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) (2019)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. ACM Trans. Algorithms 15 (3) (2019)
Merav Parter, Eylon Yogev
Low Congestion Cycle Covers and Their Applications. SODA (2019)
Ilan Komargodski, Moni Naor, Eylon Yogev
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66 (5) (2019)
Merav Parter, Eylon Yogev
Secure Distributed Computing Made (Nearly) Optimal. PODC (2019)
Christoph Lenzen, Merav Parter, Eylon Yogev
Parallel Balanced Allocations: The Heavily Loaded Case. CoRR (2019)
Omri Ben-Eliezer, Eylon Yogev
The Adversarial Robustness of Sampling. IACR Cryptol. ePrint Arch. 2019 (2019)
Oren Barkan, Noam Koenigstein, Eylon Yogev, Ori Katz
CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations. RecSys (2019)
Omri Ben-Eliezer, Eylon Yogev
The Adversarial Robustness of Sampling. CoRR (2019)
Merav Parter, Eylon Yogev
Optimal Short Cycle Decomposition in Almost Linear Time. ICALP (2019)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. CoRR (2018)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory 64 (6) (2018)
Ilan Komargodski, Moni Naor, Eylon Yogev
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) (2018)
Ilan Komargodski, Eylon Yogev
On Distributional Collision Resistant Hashing. CRYPTO (2) (2018)
Merav Parter, Eylon Yogev
Congested Clique Algorithms for Graph Spanners. CoRR (2018)
Merav Parter, Eylon Yogev
Congested Clique Algorithms for Graph Spanners. DISC (2018)
Moni Naor, Merav Parter, Eylon Yogev
The Power of Distributed Verifiers in Interactive Proofs. Electron. Colloquium Comput. Complex. 25 (2018)
Ilan Komargodski, Gil Segev, Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. J. Cryptol. 31 (1) (2018)
Merav Parter, Eylon Yogev
Low Congestion Cycle Covers and their Applications. CoRR (2018)
Ilan Komargodski, Eylon Yogev
On Distributional Collision Resistant Hashing. IACR Cryptol. ePrint Arch. 2018 (2018)
Ilan Komargodski, Eylon Yogev
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. IACR Cryptol. ePrint Arch. 2018 (2018)
Ilan Komargodski, Eylon Yogev
Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation. EUROCRYPT (1) (2018)
Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev
Non-Interactive Multiparty Computation Without Correlated Randomness. ASIACRYPT (3) (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP. J. Cryptol. 30 (2) (2017)
Merav Parter, Eylon Yogev
Distributed Computing Made Secure: A New Cycle Cover Theorem. CoRR (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. IACR Cryptol. ePrint Arch. 2017 (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. FOCS (2017)
Pavel Hubácek, Moni Naor, Eylon Yogev
The Journey from NP to TFNP Hardness. ITCS (2017)
Merav Parter, Eylon Yogev
Distributed Computing Made Secure: A New Cycle Cover Theorem. IACR Cryptol. ePrint Arch. 2017 (2017)
Ilan Komargodski, Moni Naor, Eylon Yogev
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. Electron. Colloquium Comput. Complex. 24 (2017)
Pavel Hubácek, Eylon Yogev
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SODA (2017)
Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev
Non-Interactive Multiparty Computation without Correlated Randomness. IACR Cryptol. ePrint Arch. 2017 (2017)
Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. CRYPTO (2) (2016)
Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security. IACR Cryptol. ePrint Arch. 2016 (2016)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. Electron. Colloquium Comput. Complex. 23 (2016)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. IACR Cryptol. ePrint Arch. 2016 (2016)
Pavel Hubácek, Eylon Yogev
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. Electron. Colloquium Comput. Complex. 23 (2016)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. TCC (B2) (2016)
Pavel Hubácek, Moni Naor, Eylon Yogev
The Journey from NP to TFNP Hardness. Electron. Colloquium Comput. Complex. 23 (2016)
Oren Barkan, Noam Koenigstein, Eylon Yogev
The Deep Journey from Content to Collaborative Filtering. CoRR (2016)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. CRYPTO (2) (2015)
Moni Naor, Eylon Yogev
Tight Bounds for Sliding Bloom Filters. Algorithmica 73 (4) (2015)
Ilan Komargodski, Gil Segev, Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. TCC (2) (2015)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. IACR Cryptol. ePrint Arch. 2015 (2015)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)Perfect Obfuscation. FOCS (2014)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014 (2014)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP. ASIACRYPT (2) (2014)
Moni Naor, Eylon Yogev
Bloom Filters in Adversarial Environments. CoRR (2014)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014 (2014)
Ilan Komargodski, Moni Naor, Eylon Yogev
Secret-Sharing for NP from Indistinguishability Obfuscation. CoRR (2014)
Ilan Komargodski, Gil Segev, Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2014 (2014)
Moni Naor, Eylon Yogev
Sliding Bloom Filters CoRR (2013)

Eylon Yogev.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eylon Yogev