Fair Coin Flipping: Tighter Analysis and the Many-Party Case. - Niv Buchbinder; Iftach Haitner; Nissan Levi; Eliad Tsfadia (SODA, 2017)

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. - Iftach Haitner; Eliad Tsfadia (SIAM J. Comput., 2017)

RestAssured: Securing Cloud Analytics. - Oshrit Feder; Gidon Gershinsky; Eliad Tsfadia (SYSTOR, 2018)

Securing the Storage Data Path with SGX Enclaves. - Danny Harnik; Eliad Tsfadia; Doron Chen; Ronen I. Kat (CoRR, 2018)

It Takes Two to #MeToo - Using Enclaves to Build Autonomous Trusted Systems. - Danny Harnik; Paula Ta-Shma; Eliad Tsfadia (CoRR, 2018)

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. - Itay Berman; Iftach Haitner; Eliad Tsfadia (Electron. Colloquium Comput. Complex., 2019)

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. - Itay Berman; Iftach Haitner; Eliad Tsfadia (CRYPTO (3), 2020)

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. - Haim Kaplan; Yishay Mansour; Uri Stemmer; Eliad Tsfadia (NeurIPS, 2020)

Differentially-Private Clustering of Easy Instances. - Edith Cohen; Haim Kaplan; Yishay Mansour; Uri Stemmer; Eliad Tsfadia (ICML, 2021)

Length preserving compression: marrying encryption with compression. - Doron Chen; Michael Factor; Danny Harnik; Ronen I. Kat; Eliad Tsfadia (SYSTOR, 2021)

On the Complexity of Two-Party Differential Privacy. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia (Electron. Colloquium Comput. Complex., 2021)

Highly Efficient OT-Based Multiplication Protocols. - Iftach Haitner; Nikolaos Makriyannis; Samuel Ranellucci; Eliad Tsfadia (IACR Cryptol. ePrint Arch., 2021)

FriendlyCore: Practical Differentially Private Aggregation. - Eliad Tsfadia; Edith Cohen; Haim Kaplan; Yishay Mansour; Uri Stemmer (ICML, 2022)

On Cryptographic Hardness, Differential Privacy, and the Interconnection Between Them - Eliad Tsfadia (2022)

Adaptive Data Analysis in a Balanced Adversarial Model. - Kobbi Nissim; Uri Stemmer; Eliad Tsfadia (NeurIPS, 2023)

Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes. - Naty Peter; Eliad Tsfadia; Jonathan R. Ullman (COLT, 2024)

On Differentially Private Subspace Estimation in a Distribution-Free Setting. - Eliad Tsfadia (NeurIPS, 2024)

On Differentially Private Subspace Estimation Without Distributional Assumptions. - Eliad Tsfadia (CoRR, 2024)

Data Reconstruction: When You See It and When You Don't. - Edith Cohen; Haim Kaplan; Yishay Mansour; Shay Moran; Kobbi Nissim; Uri Stemmer; Eliad Tsfadia (ITCS, 2025)

Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer. - Iftach Haitner; Noam Mazor; Jad Silbak; Eliad Tsfadia; Chao Yan (CoRR, 2025)

Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems. - Kobbi Nissim; Eliad Tsfadia; Chao Yan (CoRR, 2025)