default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEliad Tsfadia
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Naty Peter, Eliad Tsfadia, Jonathan R. Ullman:
Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes. COLT 2024: 4207-4239- [i17]Eliad Tsfadia:
On Differentially Private Subspace Estimation Without Distributional Assumptions. CoRR abs/2402.06465 (2024) - [i16]Edith Cohen, Haim Kaplan, Yishay Mansour, Shay Moran, Kobbi Nissim, Uri Stemmer, Eliad Tsfadia:
Data Reconstruction: When You See It and When You Don't. CoRR abs/2405.15753 (2024) - 2023
- [c11]Kobbi Nissim, Uri Stemmer, Eliad Tsfadia:
Adaptive Data Analysis in a Balanced Adversarial Model. NeurIPS 2023 - [i15]Kobbi Nissim, Uri Stemmer, Eliad Tsfadia:
Adaptive Data Analysis in a Balanced Adversarial Model. CoRR abs/2305.15452 (2023) - [i14]Naty Peter, Eliad Tsfadia, Jonathan R. Ullman:
Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes. CoRR abs/2307.07604 (2023) - 2022
- [b1]Eliad Tsfadia:
On Cryptographic Hardness, Differential Privacy, and the Interconnection Between Them. Tel Aviv University, Israel, 2022 - [c10]Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. EUROCRYPT (1) 2022: 180-209 - [c9]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. ICML 2022: 21828-21863 - [c8]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the complexity of two-party differential privacy. STOC 2022: 1392-1405 - 2021
- [c7]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. ICML 2021: 2049-2059 - [c6]Doron Chen, Michael Factor, Danny Harnik, Ronen I. Kat, Eliad Tsfadia:
Length preserving compression: marrying encryption with compression. SYSTOR 2021: 15:1-15:12 - [i13]Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia:
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. CoRR abs/2104.08820 (2021) - [i12]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CoRR abs/2105.00801 (2021) - [i11]Iftach Haitner, Eliad Tsfadia:
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. CoRR abs/2105.00850 (2021) - [i10]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. CoRR abs/2108.07664 (2021) - [i9]Eliad Tsfadia, Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer:
FriendlyCore: Practical Differentially Private Aggregation. CoRR abs/2110.10132 (2021) - [i8]Edith Cohen, Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Differentially-Private Clustering of Easy Instances. CoRR abs/2112.14445 (2021) - [i7]Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. Electron. Colloquium Comput. Complex. TR21 (2021) - [i6]Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia:
Highly Efficient OT-Based Multiplication Protocols. IACR Cryptol. ePrint Arch. 2021: 1373 (2021) - 2020
- [c5]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence. CRYPTO (3) 2020: 544-573 - [c4]Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. NeurIPS 2020 - [i5]Haim Kaplan, Yishay Mansour, Uri Stemmer, Eliad Tsfadia:
Private Learning of Halfspaces: Simplifying the Construction and Reducing the Sample Complexity. CoRR abs/2004.07839 (2020)
2010 – 2019
- 2019
- [i4]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. Electron. Colloquium Comput. Complex. TR19 (2019) - [i3]Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. IACR Cryptol. ePrint Arch. 2019: 393 (2019) - 2018
- [c3]Oshrit Feder, Gidon Gershinsky, Eliad Tsfadia:
RestAssured: Securing Cloud Analytics. SYSTOR 2018: 120 - [i2]Danny Harnik, Eliad Tsfadia, Doron Chen, Ronen I. Kat:
Securing the Storage Data Path with SGX Enclaves. CoRR abs/1806.10883 (2018) - [i1]Danny Harnik, Paula Ta-Shma, Eliad Tsfadia:
It Takes Two to #MeToo - Using Enclaves to Build Autonomous Trusted Systems. CoRR abs/1808.02708 (2018) - 2017
- [j1]Iftach Haitner, Eliad Tsfadia:
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol. SIAM J. Comput. 46(2): 479-542 (2017) - [c2]Niv Buchbinder
, Iftach Haitner, Nissan Levi, Eliad Tsfadia:
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA 2017: 2580-2600 - 2014
- [c1]Iftach Haitner, Eliad Tsfadia:
An almost-optimally fair three-party coin-flipping protocol. STOC 2014: 408-416
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-07 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
