| OptORAMa: Optimal oblivious ram G Asharov, I Komargodski, WK Lin, K Nayak, E Peserico, E Shi Journal of the ACM 70 (1), 1-70, 2022 | 95 | 2022 |
| Multi-input functional encryption in the private-key setting: Stronger security from weaker assumptions Z Brakerski, I Komargodski, G Segev Journal of Cryptology 31 (2), 434-520, 2018 | 86* | 2018 |
| Continuous verifiable delay functions N Ephraim, C Freitag, I Komargodski, R Pass Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020 | 73 | 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 (FOCS …, 2014 | 72 | 2014 |
| Improved average-case lower bounds for De Morgan formula size: Matching worst-case lower bound I Komargodski, R Raz, A Tal SIAM Journal on Computing 46 (1), 37-57, 2017 | 60* | 2017 |
| From Minicrypt to Obfustopia via private-key functional encryption I Komargodski, G Segev Journal of Cryptology 33 (2), 406-458, 2020 | 55 | 2020 |
| How to share a secret, infinitely I Komargodski, M Naor, E Yogev IEEE Transactions on Information Theory 64 (6), 4179-4190, 2017 | 46 | 2017 |
| White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing I KOMARGODSKI, M NAOR, E YOGEV Journal of the ACM, 2019 | 45 | 2019 |
| Be adaptive, avoid overcommitting Z Jafargholi, C Kamath, K Klein, I Komargodski, K Pietrzak, D Wichs Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017 | 37 | 2017 |
| 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 | 36 | 2018 |
| Secret-Sharing for NP I Komargodski, M Naor, E Yogev Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014 | 36 | 2014 |
| Average-case lower bounds for formula size I Komargodski, R Raz Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing …, 2013 | 35 | 2013 |
| Limits on low-degree pseudorandom generators (or: Sum-of-Squares meets program obfuscation) B Barak, Z Brakerski, I Komargodski, PK Kothari Annual International Conference on the Theory and Applications of …, 2018 | 34 | 2018 |
| Evolving secret sharing: dynamic thresholds and robustness I Komargodski, A Paskin-Cherniavsky Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017 | 32 | 2017 |
| Threshold Secret Sharing Requires a Linear-Size Alphabet A Bogdanov, S Guo, I Komargodski Theory of Computing 16 (1), 1-18, 2020 | 31* | 2020 |
| Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions I Komargodski, G Segev, E Yogev Journal of Cryptology 31 (1), 60-100, 2018 | 31 | 2018 |
| Non-interactive multiparty computation without correlated randomness S Halevi, Y Ishai, A Jain, I Komargodski, A Sahai, E Yogev Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017 | 31 | 2017 |
| Non-malleable time-lock puzzles and applications C Freitag, I Komargodski, R Pass, N Sirkin Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC …, 2021 | 28* | 2021 |
| Strong locally testable codes with relaxed local decoders O Goldreich, T Gur, I Komargodski ACM Transactions on Computation Theory (TOCT) 11 (3), 1-38, 2019 | 28 | 2019 |
| Secret-sharing for NP I Komargodski, M Naor, E Yogev Journal of Cryptology 30 (2), 444-469, 2017 | 26 | 2017 |
Eylon YogevBar-Ilan UniversityVerified email at biu.ac.il
