Ido Shahaf
Ido Shahaf
Onbekend partnerschap
Geverifieerd e-mailadres voor - Homepage
Geciteerd door
Geciteerd door
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
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
A Rosen, G Segev, I Shahaf
Journal of Cryptology 34 (1), 1-65, 2021
Tight tradeoffs in searchable symmetric encryption
G Asharov, G Segev, I Shahaf
Journal of Cryptology 34 (2), 1-37, 2021
Strengthening the security of encrypted databases: Non-transitive JOINs
I Mironov, G Segev, I Shahaf
Theory of Cryptography Conference, 631-661, 2017
Generic-group delay functions require hidden-order groups
L Rotem, G Segev, I Shahaf
Annual International Conference on the Theory and Applications of …, 2020
Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
G Segev, I Shahaf
Theory of Cryptography Conference, 177-191, 2018
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
Hardness vs.(very little) structure in cryptography: A multi-prover interactive proofs perspective
G Segev, I Shahaf
1st Conference on Information-Theoretic Cryptography (ITC 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
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–9