Ilan Komargodski

Citada per

	Totes	Des de 2020
Citacions	1824	1298
Índex h	24	20
Índex i10	41	38

320

160

240

20132014201520162017201820192020202120222023202420256 22 39 66 71 148 150 193 213 226 318 304 42

Accés públic

Mostra-ho tot

50 articles

3 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Eylon YogevBar-Ilan UniversityCorreu electrònic verificat a biu.ac.il
Rafael PassCornell Tech, Jaobs Technion-Cornell Institute, Technion, Tel-Aviv UniversityCorreu electrònic verificat a cs.cornell.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceCorreu electrònic verificat a weizmann.ac.il
Elaine ShiCarnegie Mellon UniversityCorreu electrònic verificat a cs.cmu.edu
Cody FreitagPostdoc, Northeastern University and Boston UniversityCorreu electrònic verificat a northeastern.edu
Gilad AsharovDepartment of Computer Science, Bar-Ilan UniversityCorreu electrònic verificat a biu.ac.il
Wei-Kai LinUniversity of VirginiaCorreu electrònic verificat a virginia.edu
Gil SegevProfessor of Computer Science, Hebrew UniversityCorreu electrònic verificat a cs.stanford.edu
Ran RazPrinceton UniversityCorreu electrònic verificat a princeton.edu
Brent WatersUniversity of Texas at AustinCorreu electrònic verificat a cs.utexas.edu
PRATISH DATTAScientist @ Cryptography and Information Security (CIS) Laboratories, NTT Research, Inc.Correu electrònic verificat a ntt-research.com
Zvika BrakerskiWeizmann Institute of ScienceCorreu electrònic verificat a weizmann.ac.il
Tal MoranIDC HerzliyaCorreu electrònic verificat a idc.ac.il
Kartik NayakDuke UniversityCorreu electrònic verificat a cs.duke.edu
Alon RosenBocconi UniversityCorreu electrònic verificat a unibocconi.it
Daniel WichsNortheastern University, ProfessorCorreu electrònic verificat a ccs.neu.edu
Avishay TalUC BerkeleyCorreu electrònic verificat a berkeley.edu
Ashrujit GhoshalCarnegie Mellon UniversityCorreu electrònic verificat a cs.cmu.edu
Siyao GUONYU ShanghaiCorreu electrònic verificat a nyu.edu
Aayush JainAssistant Professor, Carnegie Mellon UniversityCorreu electrònic verificat a andrew.cmu.edu

Segueix

Ilan Komargodski

Hebrew University

Correu electrònic verificat a cs.huji.ac.il - Pàgina d'inici

Cryptography Complexity Security


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
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	162	2022
Continuous verifiable delay functions N Ephraim, C Freitag, I Komargodski, R Pass Annual International Conference on the Theory and Applications of …, 2020	112	2020
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	97*	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	83*	2022
Secret-sharing for NP I Komargodski, M Naor, E Yogev Journal of Cryptology 30 (2), 444-469, 2017	76	2017
How to share a secret, infinitely I Komargodski, M Naor, E Yogev IEEE Transactions on Information Theory 64 (6), 4179-4190, 2017	67	2017
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	67*	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	66	2019
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	63*	2021
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	60	2021
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	60	2017
Be adaptive, avoid overcommitting Z Jafargholi, C Kamath, K Klein, I Komargodski, K Pietrzak, D Wichs Annual International Cryptology Conference, 133-163, 2017	59	2017
From Minicrypt to Obfustopia via private-key functional encryption I Komargodski, G Segev Journal of Cryptology 33 (2), 406-458, 2020	57	2020
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	52	2018
Evolving secret sharing: dynamic thresholds and robustness I Komargodski, A Paskin-Cherniavsky Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017	49	2017
Threshold secret sharing requires a linear-size alphabet A Bogdanov, S Guo, I Komargodski Theory of Computing 16 (1), 1-18, 2020	45*	2020
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	38	2018
Average-case lower bounds for formula size I Komargodski, R Raz Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing …, 2013	38	2013
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	35	2018
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	32	2019

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors