Follow
Eylon Yogev
Eylon Yogev
Verified email at biu.ac.il - Homepage
Title
Cited by
Cited by
Year
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
722014
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
622020
Secret-sharing for NP
I Komargodski, M Naor, E Yogev
Journal of Cryptology 30 (2), 444-469, 2017
542017
A framework for adversarially robust streaming algorithms
O Ben-Eliezer, R Jayaram, DP Woodruff, E Yogev
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI symposium on principles of …, 2020
472020
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
45*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
45*2016
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
422019
How to share a secret, infinitely
I Komargodski, M Naor, E Yogev
Theory of Cryptography Conference, 485-514, 2016
412016
Bloom filters in adversarial environments
M Naor, E Yogev
Annual Cryptology Conference, 565-584, 2015
412015
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
352020
Collision resistant hashing for paranoids: Dealing with multiple collisions
I Komargodski, M Naor, E Yogev
Annual International Conference on the Theory and Applications of …, 2018
342018
Tight bounds for sliding bloom filters
M Naor, E Yogev
Algorithmica 73 (4), 652-672, 2015
34*2015
The journey from NP to TFNP hardness
P Hubácek, M Naor, E Yogev
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017
332017
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
282018
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
282017
The adversarial robustness of sampling
O Ben-Eliezer, E Yogev
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020
272020
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
262021
Congested clique algorithms for graph spanners
M Parter, E Yogev
arXiv preprint arXiv:1805.05404, 2018
252018
Low congestion cycle covers and their applications
M Parter, E Yogev
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
162019
On distributional collision resistant hashing
I Komargodski, E Yogev
Annual International Cryptology Conference, 303-327, 2018
152018
The system can't perform the operation now. Try again later.
Articles 1–20