CIS Lab Team
Ilan Komargodski
Scientist
Ilan Komargodski is a Scientist in the CIS Lab at NTT Research. Prior to joining the company, he earned his Ph.D. in Computer Science in 2017 from The Weizmann Institute of Science. He also spent two years as a postdoctoral researcher at Cornell Tech.
Ilan’s research focuses on foundational aspects of computer science, with an emphasis on cryptography and its interplay with other fields. Most recently, he has been working on designing new cryptographic protocols for secure cloud computation.
Publications
- OptORAMa: Optimal Oblivious RAM
By Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico & Elaine Shi
IACR Cryptol. ePrint Arch. 2023 - On Distributed Randomness Generation in Blockchains
By Ilan Komargodski & Yoav Tamir
CSCML 2023
- Fully adaptive decentralized multi-authority ABE
By Pratish Datta, Ilan Komargodski & Brent Waters
EUROCRYPT 2023
- Maliciously-secure mrnisc in the plain model
By Rex Fernando, Aayush Jain & Ilan Komargodski
EUROCRYPT 2023
Oblivious RAM with worst-case logarithmic overhead
By Gilad Asharov, Ilan Komargodski, Wei-Kai Lin & Elaine Shi
IACR Cryptol. ePrint Arch. 2023
Decentralized Multi-authority ABE for NC1 from BDH
By Pratish Datta, Ilan Komargodski & Brent Waters
Journal of Cryptology 2023
Optimal Load-Balanced Scalable Distributed Agreement
By Yuval Gelles & Ilan Komargodski
IACR Cryptol. ePrint Arch. 2023
The Cost of Statistical Security in Proofs for Repeated Squaring
By Cody Freitag & Ilan Komargodski
ITC 2023
New Bounds on the Local Leakage Resilience of Shamir’s Secret Sharing Scheme
By Ohad Klein & Ilan Komargodski
IACR Cryptol. ePrint Arch. 2023
Scalable Agreement Protocols with Optimal Optimistic Efficiency
By Yuval Gelles & Ilan Komargodski
IACR Cryptol. ePrint Arch. 2023
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient
By Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi & Dai Ikarashi
IACR Cryptol. ePrint Arch. 2023
- log*-Round Game-Theoretically-Fair Leader Election
By Ilan Komargodski, Shin’ichiro Matsuo, Elaine Shi & Ke Wu
CRYPTO 2022
- The Cost of Statistical Security in Interactive Proofs for Repeated Squaring
By Ilan Komargodski & Cody Freitag
IACR Cryptol. ePrint Arch. 2022
- Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS
By Ilan Komargodski, Nimrod Aviram, Benjamin Dowling, Kenneth G Paterson, Eyal Ronen & Eylon Yogev
IACR Cryptol. ePrint Arch. 2022
- On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing
By Ilan Komargodski & Ashrujit Ghoshal
CRYPTO 2022
Optimal Oblivious Parallel RAM
By Ilan Komargodski, Gilad Asharov, Wei-Kai Lin, Enoch Peserico & Elaine ShiSODA 2022
One-Way Functions and (Im) Perfect Obfuscation
By Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen & Eylon YogevSIAM Journal on Computing 2022
On the Complexity of Compressing Obfuscation
By Ilan Komargodski, Gilad Asharov, Rafael Pass & Naomi SirkinJournal of Cryptology 2022
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions
By Ilan Komargodski, Rex Fernando, Yuval Gelles & Elaine ShiCRYPTO 2022
Time-space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions
By Ilan Komargodski, Cody Freitag & Ashrujit GhoshalCRYPTO 2022
- Non-malleable Time-lock Puzzles and Applications
By Ilan Komargodski, Cody Freitag, Rafael Pass & Naomi Sirkin
TCC 2021
- Multiparty Reusable Non-interactive Secure Computation from LWE
By Ilan Komargodski, Fabrice Benhamouda, Aayush Jain & Huijia Lin
EUROCRYPT 2021
Decentralized Multi-authority ABE for DNFs from LWE
By Ilan Komargodski, Pratish Datta & Brent WatersEUROCRYPT 2021
Oblivious RAM with Worst-Case Logarithmic Overhead
By Ilan Komargodski, Gilad Asharov, Wei-Kai Lin & Elaine ShiCRYPTO 2021
A Logarithmic Lower Bound for Oblivious RAM (for all parameters)
By Ilan Komargodski & Wei-Kai LinCRYPTO 2021
Decentralized Multi-Authority ABE for NC^ 1 from Computational-BDH
By Ilan Komargodski, Pratish Datta & Brent WatersIACR Cryptol. ePrint Arch. 2021
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols
By Ilan Komargodski, Yael Tauman Kalai & Ran RazComb. 2021
Non-malleable Codes for Bounded Parallel-Time Tampering
By Ilan Komargodski, Dana Dachman-Soled & Rafael PassCRYPTO 2021
Differentially Oblivious Turing Machines
By Ilan Komargodski & Elaine ShiITCS 2021
- Non-malleable Time-lock Puzzles and Applications
Secure Massively Parallel Computation for Dishonest Majority
By Ilan Komargodski, Rex Fernando, Yanyi Liu & Elaine ShiTCC 2020
Impossibility of Strong KDM Security with Auxiliary Input
By Ilan Komargodski, Cody Freitag & Rafael PassSCN 2020
OptORAMa: Optimal Oblivious RAM
By Ilan Komargodski, Gilad Asharov, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, & Elaine ShiEUROCRYPT 2020
SPARKs: Succinct Parallelizable Arguments of Knowledge
By Ilan Komargodski, Naomi Ephraim, Cody Freitag & Rafael PassEUROCRYPT 2020
Oblivious Parallel Tight Compaction
By Ilan Komargodski, Gilad Asharov, Wei-Kai Lin, Enoch Peserico & Elaine ShiITC 2020
Continuous Verifiable Delay Functions
By Ilan Komargodski, Naomi Ephraim, Cody Freitag & Rafael PassEUROCRYPT 2020
Instance Complexity and Unlabeled Certificates in the Decision Tree Model
By Ilan Komargodski, Tomer Grossman & Moni NaorITCS 2020
Impossibility of Strong KDM Security with Auxiliary Input
By Ilan Komargodski, Cody Freitag & Rafael PassSCN 2020
On Perfect Correctness Without Derandomization
By Ilan Komargodski, Gilad Asharov, Naomi Ephraim & Rafael PassIACR Cryptol. ePrint Arch 2019
- Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
By Ilan Komargodski, Cody Freitag & Rafael Pass
CRYPTO 2019
Distributional Collision Resistance Beyond One-Way Functions
By Ilan Komargodski, Nir Bitansky, Iftach Haitner & Eylon YogevEUROCRYPT 2019
Non-trivial Witness Encryption and Null-iO from Standard Assumptions
By Ilan Komargodski, Zvika Brakerski, Aayush Jain, Alain Passelègue & Daniel WichsSCN 2018
On Distributional Collision Resistant Hashing
By Ilan Komargodski & Eylon YogevCRYPTO 2018
On the Complexity of Compressing Obfuscation
By Ilan Komargodski, Gilad Asharov, Rafael Pass & Naomi SirkinCRYPTO 2018
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions
By Ilan Komargodski, Moni Naor & Eylon YogevEUROCRYPT 2018
Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation
By Ilan Komargodski & Eylon YogevEUROCRYPT 2018
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)
By Ilan Komargodski, Boaz Barak, Zvika Brakerski & Pravesh K. KothariEUROCRYPT 2018
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols
By Ilan Komargodski, Yael Tauman Kalai & Ran RazDISC 2018
Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound
By Ilan Komargodski, Ran Raz & Avishay TalSIAM J. Comput. 2017
Negation-limited formulas
By Ilan Komargodski & Siyao GuoTheor. Comput. Sci. 2017
- Non-Interactive Multiparty Computation Without Correlated Randomness
By Ilan Komargodski, Shai Halevi, Yuval Ishai, Abhishek Jain, Amit Sahai & Eylon Yogev
ASIACRYPT 2017
- Be Adaptive, Avoid Overcommitting
By Ilan Komargodski, Zahra Jafargholi, Chethan Kamath, Karen Klein, Krzysztof Pietrzak & Daniel Wichs
CRYPTO 2017
From Minicrypt to Obfustopia via Private-Key Functional Encryption
By Ilan Komargodski & Gil SegevEUROCRYPT 2017
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing
By Ilan Komargodski, Moni Naor & Eylon YogevFOCS 2017
- Evolving Secret Sharing: Dynamic Thresholds and Robustness
By Ilan Komargodski & Anat Paskin-Cherniavsky
TCC 2017
Communication with Contextual Uncertainty
By Ilan Komargodski, Badih Ghazi, Pravesh Kothari & Madhu SudanSODA 2016
Cutting-Edge Cryptography Through the Lens of Secret Sharing
By Ilan Komargodski & Mark ZhandryTCC 2016
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
By Ilan Komargodski, Zvika Brakerski & Gil SegevEUROCRYPT 2016
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting
By Ilan KomargodskiTCC 2016
How to Share a Secret, Infinitely
By Ilan Komargodski, Moni Naor & Eylon YogevTCC 2016
Threshold Secret Sharing Requires a Linear Size Alphabet
By Ilan Komargodski, Andrej Bogdanov & Siyao GuoTCC 2016
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
By Ilan Komargodski, Gil Segev & Eylon YogevTCC 2015
- Strong Locally Testable Codes with Relaxed Local Decoders
By Ilan Komargodski, Oded Goldreich & Tom Gur
Computational Complexity Conference 2015
- Compressing Communication in Distributed Protocols
By Ilan Komargodski & Yael Tauman Kalai
DISC 2015
- From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting
By Ilan Komargodski, Zvika Brakerski & Gil Segev
IACR Cryptol. ePrint Arch. 2015
One-way Functions and (im)perfect Obfuscation
By Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen & Eylon YogevFOCS 2014
Secret-Sharing for NP
By Ilan Komargodski, Moni Naor & Eylon YogevASIACRYPT 2014
Improved Average-Case Lower Bounds for DeMorgan Formula Size
By Ilan Komargodski, Ran Raz & Avishay TalFOCS 2013
Average-case Lower Bounds for Formula Size
By Ilan Komargodski & Ran RazSTOC 2013
Hardness-Preserving Reductions via Cuckoo Hashing
By Ilan Komargodski, Itay Berman, Iftach Haitner & Moni NaorTCC 2013
The Spectrum of Small DeMorgan Formulas
By Ilan Komargodski, Anat Ganor, Troy Lee &,Ran RazElectron. Colloquium Comput. Complex. 2012
