Hardness Preserving Reductions via Cuckoo Hashing. - Itay Berman; Iftach Haitner; Ilan Komargodski; Moni Naor (Electron. Colloquium Comput. Complex., 2012)

The Spectrum of Small DeMorgan Formulas. - Anat Ganor; Ilan Komargodski; Ran Raz (Electron. Colloquium Comput. Complex., 2012)

Average-Case Lower Bounds for Formula Size. - Ilan Komargodski; Ran Raz (Electron. Colloquium Comput. Complex., 2012)

Improved Average-Case Lower Bounds for DeMorgan Formula Size. - Ilan Komargodski; Ran Raz; Avishay Tal (Electron. Colloquium Comput. Complex., 2013)

Strong Locally Testable Codes with Relaxed Local Decoders. - Oded Goldreich 001; Tom Gur; Ilan Komargodski (Electron. Colloquium Comput. Complex., 2014)

Secret-Sharing for NP from Indistinguishability Obfuscation. - Ilan Komargodski; Moni Naor; Eylon Yogev (IACR Cryptol. ePrint Arch., 2014)

Compressing Communication in Distributed Protocols. - Yael Tauman Kalai; Ilan Komargodski (Electron. Colloquium Comput. Complex., 2015)

Communication with Contextual Uncertainty. - Ilan Komargodski; Pravesh Kothari; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2015)

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting. - Zvika Brakerski; Ilan Komargodski; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2015)

Modern Cryptography Through the Lens of Secret Sharing. - Ilan Komargodski; Mark Zhandry (IACR Cryptol. ePrint Arch., 2015)

Threshold Secret Sharing Requires a Linear Size Alphabet. - Andrej Bogdanov; Siyao Guo; Ilan Komargodski (Electron. Colloquium Comput. Complex., 2016)

How to Share a Secret, Infinitely. - Ilan Komargodski; Moni Naor; Eylon Yogev (Electron. Colloquium Comput. Complex., 2016)

Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). - Boaz Barak; Zvika Brakerski; Ilan Komargodski; Pravesh Kothari (Electron. Colloquium Comput. Complex., 2017)

White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. - Ilan Komargodski; Moni Naor; Eylon Yogev (Electron. Colloquium Comput. Complex., 2017)

Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. - Zvika Brakerski; Aayush Jain; Ilan Komargodski; Alain Passelègue; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

Non-Interactive Multiparty Computation without Correlated Randomness. - Shai Halevi; Yuval Ishai; Abhishek Jain 002; Ilan Komargodski; Amit Sahai; Eylon Yogev (IACR Cryptol. ePrint Arch., 2017)

Be Adaptive, Avoid Overcommitting. - Zahra Jafargholi; Chethan Kamath; Karen Klein; Ilan Komargodski; Krzysztof Pietrzak; Daniel Wichs (IACR Cryptol. ePrint Arch., 2017)

Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. - Ilan Komargodski; Moni Naor; Eylon Yogev (IACR Cryptol. ePrint Arch., 2017)

Evolving Secret Sharing: Dynamic Thresholds and Robustness. - Ilan Komargodski; Anat Paskin-Cherniavsky (IACR Cryptol. ePrint Arch., 2017)

Secret-Sharing for NP. - Ilan Komargodski; Moni Naor; Eylon Yogev (J. Cryptol., 2017)

Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound. - Ilan Komargodski; Ran Raz; Avishay Tal (SIAM J. Comput., 2017)

Negation-limited formulas. - Siyao Guo; Ilan Komargodski (Theor. Comput. Sci., 2017)

Communication with Contextual Uncertainty. - Badih Ghazi; Ilan Komargodski; Pravesh K. Kothari; Madhu Sudan 001 (Comput. Complex., 2018)

A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. - Ilan Komargodski; Ran Raz; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2018)

OptORAMa: Optimal Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Kartik Nayak; Elaine Shi (IACR Cryptol. ePrint Arch., 2018)

Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. - Ilan Komargodski; Eylon Yogev (IACR Cryptol. ePrint Arch., 2018)

On Distributional Collision Resistant Hashing. - Ilan Komargodski; Eylon Yogev (IACR Cryptol. ePrint Arch., 2018)

