| A framework for adversarially robust streaming algorithms O Ben-Eliezer, R Jayaram, DP Woodruff, E Yogev ACM Journal of the ACM (JACM) 69 (2), 1-33, 2022 | 76 | 2022 |
| Hardness of continuous local search: Query complexity and cryptographic lower bounds P Hubácek, E Yogev SIAM Journal on Computing 49 (6), 1128-1172, 2020 | 76 | 2020 |
| One-way functions and (im) perfect obfuscation I Komargodski, T Moran, M Naor, R Pass, A Rosen, E Yogev 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 374-383, 2014 | 75 | 2014 |
| CB2CF: a neural multiview content-to-collaborative filtering model for completely cold item recommendations O Barkan, N Koenigstein, E Yogev, O Katz Proceedings of the 13th ACM Conference on Recommender Systems, 228-236, 2019 | 68 | 2019 |
| White-box vs. black-box complexity of search problems: Ramsey and graph property testing I Komargodski, M Naor, E Yogev Journal of the ACM (JACM) 66 (5), 1-28, 2019 | 54 | 2019 |
| Universal constructions and robust combiners for indistinguishability obfuscation and witness encryption P Ananth, A Jain, M Naor, A Sahai, E Yogev Annual International Cryptology Conference, 491-520, 2016 | 48* | 2016 |
| Bloom filters in adversarial environments M Naor, E Yogev Annual Cryptology Conference, 565-584, 2015 | 48 | 2015 |
| Adversarial laws of large numbers and optimal regret in online classification N Alon, O Ben-Eliezer, Y Dagan, S Moran, M Naor, E Yogev Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 45 | 2021 |
| How to share a secret, infinitely I Komargodski, M Naor, E Yogev Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016 | 45 | 2016 |
| The power of distributed verifiers in interactive proofs M Naor, M Parter, E Yogev Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 44 | 2020 |
| Collision resistant hashing for paranoids: Dealing with multiple collisions I Komargodski, M Naor, E Yogev Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference …, 2018 | 43 | 2018 |
| Tight bounds for sliding bloom filters M Naor, E Yogev Algorithmica 73 (4), 652-672, 2015 | 39* | 2015 |
| Non-interactive multiparty computation without correlated randomness S Halevi, Y Ishai, A Jain, I Komargodski, A Sahai, E Yogev International Conference on the Theory and Application of Cryptology and …, 2017 | 38 | 2017 |
| Secret-Sharing for NP I Komargodski, M Naor, E Yogev Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014 | 37 | 2014 |
| The adversarial robustness of sampling O Ben-Eliezer, E Yogev Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020 | 36 | 2020 |
| The journey from NP to TFNP hardness P Hubácek, M Naor, E Yogev 8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017 | 35 | 2017 |
| Secret-sharing for NP I Komargodski, M Naor, E Yogev Journal of Cryptology 30 (2), 444-469, 2017 | 33 | 2017 |
| Functional Encryption for Randomized unctionalities in the Private-Key Setting from Minimal Assumptions I Komargodski, G Segev, E Yogev Journal of Cryptology 31 (1), 60-100, 2018 | 32 | 2018 |
| Congested clique algorithms for graph spanners M Parter, E Yogev arXiv preprint arXiv:1805.05404, 2018 | 28 | 2018 |
| On distributional collision resistant hashing I Komargodski, E Yogev Annual International Cryptology Conference, 303-327, 2018 | 20 | 2018 |
