Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Eliad Tsfadia"
download as .bib file
@inproceedings{DBLP:conf/colt/PeterTU24,
author = {Naty Peter and
Eliad Tsfadia and
Jonathan R. Ullman},
editor = {Shipra Agrawal and
Aaron Roth},
title = {Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting
Fingerprinting Codes},
booktitle = {The Thirty Seventh Annual Conference on Learning Theory, June 30 -
July 3, 2023, Edmonton, Canada},
series = {Proceedings of Machine Learning Research},
volume = {247},
pages = {4207--4239},
publisher = {{PMLR}},
year = {2024},
url = {https://proceedings.mlr.press/v247/peter24a.html},
timestamp = {Fri, 05 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/PeterTU24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-06465,
author = {Eliad Tsfadia},
title = {On Differentially Private Subspace Estimation Without Distributional
Assumptions},
journal = {CoRR},
volume = {abs/2402.06465},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.06465},
doi = {10.48550/ARXIV.2402.06465},
eprinttype = {arXiv},
eprint = {2402.06465},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-06465.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2405-15753,
author = {Edith Cohen and
Haim Kaplan and
Yishay Mansour and
Shay Moran and
Kobbi Nissim and
Uri Stemmer and
Eliad Tsfadia},
title = {Data Reconstruction: When You See It and When You Don't},
journal = {CoRR},
volume = {abs/2405.15753},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2405.15753},
doi = {10.48550/ARXIV.2405.15753},
eprinttype = {arXiv},
eprint = {2405.15753},
timestamp = {Wed, 19 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2405-15753.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/NissimST23,
author = {Kobbi Nissim and
Uri Stemmer and
Eliad Tsfadia},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Adaptive Data Analysis in a Balanced Adversarial Model},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/51ba8a68f471d952af625d1faf55e6c6-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/NissimST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-15452,
author = {Kobbi Nissim and
Uri Stemmer and
Eliad Tsfadia},
title = {Adaptive Data Analysis in a Balanced Adversarial Model},
journal = {CoRR},
volume = {abs/2305.15452},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.15452},
doi = {10.48550/ARXIV.2305.15452},
eprinttype = {arXiv},
eprint = {2305.15452},
timestamp = {Tue, 06 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-15452.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-07604,
author = {Naty Peter and
Eliad Tsfadia and
Jonathan R. Ullman},
title = {Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting
Fingerprinting Codes},
journal = {CoRR},
volume = {abs/2307.07604},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.07604},
doi = {10.48550/ARXIV.2307.07604},
eprinttype = {arXiv},
eprint = {2307.07604},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-07604.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Tsfadia22,
author = {Eliad Tsfadia},
title = {On Cryptographic Hardness, Differential Privacy, and the Interconnection
Between Them},
school = {Tel Aviv University, Israel},
year = {2022},
url = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma9933425419304146},
timestamp = {Fri, 03 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/phd/il/Tsfadia22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurocrypt/HaitnerMRT22,
author = {Iftach Haitner and
Nikolaos Makriyannis and
Samuel Ranellucci and
Eliad Tsfadia},
editor = {Orr Dunkelman and
Stefan Dziembowski},
title = {Highly Efficient OT-Based Multiplication Protocols},
booktitle = {Advances in Cryptology - {EUROCRYPT} 2022 - 41st Annual International
Conference on the Theory and Applications of Cryptographic Techniques,
Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {13275},
pages = {180--209},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-06944-4\_7},
doi = {10.1007/978-3-031-06944-4\_7},
timestamp = {Tue, 31 May 2022 17:23:10 +0200},
biburl = {https://dblp.org/rec/conf/eurocrypt/HaitnerMRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/TsfadiaCKMS22,
author = {Eliad Tsfadia and
Edith Cohen and
Haim Kaplan and
Yishay Mansour and
Uri Stemmer},
editor = {Kamalika Chaudhuri and
Stefanie Jegelka and
Le Song and
Csaba Szepesv{\'{a}}ri and
Gang Niu and
Sivan Sabato},
title = {FriendlyCore: Practical Differentially Private Aggregation},
booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July
2022, Baltimore, Maryland, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {162},
pages = {21828--21863},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v162/tsfadia22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:52 +0200},
biburl = {https://dblp.org/rec/conf/icml/TsfadiaCKMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaitnerMST22,
author = {Iftach Haitner and
Noam Mazor and
Jad Silbak and
Eliad Tsfadia},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On the complexity of two-party differential privacy},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1392--1405},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519982},
doi = {10.1145/3519935.3519982},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HaitnerMST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/CohenKMST21,
author = {Edith Cohen and
Haim Kaplan and
Yishay Mansour and
Uri Stemmer and
Eliad Tsfadia},
editor = {Marina Meila and
Tong Zhang},
title = {Differentially-Private Clustering of Easy Instances},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {2049--2059},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/cohen21c.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/CohenKMST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/systor/ChenFHKT21,
author = {Doron Chen and
Michael Factor and
Danny Harnik and
Ronen I. Kat and
Eliad Tsfadia},
editor = {Bruno Wassermann and
Michal Malka and
Vijay Chidambaram and
Danny Raz},
title = {Length preserving compression: marrying encryption with compression},
booktitle = {{SYSTOR} '21: The 14th {ACM} International Systems and Storage Conference,
Haifa, Israel, June 14-16, 2021},
pages = {15:1--15:12},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3456727.3463780},
doi = {10.1145/3456727.3463780},
timestamp = {Thu, 14 Oct 2021 09:52:00 +0200},
biburl = {https://dblp.org/rec/conf/systor/ChenFHKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-08820,
author = {Niv Buchbinder and
Iftach Haitner and
Nissan Levi and
Eliad Tsfadia},
title = {Fair Coin Flipping: Tighter Analysis and the Many-Party Case},
journal = {CoRR},
volume = {abs/2104.08820},
year = {2021},
url = {https://arxiv.org/abs/2104.08820},
eprinttype = {arXiv},
eprint = {2104.08820},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-08820.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-00801,
author = {Itay Berman and
Iftach Haitner and
Eliad Tsfadia},
title = {A Tight Parallel Repetition Theorem for Partially Simulatable Interactive
Arguments via Smooth KL-Divergence},
journal = {CoRR},
volume = {abs/2105.00801},
year = {2021},
url = {https://arxiv.org/abs/2105.00801},
eprinttype = {arXiv},
eprint = {2105.00801},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-00801.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-00850,
author = {Iftach Haitner and
Eliad Tsfadia},
title = {An Almost-Optimally Fair Three-Party Coin-Flipping Protocol},
journal = {CoRR},
volume = {abs/2105.00850},
year = {2021},
url = {https://arxiv.org/abs/2105.00850},
eprinttype = {arXiv},
eprint = {2105.00850},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-00850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-07664,
author = {Iftach Haitner and
Noam Mazor and
Jad Silbak and
Eliad Tsfadia},
title = {On the Complexity of Two-Party Differential Privacy},
journal = {CoRR},
volume = {abs/2108.07664},
year = {2021},
url = {https://arxiv.org/abs/2108.07664},
eprinttype = {arXiv},
eprint = {2108.07664},
timestamp = {Fri, 20 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-07664.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-10132,
author = {Eliad Tsfadia and
Edith Cohen and
Haim Kaplan and
Yishay Mansour and
Uri Stemmer},
title = {FriendlyCore: Practical Differentially Private Aggregation},
journal = {CoRR},
volume = {abs/2110.10132},
year = {2021},
url = {https://arxiv.org/abs/2110.10132},
eprinttype = {arXiv},
eprint = {2110.10132},
timestamp = {Mon, 25 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-10132.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-14445,
author = {Edith Cohen and
Haim Kaplan and
Yishay Mansour and
Uri Stemmer and
Eliad Tsfadia},
title = {Differentially-Private Clustering of Easy Instances},
journal = {CoRR},
volume = {abs/2112.14445},
year = {2021},
url = {https://arxiv.org/abs/2112.14445},
eprinttype = {arXiv},
eprint = {2112.14445},
timestamp = {Wed, 05 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-14445.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HaitnerMST21,
author = {Iftach Haitner and
Noam Mazor and
Jad Silbak and
Eliad Tsfadia},
title = {On the Complexity of Two-Party Differential Privacy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-124}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/124},
eprinttype = {ECCC},
eprint = {TR21-124},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HaitnerMST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/HaitnerMRT21,
author = {Iftach Haitner and
Nikolaos Makriyannis and
Samuel Ranellucci and
Eliad Tsfadia},
title = {Highly Efficient OT-Based Multiplication Protocols},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {1373},
year = {2021},
url = {https://eprint.iacr.org/2021/1373},
timestamp = {Fri, 12 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iacr/HaitnerMRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BermanHT20,
author = {Itay Berman and
Iftach Haitner and
Eliad Tsfadia},
editor = {Daniele Micciancio and
Thomas Ristenpart},
title = {A Tight Parallel Repetition Theorem for Partially Simulatable Interactive
Arguments via Smooth KL-Divergence},
booktitle = {Advances in Cryptology - {CRYPTO} 2020 - 40th Annual International
Cryptology Conference, {CRYPTO} 2020, Santa Barbara, CA, USA, August
17-21, 2020, Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {12172},
pages = {544--573},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-56877-1\_19},
doi = {10.1007/978-3-030-56877-1\_19},
timestamp = {Mon, 28 Aug 2023 21:17:50 +0200},
biburl = {https://dblp.org/rec/conf/crypto/BermanHT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/KaplanMST20,
author = {Haim Kaplan and
Yishay Mansour and
Uri Stemmer and
Eliad Tsfadia},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Private Learning of Halfspaces: Simplifying the Construction and Reducing
the Sample Complexity},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/a08e32d2f9a8b78894d964ec7fd4172e-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/KaplanMST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07839,
author = {Haim Kaplan and
Yishay Mansour and
Uri Stemmer and
Eliad Tsfadia},
title = {Private Learning of Halfspaces: Simplifying the Construction and Reducing
the Sample Complexity},
journal = {CoRR},
volume = {abs/2004.07839},
year = {2020},
url = {https://arxiv.org/abs/2004.07839},
eprinttype = {arXiv},
eprint = {2004.07839},
timestamp = {Tue, 21 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07839.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BermanHT19,
author = {Itay Berman and
Iftach Haitner and
Eliad Tsfadia},
title = {A Tight Parallel-Repetition Theorem for Random-Terminating Interactive
Arguments},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-049}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/049},
eprinttype = {ECCC},
eprint = {TR19-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BermanHT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/BermanHT19,
author = {Itay Berman and
Iftach Haitner and
Eliad Tsfadia},
title = {A Tight Parallel-Repetition Theorem for Random-Terminating Interactive
Arguments},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {393},
year = {2019},
url = {https://eprint.iacr.org/2019/393},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/BermanHT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/systor/FederGT18,
author = {Oshrit Feder and
Gidon Gershinsky and
Eliad Tsfadia},
title = {RestAssured: Securing Cloud Analytics},
booktitle = {Proceedings of the 11th {ACM} International Systems and Storage Conference,
{SYSTOR} 2018, HAIFA, Israel, June 04-07, 2018},
pages = {120},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3211890.3211908},
doi = {10.1145/3211890.3211908},
timestamp = {Wed, 21 Nov 2018 12:44:27 +0100},
biburl = {https://dblp.org/rec/conf/systor/FederGT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-10883,
author = {Danny Harnik and
Eliad Tsfadia and
Doron Chen and
Ronen I. Kat},
title = {Securing the Storage Data Path with {SGX} Enclaves},
journal = {CoRR},
volume = {abs/1806.10883},
year = {2018},
url = {http://arxiv.org/abs/1806.10883},
eprinttype = {arXiv},
eprint = {1806.10883},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-10883.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-02708,
author = {Danny Harnik and
Paula Ta{-}Shma and
Eliad Tsfadia},
title = {It Takes Two to {\#}MeToo - Using Enclaves to Build Autonomous Trusted
Systems},
journal = {CoRR},
volume = {abs/1808.02708},
year = {2018},
url = {http://arxiv.org/abs/1808.02708},
eprinttype = {arXiv},
eprint = {1808.02708},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-02708.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HaitnerT17,
author = {Iftach Haitner and
Eliad Tsfadia},
title = {An Almost-Optimally Fair Three-Party Coin-Flipping Protocol},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {2},
pages = {479--542},
year = {2017},
url = {https://doi.org/10.1137/15M1009147},
doi = {10.1137/15M1009147},
timestamp = {Tue, 02 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HaitnerT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderHLT17,
author = {Niv Buchbinder and
Iftach Haitner and
Nissan Levi and
Eliad Tsfadia},
editor = {Philip N. Klein},
title = {Fair Coin Flipping: Tighter Analysis and the Many-Party Case},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2580--2600},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.170},
doi = {10.1137/1.9781611974782.170},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/BuchbinderHLT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaitnerT14,
author = {Iftach Haitner and
Eliad Tsfadia},
editor = {David B. Shmoys},
title = {An almost-optimally fair three-party coin-flipping protocol},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {408--416},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591842},
doi = {10.1145/2591796.2591842},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HaitnerT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-07-27 14:06 CEST from data curated 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:
