Seguir
Ilan Komargodski
Ilan Komargodski
E-mail confirmado em cs.huji.ac.il - Página inicial
Título
Citado por
Citado por
Ano
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
1472022
Continuous verifiable delay functions
N Ephraim, C Freitag, I Komargodski, R Pass
Annual International Conference on the Theory and Applications of …, 2020
1042020
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
95*2018
One-Way Functions and (Im)perfect Obfuscation
I Komargodski, T Moran, M Naor, R Pass, A Rosen, E Yogev
SIAM JOURNAL ON COMPUTING 51 (6), 1769-1795, 2022
81*2022
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
66*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
622019
How to share a secret, infinitely
I Komargodski, M Naor, E Yogev
IEEE Transactions on Information Theory 64 (6), 4179-4190, 2017
592017
From Minicrypt to Obfustopia via private-key functional encryption
I Komargodski, G Segev
Journal of Cryptology 33 (2), 406-458, 2020
572020
Be adaptive, avoid overcommitting
Z Jafargholi, C Kamath, K Klein, I Komargodski, K Pietrzak, D Wichs
Annual International Cryptology Conference, 133-163, 2017
522017
Decentralized multi-authority ABE for DNF s from LWE
P Datta, I Komargodski, B Waters
Annual international conference on the theory and applications of …, 2021
502021
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
502017
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
47*2021
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
452018
Evolving secret sharing: dynamic thresholds and robustness
I Komargodski, A Paskin-Cherniavsky
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
452017
Threshold secret sharing requires a linear-size alphabet
A Bogdanov, S Guo, I Komargodski
Theory of Computing 16 (1), 1-18, 2020
40*2020
Average-case lower bounds for formula size
I Komargodski, R Raz
Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing …, 2013
382013
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
362018
Secret-sharing for NP
I Komargodski, M Naor, E Yogev
Journal of Cryptology 30 (2), 444-469, 2017
362017
Secret-sharing for NP
I Komargodski, M Naor, E Yogev
International Conference on the Theory and Application of Cryptology and …, 2014
362014
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
332018
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20