Cutting-edge cryptography through the lens of secret sharing. - Ilan Komargodski; Mark Zhandry (Inf. Comput., 2018)

Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. - Zvika Brakerski; Ilan Komargodski; Gil Segev 001 (J. Cryptol., 2018)

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. - Ilan Komargodski; Gil Segev 001; Eylon Yogev (J. Cryptol., 2018)

Leakage resilient one-way functions: The auxiliary-input setting. - Ilan Komargodski (Theor. Comput. Sci., 2018)

Instance Complexity and Unlabeled Certificates in the Decision Tree Model. - Tomer Grossman; Ilan Komargodski; Moni Naor (Electron. Colloquium Comput. Complex., 2019)

On Perfect Correctness without Derandomization. - Gilad Asharov; Naomi Ephraim; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Distributional Collision Resistance Beyond One-Way Functions. - Nir Bitansky; Iftach Haitner; Ilan Komargodski; Eylon Yogev (IACR Cryptol. ePrint Arch., 2019)

Continuous Verifiable Delay Functions. - Naomi Ephraim; Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Impossibility of Strong KDM Security with Auxiliary Input. - Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. - Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2019)

Oblivious Parallel Tight Compaction. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Enoch Peserico; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Optimal Oblivious Parallel RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Enoch Peserico; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Non-Malleable Codes for Bounded Polynomial Depth Tampering. - Dana Dachman-Soled; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2020)

Decentralized Multi-Authority ABE for DNFs from LWE. - Pratish Datta; Ilan Komargodski; Brent Waters (IACR Cryptol. ePrint Arch., 2020)

Non-Malleable Time-Lock Puzzles and Applications. - Naomi Ephraim; Cody Freitag; Ilan Komargodski; Rafael Pass (IACR Cryptol. ePrint Arch., 2020)

Secure Massively Parallel Computation for Dishonest Majority. - Rex Fernando; Ilan Komargodski; Yanyi Liu; Elaine Shi (IACR Cryptol. ePrint Arch., 2020)

Lower Bound for Oblivious RAM with Large Cells. - Ilan Komargodski; Wei-Kai Lin (IACR Cryptol. ePrint Arch., 2020)

From Minicrypt to Obfustopia via Private-Key Functional Encryption. - Ilan Komargodski; Gil Segev 001 (J. Cryptol., 2020)

Non-malleable Codes for Bounded Parallel-Time Tampering. - Dana Dachman-Soled; Ilan Komargodski; Rafael Pass (CRYPTO (3), 2021)

Multiparty Reusable Non-Interactive Secure Computation from LWE. - Fabrice Benhamouda; Aayush Jain; Ilan Komargodski; Huijia Lin (IACR Cryptol. ePrint Arch., 2021)

Decentralized Multi-Authority ABE for NC^1 from Computational-BDH. - Pratish Datta; Ilan Komargodski; Brent Waters (IACR Cryptol. ePrint Arch., 2021)

Maliciously-Secure MrNISC in the Plain Model. - Rex Fernando; Aayush Jain; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2021)

log *-Round Game-Theoretically-Fair Leader Election. - Ilan Komargodski; Shin'ichiro Matsuo; Elaine Shi; Ke Wu 001 (CRYPTO (3), 2022)

Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS. - Nimrod Aviram; Benjamin Dowling; Ilan Komargodski; Kenneth G. Paterson; Eyal Ronen; Eylon Yogev (IACR Cryptol. ePrint Arch., 2022)

Fully Adaptive Decentralized Multi-Authority ABE. - Pratish Datta; Ilan Komargodski; Brent Waters (IACR Cryptol. ePrint Arch., 2022)

Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. - Rex Fernando; Yuval Gelles; Ilan Komargodski; Elaine Shi (IACR Cryptol. ePrint Arch., 2022)

Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. - Cody Freitag; Ashrujit Ghoshal; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2022)

The Cost of Statistical Security in Interactive Proofs for Repeated Squaring. - Cody Freitag; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2022)

log*-Round Game-Theoretically-Fair Leader Election. - Ilan Komargodski; Shin'ichiro Matsuo; Elaine Shi; Ke Wu 001 (IACR Cryptol. ePrint Arch., 2022)

