Eylon Yogev
Eylon Yogev
Technion
Verified email at weizmann.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
522014
Secret-sharing for NP
I Komargodski, M Naor, E Yogev
Journal of Cryptology 30 (2), 444-469, 2017
382017
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
372017
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
35*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
292019
Tight bounds for sliding bloom filters
M Naor, E Yogev
Algorithmica 73 (4), 652-672, 2015
26*2015
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
252018
The journey from NP to TFNP hardness
P Hubácek, M Naor, E Yogev
8th Innovations in Theoretical Computer Science Conference (ITCS 2017), 2017
232017
Bloom filters in adversarial environments
M Naor, E Yogev
Annual Cryptology Conference, 565-584, 2015
222015
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
202018
How to share a secret, infinitely
I Komargodski, M Naor, E Yogev
Theory of Cryptography Conference, 485-514, 2016
192016
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
172020
Congested clique algorithms for graph spanners
M Parter, E Yogev
arXiv preprint arXiv:1805.05404, 2018
132018
Low congestion cycle covers and their applications
M Parter, E Yogev
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
102019
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
9*2019
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
92017
Another step towards realizing random oracles: non-malleable point obfuscation
I Komargodski, E Yogev
Annual International Conference on the Theory and Applications of …, 2018
82018
On distributional collision resistant hashing
I Komargodski, E Yogev
Annual International Cryptology Conference, 303-327, 2018
62018
Distributed algorithms made secure: A graph theoretic approach
M Parter, E Yogev
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
52019
Distributed Computing Made Secure: A New Cycle Cover Theorem.
M Parter, E Yogev
IACR Cryptol. ePrint Arch. 2017, 1182, 2017
52017
The system can't perform the operation now. Try again later.
Articles 1–20