← back to search

Ilan Komargodski

Hebrew University of Jerusalem · IL
🔎 Find collaborators in Artificial Intelligence · Computational Theory and Mathematics →
Search 5.9M scientists by topic, h-index, country & funding — free.
Area of research
Artificial Intelligence · Computational Theory and Mathematics
Research interest
Research interests include Computer science, Logarithm, Obfuscation, Encryption, Functional encryption, and Random oracle.
h-index
citations
719
works
33
NIH funding
primary concept
email

Recent publications

Optimal Load-Balanced Scalable Distributed Agreement
2024cited by 10position: lastdoi
Memory Checking Requires Logarithmic Overhead
Journal of the ACM 2024cited by 0position: middledoi
Fully Adaptive Decentralized Multi-Authority ABE
Lecture notes in computer science 2023cited by 22position: middledoi
New Bounds on the Local Leakage Resilience of Shamir’s Secret Sharing Scheme
Lecture notes in computer science 2023cited by 14position: lastdoi
Decentralized Multi-authority ABE for $$\textsf{NC}^1$$ from BDH
Journal of Cryptology 2023cited by 13position: middledoi
Oblivious RAM with Worst-Case Logarithmic Overhead
Journal of Cryptology 2023cited by 12position: middledoi
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions
Lecture notes in computer science 2023cited by 8position: lastdoi
3-Party Secure Computation for RAMs: Optimal and Concretely Efficient
Lecture notes in computer science 2023cited by 3position: middledoi
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing
Computational Complexity 2023cited by 2position: lastdoi
OptORAMa: Optimal Oblivious RAM
Journal of the ACM 2022cited by 30position: middledoi
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions
Lecture notes in computer science 2022cited by 9position: lastdoi
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing
Lecture notes in computer science 2022cited by 8position: lastdoi
$$\log ^*$$-Round Game-Theoretically-Fair Leader Election
Lecture notes in computer science 2022cited by 4position: firstdoi
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions
Lecture notes in computer science 2022cited by 2position: middledoi
Decentralized Multi-authority ABE for DNFs from LWE
Lecture notes in computer science 2021cited by 60position: middledoi
Multiparty Reusable Non-interactive Secure Computation from LWE
Lecture notes in computer science 2021cited by 25position: middledoi
Non-malleable Time-Lock Puzzles and Applications
Lecture notes in computer science 2021cited by 22position: middledoi
A Logarithmic Lower Bound for Oblivious RAM (for All Parameters)
Lecture notes in computer science 2021cited by 16position: firstdoi
Oblivious RAM with Worst-Case Logarithmic Overhead
Lecture notes in computer science 2021cited by 12position: middledoi
Non-malleable Codes for Bounded Parallel-Time Tampering
Lecture notes in computer science 2021cited by 11position: middledoi
Differentially Oblivious Turing Machines
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) 2021cited by 2position: firstdoi
OptORAMa: Optimal Oblivious RAM
Lecture notes in computer science 2020cited by 87position: middledoi
Continuous Verifiable Delay Functions
Lecture notes in computer science 2020cited by 79position: middledoi
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols
COMBINATORICA 2020cited by 3position: middledoi
From Minicrypt to Obfustopia via Private-Key Functional Encryption
Journal of Cryptology 2019cited by 8position: firstdoi
From Minicrypt to Obfustopia via Private-Key Functional Encryption
Lecture notes in computer science 2017cited by 47position: firstdoi
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
Journal of Cryptology 2017cited by 20position: middledoi
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
Journal of Cryptology 2017cited by 13position: firstdoi
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
Lecture notes in computer science 2016cited by 45position: middledoi
Threshold Secret Sharing Requires a Linear Size Alphabet
Lecture notes in computer science 2016cited by 23position: lastdoi

Grants

No grants ingested yet.

Frequent collaborators

Elaine Shi · Carnegie Mellon University7 papers (2020–2023)Gil Segev · Hebrew University of Jerusalem6 papers (2015–2019)Wei-Kai Lin · University of Virginia5 papers (2020–2023)Cody Freitag · Northeastern University4 papers (2020–2023)Gilad Asharov · Hebrew University of Jerusalem4 papers (2020–2023)Rafael Pass · Cornell University4 papers (2014–2021)Ashrujit Ghoshal · Seattle University4 papers (2022–2023)Eylon Yogev · Bar-Ilan University3 papers (2014–2017) · 3 papers (2021–2023)Brent Waters · The University of Texas at Austin3 papers (2021–2023)Kartik Nayak · Duke University2 papers (2020–2022)Yuval Gelles · Hebrew University of Jerusalem2 papers (2022–2024)Enoch Peserico · University of Padua2 papers (2020–2022)Zvika Brakerski · Jain Irrigation Systems (Israel)2 papers (2016–2017)Aayush Jain · Carnegie Mellon University1 papers (2021–2021)Rex Fernando · UCLA Health1 papers (2022–2022)Ran Raz · Princeton University1 papers (2020–2020) · 1 papers (2023–2023)Shin’ichiro Matsuo · Georgetown University1 papers (2022–2022) · 1 papers (2023–2023)
Looking for a research collaborator?
Search millions of scientists by field, institution, impact, and funding status — see their work, find their email, and reach out directly.
Find collaborators in Artificial Intelligence · Computational Theory and Mathematics →