Ilan Komargodski
Ilan Komargodski
Verifierad e-postadress på cs.huji.ac.il - Startsida
Titel
Citeras av
Citeras av
År
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
62*2018
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
532014
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
52*2017
OptORAMa: Optimal oblivious RAM
G Asharov, I Komargodski, WK Lin, K Nayak, E Peserico, E Shi
Annual International Conference on the Theory and Applications of …, 2020
412020
Secret-sharing for NP
I Komargodski, M Naor, E Yogev
Journal of Cryptology 30 (2), 444-469, 2017
392017
From Minicrypt to Obfustopia via private-key functional encryption
I Komargodski, G Segev
Journal of Cryptology 33 (2), 406-458, 2020
332020
Average-case lower bounds for formula size
I Komargodski, R Raz
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
312013
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
292019
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
292018
Be adaptive, avoid overcommitting
Z Jafargholi, C Kamath, K Klein, I Komargodski, K Pietrzak, D Wichs
Annual International Cryptology Conference, 133-163, 2017
262017
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
252018
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
24*2019
Threshold Secret Sharing Requires a Linear-Size Alphabet
A Bogdanov, S Guo, I Komargodski
Theory of Computing 16 (1), 1-18, 2020
23*2020
Continuous verifiable delay functions
N Ephraim, C Freitag, I Komargodski, R Pass
Annual International Conference on the Theory and Applications of …, 2020
212020
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
202016
Evolving secret sharing: dynamic thresholds and robustness
I Komargodski, A Paskin-Cherniavsky
Theory of Cryptography Conference, 379-393, 2017
162017
Cutting-edge cryptography through the lens of secret sharing
I Komargodski, M Zhandry
Information and Computation 263, 75-96, 2018
152018
Hardness-Preserving Reductions via Cuckoo Hashing
I Berman, I Haitner, I Komargodski, M Naor
Journal of Cryptology 32 (2), 361-392, 2019
14*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
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20