Ido Shahaf

According to our database, Ido Shahaf authored at least 9 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Puzzle: Distillation-Based NAS for Inference-Optimized LLMs.

Akhiad Bercovich, Tomer Ronen, Talor Abramovich, Nir Ailon, Nave Assaf, Mohammad Dabbah, Ido Galil, Amnon Geifman, Yonatan Geifman, Izhak Golan, Netanel Haber, Ehud Karpas, Roi Koren, Itay Levy, Pavlo Molchanov, Shahar Mor, Zach Moshe, Najeeb Nabwani, Omri Puny, Ran Rubin, Itamar Schen, Ido Shahaf, Oren Tropp, Omer Ullman Argov, Ran Zilberstein, Ran El-Yaniv

CoRR, 2024

2021

Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations.

Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf

SIAM J. Comput., 2021

Tight Tradeoffs in Searchable Symmetric Encryption.

Gilad Asharov, Gil Segev, Ido Shahaf

J. Cryptol., 2021

2020

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.

Ido Shahaf, Or Ordentlich, Gil Segev

IACR Cryptol. ePrint Arch., 2020

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.

Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2020

Generic-Group Delay Functions Require Hidden-Order Groups.

Lior Rotem, Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2020

2018

Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.

Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2018

2017

Strengthening the Security of Encrypted Databases: Non-Transitive JOINs.

Ilya Mironov, Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2017

2016

Can PPAD Hardness be Based on Standard Cryptographic Assumptions?

Alon Rosen, Gil Segev, Ido Shahaf

Electron. Colloquium Comput. Complex., 2016