research
∙
11/07/2021
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds
A dynamic algorithm against an adaptive adversary is required to be corr...
share
research
∙
05/03/2021
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
In his seminal work, Cleve [STOC '86] has proved that any r-round coin-f...
research
∙
09/28/2020
On the Round Complexity of the Shuffle Model
The shuffle model of differential privacy was proposed as a viable model...
research
∙
03/10/2020
Closure Properties for Private Classification and Online Prediction
Let H be a class of boolean functions and consider acomposed class H' th...
research
∙
12/18/2019
The power of synergy in differential privacy:Combining a small curator with local randomizers
Motivated by the desire to bridge the utility gap between local and trus...
research
∙
05/03/2019
Exploring Differential Obliviousness
In a recent paper Chan et al. [SODA '19] proposed a relaxation of the no...
research
∙
02/27/2019
Private Center Points and Learning of Halfspaces
We present a private learner for halfspaces over an arbitrary finite dom...
research
∙
10/31/2018
Privacy Preserving Multi-Agent Planning with Provable Guarantees
In privacy-preserving multi-agent planning, a group of agents attempt to...
research
∙
07/10/2014