Differentially Oblivious Turing Machines. - Ilan Komargodski; Elaine Shi (IACR Cryptol. ePrint Arch., 2022)

SPARKs: Succinct Parallelizable Arguments of Knowledge. - Naomi Ephraim; Cody Freitag; Ilan Komargodski; Rafael Pass (J. ACM, 2022)

On the Complexity of Compressing Obfuscation. - Gilad Asharov; Ilan Komargodski; Rafael Pass; Naomi Sirkin (J. Cryptol., 2022)

One-Way Functions and (Im)perfect Obfuscation. - Ilan Komargodski; Tal Moran; Moni Naor; Rafael Pass; Alon Rosen; Eylon Yogev (SIAM J. Comput., 2022)

The Cost of Statistical Security in Proofs for Repeated Squaring. - Cody Freitag; Ilan Komargodski (ITC, 2023)

On Distributed Randomness Generation in Blockchains. - Ilan Komargodski; Yoav Tamir (CSCML, 2023)

Distributed-Prover Interactive Proofs. - Sourav Das 001; Rex Fernando; Ilan Komargodski; Elaine Shi; Pratik Soni (TCC (1), 2023)

Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency. - Yuval Gelles; Ilan Komargodski (DISC, 2023)

Verifying Groups in Linear Time. - Shai Evra; Shay Gadot; Ohad Klein; Ilan Komargodski (Electron. Colloquium Comput. Complex., 2023)

FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Yehuda Michelson (IACR Cryptol. ePrint Arch., 2023)

Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. - Cody Freitag; Ashrujit Ghoshal; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2023)

Scalable Agreement Protocols with Optimal Optimistic Efficiency. - Yuval Gelles; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2023)

Optimal Load-Balanced Scalable Distributed Agreement. - Yuval Gelles; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2023)

3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. - Atsunori Ichikawa; Ilan Komargodski; Koki Hamada; Ryo Kikuchi; Dai Ikarashi (IACR Cryptol. ePrint Arch., 2023)

New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. - Ohad Klein; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2023)

OptORAMa: Optimal Oblivious RAM. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Kartik Nayak; Enoch Peserico; Elaine Shi (J. ACM, 2023)

Oblivious RAM with Worst-Case Logarithmic Overhead. - Gilad Asharov; Ilan Komargodski; Wei-Kai Lin; Elaine Shi (J. Cryptol., 2023)

Decentralized Multi-authority ABE for sfNC1 from BDH. - Pratish Datta; Ilan Komargodski; Brent Waters (J. Cryptol., 2023)

On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. - Ashrujit Ghoshal; Ilan Komargodski (Comput. Complex., 2023)

Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election. - Rex Fernando; Yuval Gelles; Ilan Komargodski (ITCS, 2024)

Memory Checking Requires Logarithmic Overhead. - Elette Boyle; Ilan Komargodski; Neekon Vafa (Electron. Colloquium Comput. Complex., 2024)

Offline-Online Indifferentiability of Cryptographic Systems. - Ashrujit Ghoshal; Ilan Komargodski; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2024)

On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. - Ohad Klein; Ilan Komargodski; Chenzhi Zhu (IACR Cryptol. ePrint Arch., 2024)

The Complexity of Memory Checking with Covert Security. - Elette Boyle; Ilan Komargodski; Neekon Vafa (IACR Cryptol. ePrint Arch., 2025)

A New Approach for LPN-based Pseudorandom Functions: Low-Depth and Key-Homomorphic. - Youlong Ding; Aayush Jain; Ilan Komargodski (IACR Cryptol. ePrint Arch., 2025)

Reusable Designated Verifier NIZK from Lossy Trapdoor Functions. - Riddhi Ghosal; Ilan Komargodski; Brent Waters (IACR Cryptol. ePrint Arch., 2025)

Proofs of Useful Work from Arbitrary Matrix Multiplication. - Ilan Komargodski; Itamar Schen; Omri Weinstein (IACR Cryptol. ePrint Arch., 2025)

A Logarithmic Lower Bound for Oblivious RAM (For All Parameters). - Ilan Komargodski; Wei-Kai Lin (SIAM J. Comput., 2025)

Proof of Work With External Utilities. - Yogev Bar-On; Ilan Komargodski; Omri Weinstein (CoRR, 2025)