| 2026 | ESA | Proofs of Useful Work from Arbitrary Matrix Multiplication (Invited Talk). | Ilan Komargodski, Omri Weinstein |
| 2026 | STOC | Sub-linear Secure Broadcast and Applications. | Yuval Gelles, Ilan Komargodski, Merav Parter |
| 2025 | CCS | MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM. | Gilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai Lin |
| 2025 | EuroCrypt | The Complexity of Memory Checking with Covert Security. | Elette Boyle, Ilan Komargodski, Neekon Vafa |
| 2025 | STOC | A New Approach for LPN-Based Pseudorandom Functions: Low-Depth and Key-Homomorphic. | Youlong Ding, Aayush Jain, Ilan Komargodski |
| 2025 | TCC | Offline-Online Indifferentiability of Cryptographic Systems. | Ashrujit Ghoshal, Ilan Komargodski, Gil Segev |
| 2024 | FOCS | Verifying Groups in Linear Time. | Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski |
| 2024 | STOC | Memory Checking Requires Logarithmic Overhead. | Elette Boyle, Ilan Komargodski, Neekon Vafa |
| 2024 | STOC | Optimal Load-Balanced Scalable Distributed Agreement. | Yuval Gelles, Ilan Komargodski |
| 2024 | SCN | Scalable Agreement Protocols with Optimal Optimistic Efficiency. | Yuval Gelles, Ilan Komargodski |
| 2024 | TCC | On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. | Ohad Klein, Ilan Komargodski, Chenzhi Zhu |
| 2023 | CCS | FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. | Gilad Asharov, Ilan Komargodski, Yehuda Michelson |
| 2023 | CRYPTO | New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. | Ohad Klein, Ilan Komargodski |
| 2023 | EuroCrypt | Fully Adaptive Decentralized Multi-Authority ABE. | Pratish Datta, Ilan Komargodski, Brent Waters |
| 2023 | EuroCrypt | Maliciously-Secure MrNISC in the Plain Model. | Rex Fernando, Aayush Jain, Ilan Komargodski |
| 2023 | EuroCrypt | Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. | Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski |
| 2023 | TCC | Distributed-Prover Interactive Proofs. | Sourav Das, Rex Fernando, Ilan Komargodski, Elaine Shi, Pratik Soni |
| 2023 | TCC | 3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. | Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi |
| 2022 | CRYPTO | Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. | Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi |
| 2022 | CRYPTO | Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. | Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski |
| 2022 | CRYPTO | On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgrd Hashing. | Ashrujit Ghoshal, Ilan Komargodski |
| 2022 | CRYPTO | log | Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu |
| 2022 | SODA | Optimal Oblivious Parallel RAM. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi |
| 2021 | CRYPTO | Oblivious RAM with Worst-Case Logarithmic Overhead. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi |
| 2021 | CRYPTO | Non-malleable Codes for Bounded Parallel-Time Tampering. | Dana Dachman-Soled, Ilan Komargodski, Rafael Pass |
| 2021 | CRYPTO | A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). | Ilan Komargodski, Wei-Kai Lin |
| 2021 | EuroCrypt | Multiparty Reusable Non-interactive Secure Computation from LWE. | Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin |
| 2021 | EuroCrypt | Decentralized Multi-authority ABE for DNFs from LWE. | Pratish Datta, Ilan Komargodski, Brent Waters |
| 2021 | TCC | Non-malleable Time-Lock Puzzles and Applications. | Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin |
| 2020 | EuroCrypt | OptORAMa: Optimal Oblivious RAM. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi |
| 2020 | EuroCrypt | SPARKs: Succinct Parallelizable Arguments of Knowledge. | Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass |
| 2020 | EuroCrypt | Continuous Verifiable Delay Functions. | Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass |
| 2020 | SCN | Impossibility of Strong KDM Security with Auxiliary Input. | Cody Freitag, Ilan Komargodski, Rafael Pass |
| 2020 | TCC | Secure Massively Parallel Computation for Dishonest Majority. | Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi |
| 2019 | CRYPTO | Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. | Cody Freitag, Ilan Komargodski, Rafael Pass |
| 2019 | EuroCrypt | Distributional Collision Resistance Beyond One-Way Functions. | Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev |
| 2018 | CRYPTO | On the Complexity of Compressing Obfuscation. | Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass |
| 2018 | CRYPTO | On Distributional Collision Resistant Hashing. | Ilan Komargodski, Eylon Yogev |
| 2018 | EuroCrypt | Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). | Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari |
| 2018 | EuroCrypt | Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2018 | EuroCrypt | Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation. | Ilan Komargodski, Eylon Yogev |
| 2018 | SCN | Non-trivial Witness Encryption and Null-iO from Standard Assumptions. | Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelgue, Daniel Wichs |
| 2017 | ASIACRYPT | Non-Interactive Multiparty Computation Without Correlated Randomness. | Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev |
| 2017 | CRYPTO | Be Adaptive, Avoid Overcommitting. | Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs |
| 2017 | EuroCrypt | From Minicrypt to Obfustopia via Private-Key Functional Encryption. | Ilan Komargodski, Gil Segev |
| 2017 | FOCS | White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2017 | TCC | Evolving Secret Sharing: Dynamic Thresholds and Robustness. | Ilan Komargodski, Anat Paskin-Cherniavsky |
| 2016 | EuroCrypt | Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. | Zvika Brakerski, Ilan Komargodski, Gil Segev |
| 2016 | SODA | Communication with Contextual Uncertainty. | Badih Ghazi, Ilan Komargodski, Pravesh Kothari, Madhu Sudan |
| 2016 | TCC | Threshold Secret Sharing Requires a Linear Size Alphabet. | Andrej Bogdanov, Siyao Guo, Ilan Komargodski |
| 2016 | TCC | Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. | Ilan Komargodski |
| 2016 | TCC | How to Share a Secret, Infinitely. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2016 | TCC | Cutting-Edge Cryptography Through the Lens of Secret Sharing. | Ilan Komargodski, Mark Zhandry |
| 2015 | TCC | Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. | Ilan Komargodski, Gil Segev, Eylon Yogev |
| 2014 | ASIACRYPT | Secret-Sharing for NP. | Ilan Komargodski, Moni Naor, Eylon Yogev |
| 2014 | FOCS | One-Way Functions and (Im)Perfect Obfuscation. | Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev |
| 2013 | FOCS | Improved Average-Case Lower Bounds for DeMorgan Formula Size. | Ilan Komargodski, Ran Raz, Avishay Tal |
| 2013 | STOC | Average-case lower bounds for formula size. | Ilan Komargodski, Ran Raz |
| 2013 | TCC | Hardness Preserving Reductions via Cuckoo Hashing. | Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor |