Ido Shahaf

Hebrew University of Jerusalem — Israel

Computer Science · Physical Sciences

5h-index162citations14works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

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

Research Topics

Cryptography and Data Security(13), Complexity and Algorithms in Graphs(6), Cryptographic Implementations and Security(6), Privacy-Preserving Technologies in Data(3), Chaos-based Image/Signal Encryption(3)

Publications14 total

Tight Tradeoffs in Searchable Symmetric Encryption
Journal of Cryptology·2021· 25 cited
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
SIAM Journal on Computing·2021· 1 cited
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
2020· 5 cited
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
arXiv (Cornell University)·2020Open Access
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020Open Access
Generic-Group Delay Functions Require Hidden-Order Groups
Lecture notes in computer science·2020· 23 cited
Generic-Group Delay Functions Require Hidden-Order Groups.
IACR Cryptology ePrint Archive·2020
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound
Lecture notes in computer science·2018· 2 cited
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.
IACR Cryptology ePrint Archive·2018
Tight Tradeoffs in Searchable Symmetric Encryption
Lecture notes in computer science·2018
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs.
IACR Cryptology ePrint Archive·2017
Strengthening the Security of Encrypted Databases: Non-transitive JOINs
Lecture notes in computer science·2017· 11 cited
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Lecture notes in computer science·2017· 3 cited
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
2016· 92 cited

Frequent Co-authors

Gil Segev(14), Gilad Asharov(4), Moni Naor(2), Lior Rotem(2), Ilya Mironov(2), Or Ordentlich(2), Alon Rosen(1)