Ido Shahaf

According to our database1, Ido Shahaf authored at least 11 papers between 2016 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Llama-Nemotron: Efficient Reasoning Models.
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , ,
CoRR, May, 2025

FFN Fusion: Rethinking Sequential Computation in Large Language Models.
CoRR, March, 2025

2024
Puzzle: Distillation-Based NAS for Inference-Optimized LLMs.
CoRR, 2024

2020
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Generic-Group Delay Functions Require Hidden-Order Groups.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2018
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Tight Tradeoffs in Searchable Symmetric Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Strengthening the Security of Encrypted Databases: Non-transitive JOINs.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016


  Loading...