Ilan Komargodski

Cited by

	All	Since 2018
Citations	1423	1203
h-index	22	19
i10-index	36	34

280

140

210

201320142015201620172018201920202021202220235 23 36 65 74 144 149 187 203 240 275

Public access

View all

41 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Eylon YogevBar-Ilan UniversityVerified email at biu.ac.il
Rafael PassTel-Aviv University, Cornell TechVerified email at cs.cornell.edu
Moni NaorProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Elaine ShiCarnegie Mellon UniversityVerified email at cs.cmu.edu
Cody FreitagPostdoc, Northeastern University and Boston UniversityVerified email at northeastern.edu
Gilad AsharovDepartment of Computer Science, Bar-Ilan UniversityVerified email at biu.ac.il
Wei-Kai LinUniversity of VirginiaVerified email at virginia.edu
Ran RazPrinceton UniversityVerified email at princeton.edu
Gil SegevProfessor of Computer Science, Hebrew UniversityVerified email at cs.stanford.edu
Zvika BrakerskiWeizmann Institute of ScienceVerified email at weizmann.ac.il
Tal MoranIDC HerzliyaVerified email at idc.ac.il
Brent WatersUniversity of Texas at AustinVerified email at cs.utexas.edu
PRATISH DATTAScientist @ Cryptography and Information Security (CIS) Laboratories, NTT Research, Inc.Verified email at ntt-research.com
Alon RosenBocconi UniversityVerified email at unibocconi.it
Kartik NayakDuke UniversityVerified email at cs.duke.edu
Avishay TalUC BerkeleyVerified email at berkeley.edu
Daniel WichsNortheastern University, Associate ProfessorVerified email at ccs.neu.edu
Siyao GUONYU ShanghaiVerified email at nyu.edu
Pravesh K. KothariCarnegie Mellon UniversityVerified email at cs.cmu.edu
Aayush JainAssistant Professor, Carnegie Mellon UniversityVerified email at andrew.cmu.edu

Ilan Komargodski

Hebrew University

Verified email at cs.huji.ac.il - Homepage

Cryptography Complexity Security


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	118	2022
Continuous verifiable delay functions N Ephraim, C Freitag, I Komargodski, R Pass Annual International Conference on the Theory and Applications of …, 2020	94	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	88*	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	77*	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	62*	2017
How to share a secret, infinitely I Komargodski, M Naor, E Yogev IEEE Transactions on Information Theory 64 (6), 4179-4190, 2017	56	2017
From Minicrypt to Obfustopia via private-key functional encryption I Komargodski, G Segev Journal of Cryptology 33 (2), 406-458, 2020	55	2020
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	54	2019
Be adaptive, avoid overcommitting Z Jafargholi, C Kamath, K Klein, I Komargodski, K Pietrzak, D Wichs Annual International Cryptology Conference, 133-163, 2017	44	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	43	2018
Evolving secret sharing: dynamic thresholds and robustness I Komargodski, A Paskin-Cherniavsky Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017	42	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	41*	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	38	2017
Secret-Sharing for NP I Komargodski, M Naor, E Yogev Advances in Cryptology–ASIACRYPT 2014: 20th International Conference on the …, 2014	37	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	37	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	36	2018
Threshold Secret Sharing Requires a Linear-Size Alphabet A Bogdanov, S Guo, I Komargodski Theory of Computing 16 (1), 1-18, 2020	34*	2020
Decentralized multi-authority ABE for DNFs from LWE P Datta, I Komargodski, B Waters Annual international conference on the theory and applications of …, 2021	33	2021
Secret-sharing for NP I Komargodski, M Naor, E Yogev Journal of Cryptology 30 (2), 444-469, 2017	33	2017
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	32	2018

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors