Ilan Komargodski

Hebrew University of Jerusalem — Israel

Computer Science · Physical Sciences

22h-index1.3kcitations124works0.92yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(95), Complexity and Algorithms in Graphs(53), Cryptographic Implementations and Security(29), Privacy-Preserving Technologies in Data(28), Chaos-based Image/Signal Encryption(12)

Publications124 total

Improved Rate for Non-Malleable Codes and Time-Lock Puzzles
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions
Journal of Cryptology·2025Open Access
Offline-Online Indifferentiability of Cryptographic Systems
Lecture notes in computer science·2025Open Access
MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM
2025Open Access
A New Approach for LPN-Based Pseudorandom Functions: Low-Depth and Key-Homomorphic
2025
Proof of Work With External Utilities
arXiv (Cornell University)·2025Open Access
A Logarithmic Lower Bound for Oblivious RAM (For All Parameters)
SIAM Journal on Computing·2025
Proofs of Useful Work from Arbitrary Matrix Multiplication
arXiv (Cornell University)·2025Open Access
The Complexity of Memory Checking with Covert Security
Lecture notes in computer science·2025
Memory Checking Requires Logarithmic Overhead
Journal of the ACM·2024Open Access
On the (Im)possibility of Game-Theoretically Fair Leader Election Protocols
Lecture notes in computer science·2024· 1 cited
Verifying Groups in Linear Time
2024· 1 cited
Memory Checking Requires Logarithmic Overhead
2024· 2 citedOpen Access
Optimal Load-Balanced Scalable Distributed Agreement
2024· 9 citedOpen Access
Scalable Agreement Protocols with Optimal Optimistic Efficiency
Lecture notes in computer science·2024· 1 cited
FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM
2023· 6 citedOpen Access
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing
Computational Complexity·2023· 2 cited
Decentralized Multi-authority ABE for $$\textsf{NC}^1$$ from BDH
Journal of Cryptology·2023· 13 citedOpen Access
Oblivious RAM with Worst-Case Logarithmic Overhead
Journal of Cryptology·2023· 10 cited
Fully Adaptive Decentralized Multi-Authority ABE
Lecture notes in computer science·2023· 22 cited
page 1 of 7Next →

Frequent Co-authors

Eylon Yogev(12), Moni Naor(7), Gil Segev(7), Rafael Pass(6), Cody Freitag(6), Gilad Asharov(5), Wei-Kai Lin(5), Zvika Brakerski(5), Elaine Shi(4), Ran Raz(4), Naomi Ephraim(3), Pratish Datta(3), Brent Waters(3), Ashrujit Ghoshal(3), Kartik Nayak(2), Enoch Peserico(2), Daniel Wichs(2), Avishay Tal(2), Aayush Jain(2), Andrej Bogdanov(2)