none

Ilan Komargodski

School of Computer Science and Engineering
Hebrew University of Jerusalm
ilank@cs.huji.ac.il
Office: Rothberg A-533





About

I am a faculty member in the School of Computer Science and Engineering at the Hebrew University of Jerusalem. I am interested in various aspects of foundations of computer science with an emphasis on cryptography. Previously, I was a postdoctoral researcher at Cornell Tech, hosted by Prof. Rafael Pass and Prof. Elaine Shi. Priori to that, I completed my Ph.D. at the Weizmann Institute of Science, where I was fortunate to have Prof. Moni Naor as my advisor. I received my M.Sc. from the Weizmann Institute under the guidance of Prof. Ran Raz.

Students

Wei-Kai Lin (Intern, Jun. '20 -- Aug. '20) Aayush Jain (Intern, May. '20 -- Sep. '20) Rex Fernando (Intern, Jan. '20 -- Sep. '20)

Program Committees

PKC 2022 (The 25th International Conference on Practice and Theory of Public-Key Cryptography) TCC 2021 (The 19th Theory of Cryptography Conference) TCC 2020 (The 18th Theory of Cryptography Conference) ITC 2020 (The 1st Information-Theoretic Cryptography Conference) EUROCRYPT 2019 (The 37th International Conference on the Theory and Applications of Cryptographic Techniques) ASIACRYPT 2018 (The 24th Annual International Conference on the Theory and Application of Cryptology and Information Security)

Publications

Optimal Oblivious Parallel RAM
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi Non-Malleable Time-Lock Puzzles and Applications
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
TCC 2021 Oblivious RAM with Worst-Case Logarithmic Overhead
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
CRYPTO 2021 A Logarithmic Lower Bound for Oblivious RAM (for all parameters)
Ilan Komargodski, Wei-Kai Lin
CRYPTO 2021 Non-Malleable Codes for Bounded Polynomial Depth Tampering
Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
CRYPTO 2021 Decentralized Multi-Authority ABE for DNFs from LWE
Pratish Datta, Ilan Komargodski, Brent Waters
EUROCRYPT 2021 Multiparty Reusable Non-Interactive Secure Computation from LWE
Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin
EUROCRYPT 2021 Differentially Oblivious Turing Machines
Ilan Komargodski, Elaine Shi
ITCS 2021 Secure Massively Parallel Computation for Dishonest Majority
Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi
TCC 2020 Oblivious Parallel Tight Compaction
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
ITC 2020 Continuous Verifiable Delay Functions
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
EUROCRYPT 2020 SPARKs: Succinct Parallelizable Arguments of Knowledge
Cody Freitag, Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
EUROCRYPT 2020 OptORAMa: Optimal Oblivious RAM
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi
EUROCRYPT 2020 Instance Complexity and Unlabeled Certificates in the Decision Tree Model
Tomer Grossman, Ilan Komargodski, Moni Naor
ITCS 2020 Impossibility of Strong KDM Security with Auxiliary Input
Cody Freitag, Ilan Komargodski, Rafael Pass
SCN 2020 On Perfect Correctness without Derandomization
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
Cody Freitag, Ilan Komargodski, Rafael Pass
CRYPTO 2019 Distributional Collision Resistance Beyond One-Way Functions
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
EUROCRYPT 2019 A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols
Yael Tauman Kalai, Ilan Komargodski, Ran Raz
DISC 2018
Combinatorica 2021 On Distributional Collision Resistant Hashing
Ilan Komargodski, Eylon Yogev
CRYPTO 2018 On the Complexity of Compressing Obfuscation
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
CRYPTO 2018 Non-Trivial Witness Encryption and Null-iO from Standard Assumptions
Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue,, Daniel Wichs
SCN 2018 Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation
Ilan Komargodski, Eylon Yogev
EUROCRYPT 2018 Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
Ilan Komargodski, Moni Naor, Eylon Yogev
EUROCRYPT 2018 Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)
Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh Kothari
EUROCRYPT 2018 Evolving Secret Sharing: Dynamic Thresholds and Robustness
Ilan Komargodski, Anat Paskin-Cherniavsky
TCC 2017 Non-Interactive Multiparty Computation Without Correlated Randomness
Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev
ASIACRYPT 2017 White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing
Ilan Komargodski, Moni Naor, Eylon Yogev
FOCS 2017
Journal of the ACM (J. ACM) 2019 Be Adaptive, Avoid Overcommitting
Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs
CRYPTO 2017 From Minicrypt to Obfustopia via Private-Key Functional Encryption
Ilan Komargodski, Gil Segev
EUROCRYPT 2017
Journal of Cryptology 2020 How to Share a Secret, Infinitely
Ilan Komargodski, Moni Naor, Eylon Yogev
TCC 2016-B
IEEE Transactions on Information Theory 2017 Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
Ilan Komargodski
TCC 2016-B
Theoretical Computer Science 2018 Threshold Secret Sharing Requires a Linear Size Alphabet
Andrej Bogdanov, Siyao Guo, Ilan Komargodski
TCC 2016-B
Theory of Computing 2020 Multi-Input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
Zvika Brakerski, Ilan Komargodski, Gil Segev
EUROCRYPT 2016
Journal of Cryptology 2017 Cutting-Edge Cryptography Through the Lens of Secret Sharing
Ilan Komargodski, Mark Zhandry
TCC 2016-A
Information and Computation 2018 Communication with Contextual Uncertainty
Badih Ghazi, Ilan Komargodski, Pravesh Kothari, Madhu Sudan
SODA 2016
Computational Complexity 2017 Compressing Communication in Distributed Protocols
Yael Tauman Kalai, Ilan Komargodski
DISC 2015 Negation-Limited Formulas
Siyao Guo, Ilan Komargodski
RANDOM 2015
Theoretical Computer Science 2017 Strong Locally Testable Codes with Relaxed Local Decoders
Oded Goldreich, Tom Gur, Ilan Komargodski
CCC 2015
ACM Transactions on Computation Theory (TOCT) 2019 Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
Ilan Komargodski, Gil Segev, Eylon Yogev
TCC 2015
Journal of Cryptology 2018 One-Way Functions and (Im)perfect Obfuscation
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
FOCS 2014 Secret-Sharing for NP
Ilan Komargodski, Moni Naor, Eylon Yogev
ASIACRYPT 2014
Journal of Cryptology 2016 Hardness Preserving Reductions via Cuckoo Hashing
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
TCC 2013
Journal of Cryptology 2018 On the Noise Stability of Small De Morgan Formulas
Anat Ganor, Ilan Komargodski, Ran Raz, Troy Lee Improved Average-Case Lower Bounds for DeMorgan Formula Size
Ilan Komargodski, Ran Raz, Avishay Tal
FOCS 2013
SIAM Journal on Computing (SICOMP) 2017 Average-Case Lower Bounds for Formula Size
Ilan Komargodski, Ran Raz
STOC 2013

Teaching

Topics in Secure Computation (67892): Fall 2020/21