Eliad Tsfadia - RankMe

39 papers A* 10A 1Misc 2Journal 22Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Computationally Efficient Replicable Learning of Parities. CoRR Moshe Noivirt, Jessica Sorrell, Eliad Tsfadia
2026	A*	`conf`	Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems. SODA Kobbi Nissim, Eliad Tsfadia, Chao Yan
2026	J	`jnl`	Fair Coin Flipping: Tighter Analysis and the Many-Party Case. J. Cryptol. Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2025	—	`conf`	Computationally Differentially Private Inner-Product Protocols Imply Oblivious Transfer. CRYPTO (4) Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan
2025	A	`conf`	Data Reconstruction: When You See It and When You Don't. ITCS Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2025	J	`jnl`	Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems. CoRR Kobbi Nissim, Eliad Tsfadia, Chao Yan
2025	J	`jnl`	Mildly Accurate Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer. CoRR Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia, Chao Yan
2024	J	`jnl`	Data Reconstruction: When You See It and When You Don't. CoRR Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2024	J	`jnl`	On Differentially Private Subspace Estimation Without Distributional Assumptions. CoRR Eliad Tsfadia
2024	A*	`conf`	On Differentially Private Subspace Estimation in a Distribution-Free Setting. NeurIPS Eliad Tsfadia
2024	A*	`conf`	Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes. COLT Naty Peter, Eliad Tsfadia, Jonathan R. Ullman
2023	A*	`conf`	Adaptive Data Analysis in a Balanced Adversarial Model. NeurIPS Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2023	J	`jnl`	Adaptive Data Analysis in a Balanced Adversarial Model. CoRR Kobbi Nissim, Uri Stemmer, Eliad Tsfadia
2023	J	`jnl`	Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes. CoRR Naty Peter, Eliad Tsfadia, Jonathan R. Ullman
2022	A*	`conf`	FriendlyCore: Practical Differentially Private Aggregation. ICML Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
2022	—	`conf`	Highly Efficient OT-Based Multiplication Protocols. EUROCRYPT (1) Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
2022	—	`—`	On Cryptographic Hardness, Differential Privacy, and the Interconnection Between Them Eliad Tsfadia
2022	A*	`conf`	On the complexity of two-party differential privacy. STOC Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
2021	J	`jnl`	A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CoRR Itay Berman, Iftach Haitner, Eliad Tsfadia
2021	J	`jnl`	An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. CoRR Iftach Haitner, Eliad Tsfadia
2021	A*	`conf`	Differentially-Private Clustering of Easy Instances. ICML Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2021	J	`jnl`	Differentially-Private Clustering of Easy Instances. CoRR Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2021	J	`jnl`	Fair Coin Flipping: Tighter Analysis and the Many-Party Case. CoRR Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2021	J	`jnl`	FriendlyCore: Practical Differentially Private Aggregation. CoRR Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer
2021	J	`jnl`	Highly Efficient OT-Based Multiplication Protocols. IACR Cryptol. ePrint Arch. Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
2021	Misc	`conf`	Length preserving compression: marrying encryption with compression. SYSTOR Doron Chen, Michael Factor, Danny Harnik, Ronen I. Kat, Eliad Tsfadia
2021	J	`jnl`	On the Complexity of Two-Party Differential Privacy. CoRR Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
2021	J	`jnl`	On the Complexity of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia
2020	—	`conf`	A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CRYPTO (3) Itay Berman, Iftach Haitner, Eliad Tsfadia
2020	A*	`conf`	Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. NeurIPS Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2020	J	`jnl`	Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. CoRR Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia
2019	J	`jnl`	A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. Electron. Colloquium Comput. Complex. Itay Berman, Iftach Haitner, Eliad Tsfadia
2019	J	`jnl`	A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. IACR Cryptol. ePrint Arch. Itay Berman, Iftach Haitner, Eliad Tsfadia
2018	J	`jnl`	It Takes Two to #MeToo - Using Enclaves to Build Autonomous Trusted Systems. CoRR Danny Harnik, Paula Ta-Shma, Eliad Tsfadia
2018	Misc	`conf`	RestAssured: Securing Cloud Analytics. SYSTOR Oshrit Feder, Gidon Gershinsky, Eliad Tsfadia
2018	J	`jnl`	Securing the Storage Data Path with SGX Enclaves. CoRR Danny Harnik, Eliad Tsfadia, Doron Chen, Ronen I. Kat
2017	J	`jnl`	An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. SIAM J. Comput. Iftach Haitner, Eliad Tsfadia
2017	A*	`conf`	Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2014	A*	`conf`	An almost-optimally fair three-party coin-flipping protocol. STOC Iftach Haitner, Eliad Tsfadia