Eylon Yogev
Eylon Yogev
Technion
Verified email at weizmann.ac.il - Homepage
TitleCited byYear
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
472014
Tight bounds for sliding bloom filters
M Naor, E Yogev
Algorithmica 73 (4), 652-672, 2015
29*2015
Secret-sharing for NP
I Komargodski, M Naor, E Yogev
Journal of Cryptology 30 (2), 444-469, 2017
282017
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
25*2016
Hardness of continuous local search: Query complexity and cryptographic lower bounds
P Hubáček, E Yogev
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
242017
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), 34, 2019
212019
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
212018
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
162018
The journey from NP to TFNP hardness
P Hubácek, M Naor, E Yogev
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017
162017
Bloom filters in adversarial environments
M Naor, E Yogev
Annual Cryptology Conference, 565-584, 2015
152015
How to share a secret, infinitely
I Komargodski, M Naor, E Yogev
Theory of Cryptography Conference, 485-514, 2016
122016
Another step towards realizing random oracles: non-malleable point obfuscation
I Komargodski, E Yogev
Annual International Conference on the Theory and Applications of …, 2018
72018
Low congestion cycle covers and their applications
M Parter, E Yogev
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
62019
The Power of Distributed Verifiers in Interactive Proofs
M Naor, M Parter, E Yogev
arXiv preprint arXiv:1812.10917, 2018
62018
On distributional collision resistant hashing
I Komargodski, E Yogev
Annual International Cryptology Conference, 303-327, 2018
62018
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
62017
Congested clique algorithms for graph spanners
M Parter, E Yogev
arXiv preprint arXiv:1805.05404, 2018
52018
Recommender system
N Nice, S Keren, O Folger, U Paquet, S Shlevich, N Koenigstein, E Yogev
US Patent App. 13/400,581, 2013
52013
Distributed computing made secure: A new cycle cover theorem
M Parter, E Yogev
arXiv preprint arXiv:1712.01139, 2017
42017
Distributional Collision Resistance Beyond One-Way Functions
N Bitansky, I Haitner, I Komargodski, E Yogev
Annual International Conference on the Theory and Applications of …, 2019
32019
The system can't perform the operation now. Try again later.
Articles 1–20