Ido Shahaf

Publication Activity (10 Years)

Years Active: 2016-2021
Publications (10 Years): 21

Top Topics

Relative Entropy

Simplifying Assumptions

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? J. Cryptol. 34 (1) (2021)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. J. Cryptol. 34 (2) (2021)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. 50 (5) (2021)
Gil Segev, Ido Shahaf
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. IACR Cryptol. ePrint Arch. 2020 (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020 (2020)
Gil Segev, Ido Shahaf
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. ITC (2020)
Lior Rotem, Gil Segev, Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups. EUROCRYPT (3) (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. CoRR (2020)
Lior Rotem, Gil Segev, Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups. IACR Cryptol. ePrint Arch. 2020 (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. ISIT (2020)
Gil Segev, Ido Shahaf
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. TCC (2) (2018)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. CRYPTO (1) (2018)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Gil Segev, Ido Shahaf
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. IACR Cryptol. ePrint Arch. 2018 (2018)
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? TCC (2) (2017)
Ilya Mironov, Gil Segev, Ido Shahaf
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs. IACR Cryptol. ePrint Arch. 2017 (2017)
Ilya Mironov, Gil Segev, Ido Shahaf
Strengthening the Security of Encrypted Databases: Non-transitive JOINs. TCC (2) (2017)
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Electron. Colloquium Comput. Complex. 23 (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. 2016 (2016)
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? IACR Cryptol. ePrint Arch. 2016 (2016)