default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEylon Yogev
Person information
- affiliation: Bar-Ilan University, Ramat-Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c42]Gal Arnon
, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev:
STIR: Reed-Solomon Proximity Testing with Fewer Queries. CRYPTO (10) 2024: 380-413- [i52]Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev:
STIR: Reed-Solomon Proximity Testing with Fewer Queries. IACR Cryptol. ePrint Arch. 2024: 390 (2024) - [i51]Gal Arnon, Shany Ben-David, Eylon Yogev:
Hamming Weight Proofs of Proximity with One-Sided Error. IACR Cryptol. ePrint Arch. 2024: 832 (2024) - [i50]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev:
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. IACR Cryptol. ePrint Arch. 2024: 1434 (2024) - [i49]Gal Arnon, Alessandro Chiesa, Giacomo Fenzi, Eylon Yogev:
WHIR: Reed-Solomon Proximity Testing with Super-Fast Verification. IACR Cryptol. ePrint Arch. 2024: 1586 (2024) - [i48]Gal Arnon, Shany Ben-David, Eylon Yogev:
Instance Compression, Revisited. IACR Cryptol. ePrint Arch. 2024: 1659 (2024) - [i47]Lior Rotem, Gil Segev, Eylon Yogev:
From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking. IACR Cryptol. ePrint Arch. 2024: 1704 (2024) - 2023
- [j11]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM 70(4): 25:1-25:62 (2023) - [c41]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
IOPs with Inverse Polynomial Soundness Error. FOCS 2023: 752-761 - [c40]Yael Hitron, Merav Parter, Eylon Yogev:
Secure Distributed Network Optimization Against Eavesdroppers. ITCS 2023: 71:1-71:20 - [c39]Andreas Hülsing, Mikhail A. Kudinov, Eyal Ronen, Eylon Yogev:
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost. SP 2023: 1435-1453 - [c38]Gil Segev, Amit Sharabi, Eylon Yogev:
Rogue-Instance Security for Batch Knowledge Proofs. TCC (1) 2023: 121-157 - [i46]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
IOPs with Inverse Polynomial Soundness Error. IACR Cryptol. ePrint Arch. 2023: 1062 (2023) - [i45]Gil Segev, Amit Sharabi, Eylon Yogev:
Rogue-Instance Security for Batch Knowledge Proofs. IACR Cryptol. ePrint Arch. 2023: 1420 (2023) - [i44]Alessandro Chiesa, Ziyi Guan, Shahar Samocha, Eylon Yogev:
Security Bounds for Proof-Carrying Data from Straightline Extractors. IACR Cryptol. ePrint Arch. 2023: 1646 (2023) - 2022
- [j10]Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. J. ACM 69(2): 17:1-17:33 (2022) - [j9]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51(6): 1769-1795 (2022) - [c37]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. CCC 2022: 24:1-24:16 - [c36]Iftach Haitner, Daniel Nukrai, Eylon Yogev:
Lower Bound on SNARGs in the Random Oracle Model. CRYPTO (3) 2022: 97-127 - [c35]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
A PCP Theorem for Interactive Proofs and Applications. EUROCRYPT (2) 2022: 64-94 - [c34]Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev:
A Toolbox for Barriers on Interactive Oracle Proofs. TCC (1) 2022: 447-466 - [c33]Yael Hitron, Merav Parter, Eylon Yogev:
Broadcast CONGEST Algorithms Against Eavesdroppers. DISC 2022: 27:1-27:19 - [i43]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: 65 (2022) - [i42]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2022: 168 (2022) - [i41]Iftach Haitner, Daniel Nukrai, Eylon Yogev:
Lower Bound on SNARGs in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2022: 178 (2022) - [i40]Mikhail A. Kudinov, Andreas Hülsing, Eyal Ronen, Eylon Yogev:
SPHINCS+C: Compressing SPHINCS+ With (Almost) No Cost. IACR Cryptol. ePrint Arch. 2022: 778 (2022) - [i39]Gal Arnon, Amey Bhangale, Alessandro Chiesa, Eylon Yogev:
A Toolbox for Barriers on Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2022: 790 (2022) - 2021
- [j8]Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. SIGMOD Rec. 50(1): 6-13 (2021) - [c32]Alessandro Chiesa, Eylon Yogev:
Subquadratic SNARGs in the Random Oracle Model. CRYPTO (1) 2021: 711-741 - [c31]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: 447-455 - [c30]Alessandro Chiesa, Eylon Yogev:
Tight Security Bounds for Micali's SNARGs. TCC (1) 2021: 401-434 - [i38]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 abs/2101.09054 (2021) - [i37]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. CoRR abs/2105.00710 (2021) - [i36]Alessandro Chiesa, Eylon Yogev:
Tight Security Bounds for Micali's SNARGs. IACR Cryptol. ePrint Arch. 2021: 188 (2021) - [i35]Alessandro Chiesa, Eylon Yogev:
Subquadratic SNARGs in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2021: 281 (2021) - [i34]Gal Arnon, Alessandro Chiesa, Eylon Yogev:
A PCP Theorem for Interactive Proofs. IACR Cryptol. ePrint Arch. 2021: 915 (2021) - 2020
- [j7]Pavel Hubácek, Eylon Yogev:
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SIAM J. Comput. 49(6): 1128-1172 (2020) - [c29]Liran Katzir, Clara Shikhelman, Eylon Yogev:
Interactive Proofs for Social Graphs. CRYPTO (3) 2020: 574-601 - [c28]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. FOCS 2020: 13-23 - [c27]Omri Ben-Eliezer, Eylon Yogev:
The Adversarial Robustness of Sampling. PODS 2020: 49-62 - [c26]Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. PODS 2020: 63-80 - [c25]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. SODA 2020: 1096-115 - [c24]Alessandro Chiesa, Eylon Yogev:
Barriers for Succinct Arguments in the Random Oracle Model. TCC (2) 2020: 47-76 - [c23]Ofer Grossman, Justin Holmgren, Eylon Yogev:
Transparent Error Correcting in a Computationally Bounded World. TCC (3) 2020: 530-549 - [i33]Omri Ben-Eliezer, Rajesh Jayaram, David P. Woodruff, Eylon Yogev:
A Framework for Adversarially Robust Streaming Algorithms. CoRR abs/2003.14265 (2020) - [i32]Ofer Grossman, Justin Holmgren, Eylon Yogev:
Transparent Error Correcting in a Computationally Bounded World. IACR Cryptol. ePrint Arch. 2020: 1411 (2020) - [i31]Alessandro Chiesa, Eylon Yogev:
Barriers for Succinct Arguments in the Random Oracle Model. IACR Cryptol. ePrint Arch. 2020: 1427 (2020) - [i30]Liran Katzir, Clara Shikhelman, Eylon Yogev:
Interactive Proofs for Social Graphs. IACR Cryptol. ePrint Arch. 2020: 1433 (2020)
2010 – 2019
- 2019
- [j6]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66(5): 34:1-34:28 (2019) - [j5]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. ACM Trans. Algorithms 15(3): 35:1-35:30 (2019) - [c22]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) 2019: 667-695 - [c21]Merav Parter, Eylon Yogev:
Optimal Short Cycle Decomposition in Almost Linear Time. ICALP 2019: 89:1-89:14 - [c20]Merav Parter, Eylon Yogev:
Secure Distributed Computing Made (Nearly) Optimal. PODC 2019: 107-116 - [c19]Oren Barkan, Noam Koenigstein, Eylon Yogev, Ori Katz:
CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations. RecSys 2019: 228-236 - [c18]Merav Parter, Eylon Yogev:
Low Congestion Cycle Covers and Their Applications. SODA 2019: 1673-1692 - [c17]Merav Parter, Eylon Yogev:
Distributed Algorithms Made Secure: A Graph Theoretic Approach. SODA 2019: 1693-1710 - [c16]Christoph Lenzen, Merav Parter, Eylon Yogev:
Parallel Balanced Allocations: The Heavily Loaded Case. SPAA 2019: 313-322 - [i29]Christoph Lenzen, Merav Parter, Eylon Yogev:
Parallel Balanced Allocations: The Heavily Loaded Case. CoRR abs/1904.07532 (2019) - [i28]Omri Ben-Eliezer, Eylon Yogev:
The Adversarial Robustness of Sampling. CoRR abs/1906.11327 (2019) - [i27]Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR19 (2019) - [i26]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019: 115 (2019) - [i25]Omri Ben-Eliezer, Eylon Yogev:
The Adversarial Robustness of Sampling. IACR Cryptol. ePrint Arch. 2019: 764 (2019) - 2018
- [j4]Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. J. Cryptol. 31(1): 60-100 (2018) - [j3]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory 64(6): 4179-4190 (2018) - [c15]Ilan Komargodski, Eylon Yogev:
On Distributional Collision Resistant Hashing. CRYPTO (2) 2018: 303-327 - [c14]Ilan Komargodski, Moni Naor, Eylon Yogev:
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) 2018: 162-194 - [c13]Ilan Komargodski, Eylon Yogev:
Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation. EUROCRYPT (1) 2018: 259-279 - [c12]Merav Parter, Eylon Yogev:
Congested Clique Algorithms for Graph Spanners. DISC 2018: 40:1-40:18 - [i24]Merav Parter, Eylon Yogev:
Congested Clique Algorithms for Graph Spanners. CoRR abs/1805.05404 (2018) - [i23]Merav Parter, Eylon Yogev:
Low Congestion Cycle Covers and their Applications. CoRR abs/1812.04492 (2018) - [i22]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. CoRR abs/1812.10917 (2018) - [i21]Moni Naor, Merav Parter, Eylon Yogev:
The Power of Distributed Verifiers in Interactive Proofs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i20]Ilan Komargodski, Eylon Yogev:
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. IACR Cryptol. ePrint Arch. 2018: 149 (2018) - [i19]Ilan Komargodski, Eylon Yogev:
On Distributional Collision Resistant Hashing. IACR Cryptol. ePrint Arch. 2018: 480 (2018) - 2017
- [j2]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP. J. Cryptol. 30(2): 444-469 (2017) - [c11]Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev:
Non-Interactive Multiparty Computation Without Correlated Randomness. ASIACRYPT (3) 2017: 181-211 - [c10]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. FOCS 2017: 622-632 - [c9]Pavel Hubácek, Moni Naor, Eylon Yogev:
The Journey from NP to TFNP Hardness. ITCS 2017: 60:1-60:21 - [c8]Pavel Hubácek, Eylon Yogev:
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SODA 2017: 1352-1371 - [i18]Merav Parter, Eylon Yogev:
Distributed Computing Made Secure: A New Cycle Cover Theorem. CoRR abs/1712.01139 (2017) - [i17]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. Electron. Colloquium Comput. Complex. TR17 (2017) - [i16]Ilan Komargodski, Moni Naor, Eylon Yogev:
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. IACR Cryptol. ePrint Arch. 2017: 486 (2017) - [i15]Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev:
Non-Interactive Multiparty Computation without Correlated Randomness. IACR Cryptol. ePrint Arch. 2017: 871 (2017) - [i14]Merav Parter, Eylon Yogev:
Distributed Computing Made Secure: A New Cycle Cover Theorem. IACR Cryptol. ePrint Arch. 2017: 1182 (2017) - 2016
- [c7]Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev:
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption. CRYPTO (2) 2016: 491-520 - [c6]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. TCC (B2) 2016: 485-514 - [i13]Oren Barkan, Noam Koenigstein, Eylon Yogev:
The Deep Journey from Content to Collaborative Filtering. CoRR abs/1611.00384 (2016) - [i12]Pavel Hubácek, Moni Naor, Eylon Yogev:
The Journey from NP to TFNP Hardness. Electron. Colloquium Comput. Complex. TR16 (2016) - [i11]Pavel Hubácek, Eylon Yogev:
Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. Electron. Colloquium Comput. Complex. TR16 (2016) - [i10]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. Electron. Colloquium Comput. Complex. TR16 (2016) - [i9]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. IACR Cryptol. ePrint Arch. 2016: 194 (2016) - [i8]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: 281 (2016) - 2015
- [j1]Moni Naor, Eylon Yogev:
Tight Bounds for Sliding Bloom Filters. Algorithmica 73(4): 652-672 (2015) - [c5]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. CRYPTO (2) 2015: 565-584 - [c4]Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. TCC (2) 2015: 352-377 - [i7]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. IACR Cryptol. ePrint Arch. 2015: 543 (2015) - 2014
- [c3]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP. ASIACRYPT (2) 2014: 254-273 - [c2]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)Perfect Obfuscation. FOCS 2014: 374-383 - [i6]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP from Indistinguishability Obfuscation. CoRR abs/1403.5698 (2014) - [i5]Moni Naor, Eylon Yogev:
Bloom Filters in Adversarial Environments. CoRR abs/1412.8356 (2014) - [i4]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 213 (2014) - [i3]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014: 347 (2014) - [i2]Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2014: 868 (2014) - 2013
- [c1]Moni Naor, Eylon Yogev:
Sliding Bloom Filters. ISAAC 2013: 513-523 - [i1]Moni Naor, Eylon Yogev:
Sliding Bloom Filters. CoRR abs/1304.5872 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
