Ilan Komargodski

177 papers A* 12A 10B 1Misc 2Journal 108Unranked 44

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Hawkeye: Reproducing GPU-Level Non-Determinism. CoRR Erez Badash, Dan Boneh, Ilan Komargodski, Megha Srivastava
2026	A	`conf`	Improved Rate for Non-Malleable Codes and Time-Lock Puzzles. ITCS Cody Freitag, Ilan Komargodski, Manu Kondapaneni, Jad Silbak
2026	J	`jnl`	Logarithmic-Depth Pseudorandom Functions from Well-Founded Code-Based Assumptions. IACR Cryptol. ePrint Arch. Youlong Ding, Aayush Jain, Ilan Komargodski
2026	J	`jnl`	Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. J. Cryptol. Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
2025	J	`jnl`	A Logarithmic Lower Bound for Oblivious RAM (For All Parameters). SIAM J. Comput. Ilan Komargodski, Wei-Kai Lin
2025	A*	`conf`	A New Approach for LPN-Based Pseudorandom Functions: Low-Depth and Key-Homomorphic. STOC Youlong Ding, Aayush Jain, Ilan Komargodski
2025	J	`jnl`	A New Approach for LPN-based Pseudorandom Functions: Low-Depth and Key-Homomorphic. IACR Cryptol. ePrint Arch. Youlong Ding, Aayush Jain, Ilan Komargodski
2025	A*	`conf`	MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM. CCS Gilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai Lin
2025	J	`jnl`	MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM. IACR Cryptol. ePrint Arch. Gilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai Lin
2025	J	`jnl`	Memory Checking Requires Logarithmic Overhead. J. ACM Elette Boyle, Ilan Komargodski, Neekon Vafa
2025	—	`conf`	Offline-Online Indifferentiability of Cryptographic Systems. TCC (2) Ashrujit Ghoshal, Ilan Komargodski, Gil Segev
2025	J	`jnl`	Proof of Work With External Utilities. CoRR Yogev Bar-On, Ilan Komargodski, Omri Weinstein
2025	J	`jnl`	Proofs of Useful Work from Arbitrary Matrix Multiplication. CoRR Ilan Komargodski, Itamar Schen, Omri Weinstein
2025	J	`jnl`	Proofs of Useful Work from Arbitrary Matrix Multiplication. IACR Cryptol. ePrint Arch. Ilan Komargodski, Itamar Schen, Omri Weinstein
2025	J	`jnl`	Reusable Designated Verifier NIZK from Lossy Trapdoor Functions. IACR Cryptol. ePrint Arch. Riddhi Ghosal, Ilan Komargodski, Brent Waters
2025	—	`conf`	The Complexity of Memory Checking with Covert Security. EUROCRYPT (5) Elette Boyle, Ilan Komargodski, Neekon Vafa
2025	J	`jnl`	The Complexity of Memory Checking with Covert Security. IACR Cryptol. ePrint Arch. Elette Boyle, Ilan Komargodski, Neekon Vafa
2024	A*	`conf`	Memory Checking Requires Logarithmic Overhead. STOC Elette Boyle, Ilan Komargodski, Neekon Vafa
2024	J	`jnl`	Memory Checking Requires Logarithmic Overhead. Electron. Colloquium Comput. Complex. Elette Boyle, Ilan Komargodski, Neekon Vafa
2024	J	`jnl`	Memory Checking Requires Logarithmic Overhead. IACR Cryptol. ePrint Arch. Elette Boyle, Ilan Komargodski, Neekon Vafa
2024	J	`jnl`	Offline-Online Indifferentiability of Cryptographic Systems. IACR Cryptol. ePrint Arch. Ashrujit Ghoshal, Ilan Komargodski, Gil Segev
2024	—	`conf`	On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. TCC (1) Ohad Klein, Ilan Komargodski, Chenzhi Zhu
2024	J	`jnl`	On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols. IACR Cryptol. ePrint Arch. Ohad Klein, Ilan Komargodski, Chenzhi Zhu
2024	A*	`conf`	Optimal Load-Balanced Scalable Distributed Agreement. STOC Yuval Gelles, Ilan Komargodski
2024	—	`conf`	Scalable Agreement Protocols with Optimal Optimistic Efficiency. SCN (1) Yuval Gelles, Ilan Komargodski
2024	A	`conf`	Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election. ITCS Rex Fernando, Yuval Gelles, Ilan Komargodski
2024	A*	`conf`	Verifying Groups in Linear Time. FOCS Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski
2023	—	`conf`	3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. TCC (1) Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi
2023	J	`jnl`	3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. IACR Cryptol. ePrint Arch. Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi
2023	A	`conf`	Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency. DISC Yuval Gelles, Ilan Komargodski
2023	J	`jnl`	Decentralized Multi-authority ABE for sfNC J. Cryptol. Pratish Datta, Ilan Komargodski, Brent Waters
2023	—	`conf`	Distributed-Prover Interactive Proofs. TCC (1) Sourav Das, Rex Fernando, Ilan Komargodski, Elaine Shi, Pratik Soni
2023	—	`conf`	Fully Adaptive Decentralized Multi-Authority ABE. EUROCRYPT (3) Pratish Datta, Ilan Komargodski, Brent Waters
2023	A*	`conf`	FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. CCS Gilad Asharov, Ilan Komargodski, Yehuda Michelson
2023	J	`jnl`	FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. IACR Cryptol. ePrint Arch. Gilad Asharov, Ilan Komargodski, Yehuda Michelson
2023	—	`conf`	Maliciously-Secure MrNISC in the Plain Model. EUROCRYPT (2) Rex Fernando, Aayush Jain, Ilan Komargodski
2023	—	`conf`	New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. CRYPTO (1) Ohad Klein, Ilan Komargodski
2023	J	`jnl`	New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. IACR Cryptol. ePrint Arch. Ohad Klein, Ilan Komargodski
2023	J	`jnl`	Oblivious RAM with Worst-Case Logarithmic Overhead. J. Cryptol. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
2023	—	`conf`	On Distributed Randomness Generation in Blockchains. CSCML Ilan Komargodski, Yoav Tamir
2023	J	`jnl`	On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. Comput. Complex. Ashrujit Ghoshal, Ilan Komargodski
2023	J	`jnl`	OptORAMa: Optimal Oblivious RAM. J. ACM Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi
2023	J	`jnl`	Optimal Load-Balanced Scalable Distributed Agreement. IACR Cryptol. ePrint Arch. Yuval Gelles, Ilan Komargodski
2023	—	`conf`	Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. EUROCRYPT (4) Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
2023	J	`jnl`	Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. IACR Cryptol. ePrint Arch. Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
2023	J	`jnl`	Scalable Agreement Protocols with Optimal Optimistic Efficiency. IACR Cryptol. ePrint Arch. Yuval Gelles, Ilan Komargodski
2023	A	`conf`	The Cost of Statistical Security in Proofs for Repeated Squaring. ITC Cody Freitag, Ilan Komargodski
2023	J	`jnl`	Verifying Groups in Linear Time. Electron. Colloquium Comput. Complex. Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski
2022	J	`jnl`	Differentially Oblivious Turing Machines. IACR Cryptol. ePrint Arch. Ilan Komargodski, Elaine Shi
2022	J	`jnl`	Fully Adaptive Decentralized Multi-Authority ABE. IACR Cryptol. ePrint Arch. Pratish Datta, Ilan Komargodski, Brent Waters
2022	—	`conf`	Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. CRYPTO (1) Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi
2022	J	`jnl`	Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. IACR Cryptol. ePrint Arch. Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi
2022	J	`jnl`	On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgard Hashing. IACR Cryptol. ePrint Arch. Ashrujit Ghoshal, Ilan Komargodski
2022	—	`conf`	On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. CRYPTO (3) Ashrujit Ghoshal, Ilan Komargodski
2022	J	`jnl`	On the Complexity of Compressing Obfuscation. J. Cryptol. Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin
2022	J	`jnl`	One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2022	A*	`conf`	Optimal Oblivious Parallel RAM. SODA Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
2022	J	`jnl`	Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS. IACR Cryptol. ePrint Arch. Nimrod Aviram, Benjamin Dowling, Ilan Komargodski, Kenneth G. Paterson, Eyal Ronen, Eylon Yogev
2022	J	`jnl`	SPARKs: Succinct Parallelizable Arguments of Knowledge. J. ACM Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
2022	J	`jnl`	The Cost of Statistical Security in Interactive Proofs for Repeated Squaring. IACR Cryptol. ePrint Arch. Cody Freitag, Ilan Komargodski
2022	—	`conf`	Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. CRYPTO (3) Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
2022	J	`jnl`	Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. IACR Cryptol. ePrint Arch. Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
2022	—	`conf`	log CRYPTO (3) Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu
2022	J	`jnl`	log*-Round Game-Theoretically-Fair Leader Election. IACR Cryptol. ePrint Arch. Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu
2021	—	`conf`	A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). CRYPTO (4) Ilan Komargodski, Wei-Kai Lin
2021	J	`jnl`	A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols. Comb. Yael Tauman Kalai, Ilan Komargodski, Ran Raz
2021	J	`jnl`	Decentralized Multi-Authority ABE for NC^1 from Computational-BDH. IACR Cryptol. ePrint Arch. Pratish Datta, Ilan Komargodski, Brent Waters
2021	—	`conf`	Decentralized Multi-authority ABE for DNFs from LWE. EUROCRYPT (1) Pratish Datta, Ilan Komargodski, Brent Waters
2021	A	`conf`	Differentially Oblivious Turing Machines. ITCS Ilan Komargodski, Elaine Shi
2021	J	`jnl`	Distributional Collision Resistance Beyond One-Way Functions. CoRR Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2021	J	`jnl`	Hardness-Preserving Reductions via Cuckoo Hashing. CoRR Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2021	J	`jnl`	Maliciously-Secure MrNISC in the Plain Model. IACR Cryptol. ePrint Arch. Rex Fernando, Aayush Jain, Ilan Komargodski
2021	J	`jnl`	Multiparty Reusable Non-Interactive Secure Computation from LWE. IACR Cryptol. ePrint Arch. Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin
2021	—	`conf`	Multiparty Reusable Non-interactive Secure Computation from LWE. EUROCRYPT (2) Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin
2021	—	`conf`	Non-malleable Codes for Bounded Parallel-Time Tampering. CRYPTO (3) Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
2021	—	`conf`	Non-malleable Time-Lock Puzzles and Applications. TCC (3) Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin
2021	—	`conf`	Oblivious RAM with Worst-Case Logarithmic Overhead. CRYPTO (4) Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
2021	J	`jnl`	Oblivious RAM with Worst-Case Logarithmic Overhead. IACR Cryptol. ePrint Arch. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
2020	—	`conf`	Continuous Verifiable Delay Functions. EUROCRYPT (3) Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
2020	J	`jnl`	Decentralized Multi-Authority ABE for DNFs from LWE. IACR Cryptol. ePrint Arch. Pratish Datta, Ilan Komargodski, Brent Waters
2020	J	`jnl`	From Minicrypt to Obfustopia via Private-Key Functional Encryption. J. Cryptol. Ilan Komargodski, Gil Segev
2020	Misc	`conf`	Impossibility of Strong KDM Security with Auxiliary Input. SCN Cody Freitag, Ilan Komargodski, Rafael Pass
2020	A	`conf`	Instance Complexity and Unlabeled Certificates in the Decision Tree Model. ITCS Tomer Grossman, Ilan Komargodski, Moni Naor
2020	J	`jnl`	Lower Bound for Oblivious RAM with Large Cells. IACR Cryptol. ePrint Arch. Ilan Komargodski, Wei-Kai Lin
2020	J	`jnl`	Non-Malleable Codes for Bounded Polynomial Depth Tampering. IACR Cryptol. ePrint Arch. Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
2020	J	`jnl`	Non-Malleable Time-Lock Puzzles and Applications. IACR Cryptol. ePrint Arch. Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
2020	A	`conf`	Oblivious Parallel Tight Compaction. ITC Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
2020	J	`jnl`	Oblivious Parallel Tight Compaction. IACR Cryptol. ePrint Arch. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
2020	—	`conf`	OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi
2020	J	`jnl`	Optimal Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
2020	—	`conf`	SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
2020	J	`jnl`	SPARKs: Succinct Parallelizable Arguments of Knowledge. IACR Cryptol. ePrint Arch. Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
2020	—	`conf`	Secure Massively Parallel Computation for Dishonest Majority. TCC (2) Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi
2020	J	`jnl`	Secure Massively Parallel Computation for Dishonest Majority. IACR Cryptol. ePrint Arch. Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi
2020	J	`jnl`	Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory Comput. Andrej Bogdanov, Siyao Guo, Ilan Komargodski
2019	J	`jnl`	Continuous Verifiable Delay Functions. IACR Cryptol. ePrint Arch. Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
2019	—	`conf`	Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2019	J	`jnl`	Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
2019	J	`jnl`	Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2019	J	`jnl`	Impossibility of Strong KDM Security with Auxiliary Input. IACR Cryptol. ePrint Arch. Cody Freitag, Ilan Komargodski, Rafael Pass
2019	J	`jnl`	Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Electron. Colloquium Comput. Complex. Tomer Grossman, Ilan Komargodski, Moni Naor
2019	—	`conf`	Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. CRYPTO (3) Cody Freitag, Ilan Komargodski, Rafael Pass
2019	J	`jnl`	Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. IACR Cryptol. ePrint Arch. Cody Freitag, Ilan Komargodski, Rafael Pass
2019	J	`jnl`	On Perfect Correctness without Derandomization. IACR Cryptol. ePrint Arch. Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
2019	J	`jnl`	Strong Locally Testable Codes with Relaxed Local Decoders. ACM Trans. Comput. Theory Oded Goldreich, Tom Gur, Ilan Komargodski
2019	J	`jnl`	White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM Ilan Komargodski, Moni Naor, Eylon Yogev
2018	A	`conf`	A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. DISC Yael Tauman Kalai, Ilan Komargodski, Ran Raz
2018	J	`jnl`	A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. Electron. Colloquium Comput. Complex. Ilan Komargodski, Ran Raz, Yael Tauman Kalai
2018	J	`jnl`	Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. IACR Cryptol. ePrint Arch. Ilan Komargodski, Eylon Yogev
2018	—	`conf`	Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation. EUROCRYPT (1) Ilan Komargodski, Eylon Yogev
2018	—	`conf`	Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) Ilan Komargodski, Moni Naor, Eylon Yogev
2018	J	`jnl`	Communication with Contextual Uncertainty. Comput. Complex. Badih Ghazi, Ilan Komargodski, Pravesh K. Kothari, Madhu Sudan
2018	J	`jnl`	Cutting-edge cryptography through the lens of secret sharing. Inf. Comput. Ilan Komargodski, Mark Zhandry
2018	J	`jnl`	Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. J. Cryptol. Ilan Komargodski, Gil Segev, Eylon Yogev
2018	J	`jnl`	How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory Ilan Komargodski, Moni Naor, Eylon Yogev
2018	J	`jnl`	Leakage resilient one-way functions: The auxiliary-input setting. Theor. Comput. Sci. Ilan Komargodski
2018	—	`conf`	Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). EUROCRYPT (2) Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari
2018	J	`jnl`	Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. J. Cryptol. Zvika Brakerski, Ilan Komargodski, Gil Segev
2018	Misc	`conf`	Non-trivial Witness Encryption and Null-iO from Standard Assumptions. SCN Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs
2018	—	`conf`	On Distributional Collision Resistant Hashing. CRYPTO (2) Ilan Komargodski, Eylon Yogev
2018	J	`jnl`	On Distributional Collision Resistant Hashing. IACR Cryptol. ePrint Arch. Ilan Komargodski, Eylon Yogev
2018	—	`conf`	On the Complexity of Compressing Obfuscation. CRYPTO (3) Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
2018	J	`jnl`	On the Complexity of Compressing Obfuscation. IACR Cryptol. ePrint Arch. Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
2018	J	`jnl`	OptORAMa: Optimal Oblivious RAM. IACR Cryptol. ePrint Arch. Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Elaine Shi
2017	—	`conf`	Be Adaptive, Avoid Overcommitting. CRYPTO (1) Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs
2017	J	`jnl`	Be Adaptive, Avoid Overcommitting. IACR Cryptol. ePrint Arch. Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs
2017	J	`jnl`	Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. IACR Cryptol. ePrint Arch. Ilan Komargodski, Moni Naor, Eylon Yogev
2017	—	`conf`	Evolving Secret Sharing: Dynamic Thresholds and Robustness. TCC (2) Ilan Komargodski, Anat Paskin-Cherniavsky
2017	J	`jnl`	Evolving Secret Sharing: Dynamic Thresholds and Robustness. IACR Cryptol. ePrint Arch. Ilan Komargodski, Anat Paskin-Cherniavsky
2017	—	`conf`	From Minicrypt to Obfustopia via Private-Key Functional Encryption. EUROCRYPT (1) Ilan Komargodski, Gil Segev
2017	J	`jnl`	From Minicrypt to Obfustopia via Private-Key Functional Encryption. IACR Cryptol. ePrint Arch. Ilan Komargodski, Gil Segev
2017	J	`jnl`	Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound. SIAM J. Comput. Ilan Komargodski, Ran Raz, Avishay Tal
2017	J	`jnl`	Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). Electron. Colloquium Comput. Complex. Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh Kothari
2017	J	`jnl`	Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). IACR Cryptol. ePrint Arch. Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari
2017	J	`jnl`	Negation-limited formulas. Theor. Comput. Sci. Siyao Guo, Ilan Komargodski
2017	—	`conf`	Non-Interactive Multiparty Computation Without Correlated Randomness. ASIACRYPT (3) Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev
2017	J	`jnl`	Non-Interactive Multiparty Computation without Correlated Randomness. IACR Cryptol. ePrint Arch. Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev
2017	J	`jnl`	Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. IACR Cryptol. ePrint Arch. Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs
2017	J	`jnl`	Secret-Sharing for NP. J. Cryptol. Ilan Komargodski, Moni Naor, Eylon Yogev
2017	A*	`conf`	White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. FOCS Ilan Komargodski, Moni Naor, Eylon Yogev
2017	J	`jnl`	White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. Electron. Colloquium Comput. Complex. Ilan Komargodski, Moni Naor, Eylon Yogev
2016	A*	`conf`	Communication with Contextual Uncertainty. SODA Badih Ghazi, Ilan Komargodski, Pravesh Kothari, Madhu Sudan
2016	—	`conf`	Cutting-Edge Cryptography Through the Lens of Secret Sharing. TCC (A2) Ilan Komargodski, Mark Zhandry
2016	—	`conf`	How to Share a Secret, Infinitely. TCC (B2) Ilan Komargodski, Moni Naor, Eylon Yogev
2016	J	`jnl`	How to Share a Secret, Infinitely. Electron. Colloquium Comput. Complex. Ilan Komargodski, Moni Naor, Eylon Yogev
2016	J	`jnl`	How to Share a Secret, Infinitely. IACR Cryptol. ePrint Arch. Ilan Komargodski, Moni Naor, Eylon Yogev
2016	—	`conf`	Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. TCC (B1) Ilan Komargodski
2016	J	`jnl`	Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. IACR Cryptol. ePrint Arch. Ilan Komargodski
2016	—	`conf`	Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. EUROCRYPT (2) Zvika Brakerski, Ilan Komargodski, Gil Segev
2016	—	`conf`	Threshold Secret Sharing Requires a Linear Size Alphabet. TCC (B2) Andrej Bogdanov, Siyao Guo, Ilan Komargodski
2016	J	`jnl`	Threshold Secret Sharing Requires a Linear Size Alphabet. Electron. Colloquium Comput. Complex. Andrej Bogdanov, Siyao Guo, Ilan Komargodski
2015	J	`jnl`	Communication with Contextual Uncertainty. CoRR Ilan Komargodski, Pravesh Kothari, Madhu Sudan
2015	J	`jnl`	Communication with Contextual Uncertainty. Electron. Colloquium Comput. Complex. Ilan Komargodski, Pravesh Kothari, Madhu Sudan
2015	A	`conf`	Compressing Communication in Distributed Protocols. DISC Yael Tauman Kalai, Ilan Komargodski
2015	J	`jnl`	Compressing Communication in Distributed Protocols. CoRR Yael Tauman Kalai, Ilan Komargodski
2015	J	`jnl`	Compressing Communication in Distributed Protocols. Electron. Colloquium Comput. Complex. Yael Tauman Kalai, Ilan Komargodski
2015	J	`jnl`	From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting. IACR Cryptol. ePrint Arch. Zvika Brakerski, Ilan Komargodski, Gil Segev
2015	—	`conf`	Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. TCC (2) Ilan Komargodski, Gil Segev, Eylon Yogev
2015	J	`jnl`	Modern Cryptography Through the Lens of Secret Sharing. IACR Cryptol. ePrint Arch. Ilan Komargodski, Mark Zhandry
2015	—	`conf`	Negation-Limited Formulas. APPROX-RANDOM Siyao Guo, Ilan Komargodski
2015	J	`jnl`	Negation-Limited Formulas. Electron. Colloquium Comput. Complex. Siyao Guo, Ilan Komargodski
2015	A	`conf`	Strong Locally Testable Codes with Relaxed Local Decoders. CCC Oded Goldreich, Tom Gur, Ilan Komargodski
2014	J	`jnl`	Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. IACR Cryptol. ePrint Arch. Ilan Komargodski, Gil Segev, Eylon Yogev
2014	A*	`conf`	One-Way Functions and (Im)Perfect Obfuscation. FOCS Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014	J	`jnl`	One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
2014	J	`jnl`	Secret-Sharing for NP from Indistinguishability Obfuscation. CoRR Ilan Komargodski, Moni Naor, Eylon Yogev
2014	J	`jnl`	Secret-Sharing for NP from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. Ilan Komargodski, Moni Naor, Eylon Yogev
2014	—	`conf`	Secret-Sharing for NP. ASIACRYPT (2) Ilan Komargodski, Moni Naor, Eylon Yogev
2014	J	`jnl`	Strong Locally Testable Codes with Relaxed Local Decoders. Electron. Colloquium Comput. Complex. Oded Goldreich, Tom Gur, Ilan Komargodski
2013	A*	`conf`	Average-case lower bounds for formula size. STOC Ilan Komargodski, Ran Raz
2013	B	`conf`	Hardness Preserving Reductions via Cuckoo Hashing. TCC Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2013	A*	`conf`	Improved Average-Case Lower Bounds for DeMorgan Formula Size. FOCS Ilan Komargodski, Ran Raz, Avishay Tal
2013	J	`jnl`	Improved Average-Case Lower Bounds for DeMorgan Formula Size. Electron. Colloquium Comput. Complex. Ilan Komargodski, Ran Raz, Avishay Tal
2012	J	`jnl`	Average-Case Lower Bounds for Formula Size. Electron. Colloquium Comput. Complex. Ilan Komargodski, Ran Raz
2012	J	`jnl`	Hardness Preserving Reductions via Cuckoo Hashing. Electron. Colloquium Comput. Complex. Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2012	J	`jnl`	Hardness Preserving Reductions via Cuckoo Hashing. IACR Cryptol. ePrint Arch. Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
2012	J	`jnl`	The Spectrum of Small DeMorgan Formulas. Electron. Colloquium Comput. Complex. Anat Ganor, Ilan Komargodski, Ran Raz