Ilan Komargodski

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 137

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

J. Cryptol.

CRYPTO (3)

Publications

Elette Boyle, Ilan Komargodski, Neekon Vafa
Memory Checking Requires Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2024 (2024)
Rex Fernando, Yuval Gelles, Ilan Komargodski
Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election. ITCS (2024)
Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. IACR Cryptol. ePrint Arch. 2023 (2023)
Yuval Gelles, Ilan Komargodski
Scalable Agreement Protocols with Optimal Optimistic Efficiency. IACR Cryptol. ePrint Arch. 2023 (2023)
Yuval Gelles, Ilan Komargodski
Brief Announcement: Scalable Agreement Protocols with Optimal Optimistic Efficiency. DISC (2023)
Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. IACR Cryptol. ePrint Arch. 2023 (2023)
Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. EUROCRYPT (4) (2023)
Pratish Datta, Ilan Komargodski, Brent Waters
Fully Adaptive Decentralized Multi-Authority ABE. EUROCRYPT (3) (2023)
Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski
Verifying Groups in Linear Time. Electron. Colloquium Comput. Complex. (2023)
Ohad Klein, Ilan Komargodski
New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. IACR Cryptol. ePrint Arch. 2023 (2023)
Rex Fernando, Aayush Jain, Ilan Komargodski
Maliciously-Secure MrNISC in the Plain Model. EUROCRYPT (2) (2023)
Pratish Datta, Ilan Komargodski, Brent Waters
from BDH. J. Cryptol. 36 (2) (2023)
Yuval Gelles, Ilan Komargodski
Optimal Load-Balanced Scalable Distributed Agreement. IACR Cryptol. ePrint Arch. 2023 (2023)
Ilan Komargodski, Yoav Tamir
On Distributed Randomness Generation in Blockchains. CSCML (2023)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
Oblivious RAM with Worst-Case Logarithmic Overhead. J. Cryptol. 36 (2) (2023)
Ohad Klein, Ilan Komargodski
New Bounds on the Local Leakage Resilience of Shamir's Secret Sharing Scheme. CRYPTO (1) (2023)
Sourav Das, Rex Fernando, Ilan Komargodski, Elaine Shi, Pratik Soni
Distributed-Prover Interactive Proofs. TCC (1) (2023)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi
OptORAMa: Optimal Oblivious RAM. J. ACM 70 (1) (2023)
Cody Freitag, Ilan Komargodski
The Cost of Statistical Security in Proofs for Repeated Squaring. ITC (2023)
Gilad Asharov, Ilan Komargodski, Yehuda Michelson
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. CCS (2023)
Atsunori Ichikawa, Ilan Komargodski, Koki Hamada, Ryo Kikuchi, Dai Ikarashi
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient. TCC (1) (2023)
Gilad Asharov, Ilan Komargodski, Yehuda Michelson
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. IACR Cryptol. ePrint Arch. 2023 (2023)
Ashrujit Ghoshal, Ilan Komargodski
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. Comput. Complex. 32 (2) (2023)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
SPARKs: Succinct Parallelizable Arguments of Knowledge. J. ACM 69 (5) (2022)
Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. CRYPTO (3) (2022)
Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51 (6) (2022)
Pratish Datta, Ilan Komargodski, Brent Waters
Fully Adaptive Decentralized Multi-Authority ABE. IACR Cryptol. ePrint Arch. 2022 (2022)
Ashrujit Ghoshal, Ilan Komargodski
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. CRYPTO (3) (2022)
Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin
On the Complexity of Compressing Obfuscation. J. Cryptol. 35 (3) (2022)
Ilan Komargodski, Elaine Shi
Differentially Oblivious Turing Machines. IACR Cryptol. ePrint Arch. 2022 (2022)
Cody Freitag, Ilan Komargodski
The Cost of Statistical Security in Interactive Proofs for Repeated Squaring. IACR Cryptol. ePrint Arch. 2022 (2022)
Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu
log*-Round Game-Theoretically-Fair Leader Election. IACR Cryptol. ePrint Arch. 2022 (2022)
Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. IACR Cryptol. ePrint Arch. 2022 (2022)
Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. IACR Cryptol. ePrint Arch. 2022 (2022)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Optimal Oblivious Parallel RAM. SODA (2022)
Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu
-Round Game-Theoretically-Fair Leader Election. CRYPTO (3) (2022)
Ashrujit Ghoshal, Ilan Komargodski
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgard Hashing. IACR Cryptol. ePrint Arch. 2022 (2022)
Nimrod Aviram, Benjamin Dowling, Ilan Komargodski, Kenneth G. Paterson, Eyal Ronen, Eylon Yogev
Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS. IACR Cryptol. ePrint Arch. 2022 (2022)
Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. CRYPTO (1) (2022)
Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin
Multiparty Reusable Non-interactive Secure Computation from LWE. EUROCRYPT (2) (2021)
Ilan Komargodski, Elaine Shi
Differentially Oblivious Turing Machines. ITCS (2021)
Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin
Non-malleable Time-Lock Puzzles and Applications. TCC (3) (2021)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
Oblivious RAM with Worst-Case Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2021 (2021)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness-Preserving Reductions via Cuckoo Hashing. CoRR (2021)
Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin
Multiparty Reusable Non-Interactive Secure Computation from LWE. IACR Cryptol. ePrint Arch. 2021 (2021)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi
Oblivious RAM with Worst-Case Logarithmic Overhead. CRYPTO (4) (2021)
Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
Non-malleable Codes for Bounded Parallel-Time Tampering. CRYPTO (3) (2021)
Rex Fernando, Aayush Jain, Ilan Komargodski
Maliciously-Secure MrNISC in the Plain Model. IACR Cryptol. ePrint Arch. 2021 (2021)
Ilan Komargodski, Wei-Kai Lin
A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). CRYPTO (4) (2021)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. CoRR (2021)
Pratish Datta, Ilan Komargodski, Brent Waters
Decentralized Multi-authority ABE for DNFs from LWE. EUROCRYPT (1) (2021)
Pratish Datta, Ilan Komargodski, Brent Waters
Decentralized Multi-Authority ABE for NC^1 from Computational-BDH. IACR Cryptol. ePrint Arch. 2021 (2021)
Yael Tauman Kalai, Ilan Komargodski, Ran Raz
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols. Comb. 41 (1) (2021)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Oblivious Parallel Tight Compaction. ITC (2020)
Ilan Komargodski, Gil Segev
From Minicrypt to Obfustopia via Private-Key Functional Encryption. J. Cryptol. 33 (2) (2020)
Andrej Bogdanov, Siyao Guo, Ilan Komargodski
Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory Comput. 16 (2020)
Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi
Secure Massively Parallel Computation for Dishonest Majority. TCC (2) (2020)
Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi
Secure Massively Parallel Computation for Dishonest Majority. IACR Cryptol. ePrint Arch. 2020 (2020)
Ilan Komargodski, Wei-Kai Lin
Lower Bound for Oblivious RAM with Large Cells. IACR Cryptol. ePrint Arch. 2020 (2020)
Cody Freitag, Ilan Komargodski, Rafael Pass
Impossibility of Strong KDM Security with Auxiliary Input. SCN (2020)
Pratish Datta, Ilan Komargodski, Brent Waters
Decentralized Multi-Authority ABE for DNFs from LWE. IACR Cryptol. ePrint Arch. 2020 (2020)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Oblivious Parallel Tight Compaction. IACR Cryptol. ePrint Arch. 2020 (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
Continuous Verifiable Delay Functions. EUROCRYPT (3) (2020)
Dana Dachman-Soled, Ilan Komargodski, Rafael Pass
Non-Malleable Codes for Bounded Polynomial Depth Tampering. IACR Cryptol. ePrint Arch. 2020 (2020)
Tomer Grossman, Ilan Komargodski, Moni Naor
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. ITCS (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
SPARKs: Succinct Parallelizable Arguments of Knowledge. IACR Cryptol. ePrint Arch. 2020 (2020)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi
Optimal Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2020 (2020)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi
OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) (2020)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
Non-Malleable Time-Lock Puzzles and Applications. IACR Cryptol. ePrint Arch. 2020 (2020)
Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor
Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. 32 (2) (2019)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) (2019)
Oded Goldreich, Tom Gur, Ilan Komargodski
Strong Locally Testable Codes with Relaxed Local Decoders. ACM Trans. Comput. Theory 11 (3) (2019)
Tomer Grossman, Ilan Komargodski, Moni Naor
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Electron. Colloquium Comput. Complex. 26 (2019)
Ilan Komargodski, Moni Naor, Eylon Yogev
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66 (5) (2019)
Cody Freitag, Ilan Komargodski, Rafael Pass
Impossibility of Strong KDM Security with Auxiliary Input. IACR Cryptol. ePrint Arch. 2019 (2019)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
On Perfect Correctness without Derandomization. IACR Cryptol. ePrint Arch. 2019 (2019)
Cody Freitag, Ilan Komargodski, Rafael Pass
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. IACR Cryptol. ePrint Arch. 2019 (2019)
Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass
Continuous Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Cody Freitag, Ilan Komargodski, Rafael Pass
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. CRYPTO (3) (2019)
Yael Tauman Kalai, Ilan Komargodski, Ran Raz
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. DISC (2018)
Ilan Komargodski, Moni Naor, Eylon Yogev
How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory 64 (6) (2018)
Ilan Komargodski, Moni Naor, Eylon Yogev
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) (2018)
Ilan Komargodski, Eylon Yogev
On Distributional Collision Resistant Hashing. CRYPTO (2) (2018)
Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Elaine Shi
OptORAMa: Optimal Oblivious RAM. IACR Cryptol. ePrint Arch. 2018 (2018)
Ilan Komargodski, Gil Segev, Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. J. Cryptol. 31 (1) (2018)
Ilan Komargodski, Mark Zhandry
Cutting-edge cryptography through the lens of secret sharing. Inf. Comput. 263 (2018)
Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). EUROCRYPT (2) (2018)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
On the Complexity of Compressing Obfuscation. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs
Non-trivial Witness Encryption and Null-iO from Standard Assumptions. SCN (2018)
Ilan Komargodski, Ran Raz, Yael Tauman Kalai
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. Electron. Colloquium Comput. Complex. 25 (2018)
Zvika Brakerski, Ilan Komargodski, Gil Segev
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. J. Cryptol. 31 (2) (2018)
Ilan Komargodski, Eylon Yogev
On Distributional Collision Resistant Hashing. IACR Cryptol. ePrint Arch. 2018 (2018)
Ilan Komargodski, Eylon Yogev
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. IACR Cryptol. ePrint Arch. 2018 (2018)
Ilan Komargodski, Eylon Yogev
Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation. EUROCRYPT (1) (2018)
Badih Ghazi, Ilan Komargodski, Pravesh K. Kothari, Madhu Sudan
Communication with Contextual Uncertainty. Comput. Complex. 27 (3) (2018)
Ilan Komargodski
Leakage resilient one-way functions: The auxiliary-input setting. Theor. Comput. Sci. 746 (2018)
Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass
On the Complexity of Compressing Obfuscation. CRYPTO (3) (2018)
Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs
Be Adaptive, Avoid Overcommitting. CRYPTO (1) (2017)

Ilan Komargodski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ilan Komargodski