Eliad Tsfadia

According to our database, Eliad Tsfadia authored at least 17 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On Differentially Private Subspace Estimation Without Distributional Assumptions.

Eliad Tsfadia

CoRR, 2024

2023

Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes.

Naty Peter, Eliad Tsfadia, Jonathan R. Ullman

CoRR, 2023

Adaptive Data Analysis in a Balanced Adversarial Model.

Kobbi Nissim, Uri Stemmer, Eliad Tsfadia

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

On Cryptographic Hardness, Differential Privacy, and the Interconnection Between Them

Eliad Tsfadia

PhD thesis, 2022

FriendlyCore: Practical Differentially Private Aggregation.

Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer

Proceedings of the International Conference on Machine Learning, 2022

2021

Highly Efficient OT-Based Multiplication Protocols.

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

IACR Cryptol. ePrint Arch., 2021

On the Complexity of Two-Party Differential Privacy.

Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia

Electron. Colloquium Comput. Complex., 2021

Length preserving compression: marrying encryption with compression.

Doron Chen, Michael Factor, Danny Harnik, Ronen I. Kat, Eliad Tsfadia

Proceedings of the SYSTOR '21: The 14th ACM International Systems and Storage Conference, 2021

Differentially-Private Clustering of Easy Instances.

Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity.

Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence.

Itay Berman, Iftach Haitner, Eliad Tsfadia

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.

Itay Berman, Iftach Haitner, Eliad Tsfadia

Electron. Colloquium Comput. Complex., 2019

2018

It Takes Two to #MeToo - Using Enclaves to Build Autonomous Trusted Systems.

Danny Harnik, Paula Ta-Shma, Eliad Tsfadia

CoRR, 2018

Securing the Storage Data Path with SGX Enclaves.

Danny Harnik, Eliad Tsfadia, Doron Chen, Ronen I. Kat

CoRR, 2018

RestAssured: Securing Cloud Analytics.

Oshrit Feder, Gidon Gershinsky, Eliad Tsfadia

Proceedings of the 11th ACM International Systems and Storage Conference, 2018

2017

An Almost-Optimally Fair Three-Party Coin-Flipping Protocol.

Iftach Haitner, Eliad Tsfadia

SIAM J. Comput., 2017

Fair Coin Flipping: Tighter Analysis and the Many-Party Case.

Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017