Can PPAD Hardness be Based on Standard Cryptographic Assumptions? - Alon Rosen; Gil Segev 001; Ido Shahaf (Electron. Colloquium Comput. Complex., 2016)

Strengthening the Security of Encrypted Databases: Non-Transitive JOINs. - Ilya Mironov; Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2017)

Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. - Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2018)

Generic-Group Delay Functions Require Hidden-Order Groups. - Lior Rotem; Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2020)

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. - Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2020)

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. - Ido Shahaf; Or Ordentlich; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

Tight Tradeoffs in Searchable Symmetric Encryption. - Gilad Asharov; Gil Segev 001; Ido Shahaf (J. Cryptol., 2021)

Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. - Gilad Asharov; Moni Naor; Gil Segev 001; Ido Shahaf (SIAM J. Comput., 2021)

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; et al. (CoRR, 2024)

FFN Fusion: Rethinking Sequential Computation in Large Language Models. - Akhiad Bercovich; Mohammad Dabbah; Omri Puny; Ido Galil; Amnon Geifman; Yonatan Geifman; Izhak Golan; Ehud Karpas; Itay Levy; Zach Moshe; Najeeb Nabwani; Tomer Ronen; et al. (CoRR, 2025)

Llama-Nemotron: Efficient Reasoning Models. - Akhiad Bercovich; Itay Levy; Izik Golan; Mohammad Dabbah; Ran El-Yaniv; Omri Puny; Ido Galil; Zach Moshe; Tomer Ronen; Najeeb Nabwani; Ido Shahaf; Oren Tropp; et al. (CoRR, 2025)