| 2026 | COLT | Invited Open Problem: Does Differential Privacy Make PAC Learning Much Harder? | Kobbi Nissim, Uri Stemmer, Eliad Tsfadia |
| 2026 | SODA | Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems. | Kobbi Nissim, Eliad Tsfadia, Chao Yan |
| 2025 | CRYPTO | Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer. | Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan |
| 2024 | COLT | Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes. | Naty Peter, Eliad Tsfadia, Jonathan R. Ullman |
| 2022 | EuroCrypt | Highly Efficient OT-Based Multiplication Protocols. | Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia |
| 2022 | ICML | FriendlyCore: Practical Differentially Private Aggregation. | Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer |
| 2022 | STOC | On the complexity of two-party differential privacy. | Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia |
| 2021 | ICML | Differentially-Private Clustering of Easy Instances. | Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia |
| 2021 | SYSTOR | Length preserving compression: marrying encryption with compression. | Doron Chen, Michael Factor, Danny Harnik, Ronen I. Kat, Eliad Tsfadia |
| 2020 | CRYPTO | A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. | Itay Berman, Iftach Haitner, Eliad Tsfadia |
| 2018 | SYSTOR | RestAssured: Securing Cloud Analytics. | Oshrit Feder, Gidon Gershinsky, Eliad Tsfadia |
| 2017 | SODA | Fair Coin Flipping: Tighter Analysis and the Many-Party Case. | Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia |
| 2014 | STOC | An almost-optimally fair three-party coin-flipping protocol. | Iftach Haitner, Eliad Tsfadia |