Follow
Ido Shahaf
Ido Shahaf
Unknown affiliation
Verified email at cs.huji.ac.il - Homepage
Title
Cited by
Cited by
Year
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
G Asharov, M Naor, G Segev, I Shahaf
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
912016
Tight tradeoffs in searchable symmetric encryption
G Asharov, G Segev, I Shahaf
Journal of Cryptology 34 (2), 1-37, 2021
372021
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
A Rosen, G Segev, I Shahaf
Journal of Cryptology 34 (1), 1-65, 2021
29*2021
Generic-group delay functions require hidden-order groups
L Rotem, G Segev, I Shahaf
Annual International Conference on the Theory and Applications of …, 2020
142020
Strengthening the security of encrypted databases: Non-transitive joins
I Mironov, G Segev, I Shahaf
Theory of Cryptography Conference, 631-661, 2017
102017
An information-theoretic proof of the streaming switching lemma for symmetric encryption
I Shahaf, O Ordentlich, G Segev
2020 IEEE International Symposium on Information Theory (ISIT), 858-863, 2020
22020
Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
G Segev, I Shahaf
Theory of Cryptography Conference, 177-191, 2018
22018
Searchable symmetric encryption: Optimal locality in linear space via two-dimensional balanced allocations
G Asharov, M Naor, G Segev, I Shahaf
SIAM journal on computing 50 (5), 1501-1536, 2021
12021
Hardness vs.(very little) structure in cryptography: A multi-prover interactive proofs perspective
G Segev, I Shahaf
Cryptology ePrint Archive, 2020
2020
Searchable symmetric encryption with enhanced locality via balanced allocations
G Segev, I Shahaf, G Asharov, M Naor
US Patent 10,331,913, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–10