activity
20182026
collaborators
Showing cs.CRShow all

7 papers · 1 filter

cs.CR2025

Differentially Private Quasi-Concave Optimization: Bypassing the Lower Bound and Application to Geometric Problems

Kobbi Nissim, Eliad Tsfadia, Chao Yan

We study the sample complexity of differentially private optimization of quasi-concave functions. For a fixed input domain , Cohen et al. (STOC 2023) proved that any g…

cs.CR2025

Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer

Iftach Haitner, Noam Mazor, Jad Silbak +2

In distributed differential privacy, multiple parties collaborate to analyze their combined data while each party protects the confidentiality of its data from the others. Interest…

cs.CR2024

Data Reconstruction: When You See It and When You Don't

Edith Cohen, Haim Kaplan, Yishay Mansour +4

We revisit the fundamental question of formally defining what constitutes a reconstruction attack. While often clear from the context, our exploration reveals that a precise defini…

cs.CR2021

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

Iftach Haitner, Eliad Tsfadia

In a multiparty fair coin-flipping protocol, the parties output a common (close to) unbiased bit, even when some corrupted parties try to bias the output. Cleve [STOC 1986] has sho…

cs.CR2021

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

Itay Berman, Iftach Haitner, Eliad Tsfadia

Hardness amplification is a central problem in the study of interactive protocols. While ``natural'' parallel repetition transformation is known to reduce the soundness error of so…

cs.CR2018

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

Danny Harnik, Paula Ta-Shma, Eliad Tsfadia

We provide enhanced security against insider attacks in services that manage extremely sensitive data. One example is a #MeToo use case where sexual harassment complaints are repor…