Ido Shahaf

26 papers A* 2A 1B 1Journal 17Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Extending Puzzle for Mixture-of-Experts Reasoning Models with Application to GPT-OSS Acceleration.
CoRR
Akhiad Bercovich, Nir Ailon, Vladimir Anisimov, Tomer Asida, Nave Assaf, Mohammad Dabbah, Ido Galil, Amnon Geifman, Yonatan Geifman, Izhak Golan, Roi Koren, Itay Levy, Zach Moshe, Pavlo Molchanov, Najeeb Nabwani, Mostofa Patwari, Omri Puny, Tomer Ronen, Itamar Schen, Elad Segal, Ido Shahaf, Oren Tropp, Ran Zilberstein, Ran El-Yaniv
2026 J jnl
Quantization-Aware Distillation for NVFP4 Inference Accuracy Recovery.
CoRR
Meng Xin, Sweta Priyadarshi, Jingyu Xin, Bilal Kartal, Aditya Vavre, Asma Kuriparambil Thekkumpate, Zijia Chen, Ameya Sunil Mahabaleshwarkar, Ido Shahaf, Akhiad Bercovich, Kinjal Patel, Suguna Varshini Velury, Chenjie Luo, Zhiyu Cheng, Jenny Chen, Chen-Han Yu, Wei Ping, Oleg Rybakov, Nima Tajbakhsh, Oluwatobi Olabiyi, Dusan Stosic, Di Wu, Song Han, Eric Chung, Sharath Turuvekere Sreenivas, Bryan Catanzaro, Yoshi Suhara, Tijmen Blankevoort, Huizi Mao
2025 J jnl
FFN Fusion: Rethinking Sequential Computation in Large Language Models.
CoRR
Akhiad Bercovich, Mohammad Dabbah, Omri Puny, Ido Galil, Amnon Geifman, Yonatan Geifman, Izhak Golan, Ehud Karpas, Itay Levy, Zach Moshe, Najeeb Nabwani, Tomer Ronen, Itamar Schen, Elad Segal, Ido Shahaf, Oren Tropp, Ran Zilberstein, Ran El-Yaniv
2025 A* conf
Puzzle: Distillation-Based NAS for Inference-Optimized LLMs.
ICML
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
2024 J jnl
Puzzle: Distillation-Based NAS for Inference-Optimized LLMs.
CoRR
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
2021 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
J. Cryptol.
Alon Rosen, Gil Segev, Ido Shahaf
2021 J jnl
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations.
SIAM J. Comput.
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2021 J jnl
Tight Tradeoffs in Searchable Symmetric Encryption.
J. Cryptol.
Gilad Asharov, Gil Segev, Ido Shahaf
2020 B conf
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
ISIT
Ido Shahaf, Or Ordentlich, Gil Segev
2020 J jnl
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
CoRR
Ido Shahaf, Or Ordentlich, Gil Segev
2020 J jnl
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
IACR Cryptol. ePrint Arch.
Ido Shahaf, Or Ordentlich, Gil Segev
2020 — conf
Generic-Group Delay Functions Require Hidden-Order Groups.
EUROCRYPT (3)
Lior Rotem, Gil Segev, Ido Shahaf
2020 J jnl
Generic-Group Delay Functions Require Hidden-Order Groups.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev, Ido Shahaf
2020 A conf
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.
ITC
Gil Segev, Ido Shahaf
2020 J jnl
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.
IACR Cryptol. ePrint Arch.
Gil Segev, Ido Shahaf
2018 — conf
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.
TCC (2)
Gil Segev, Ido Shahaf
2018 J jnl
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.
IACR Cryptol. ePrint Arch.
Gil Segev, Ido Shahaf
2018 — conf
Tight Tradeoffs in Searchable Symmetric Encryption.
CRYPTO (1)
Gilad Asharov, Gil Segev, Ido Shahaf
2018 J jnl
Tight Tradeoffs in Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Gil Segev, Ido Shahaf
2017 — conf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
TCC (2)
Alon Rosen, Gil Segev, Ido Shahaf
2017 J jnl
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs.
IACR Cryptol. ePrint Arch.
Ilya Mironov, Gil Segev, Ido Shahaf
2017 — conf
Strengthening the Security of Encrypted Databases: Non-transitive JOINs.
TCC (2)
Ilya Mironov, Gil Segev, Ido Shahaf
2016 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Electron. Colloquium Comput. Complex.
Alon Rosen, Gil Segev, Ido Shahaf
2016 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
IACR Cryptol. ePrint Arch.
Alon Rosen, Gil Segev, Ido Shahaf
2016 J jnl
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2016 A* conf
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations.
STOC
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf