2 citations · 4 across the 4 of their papers we have counts for
5 papers
Optimizing Hierarchical Queries for the Attribution Reporting API
Matthew Dawson, Badih Ghazi, Pritish Kamath +8
We study the task of performing hierarchical queries based on summary reports from the {\em Attribution Reporting API} for ad conversion measurement. We demonstrate that methods fr…
Efficiently Estimating Erdos-Renyi Graphs with Node Differential Privacy
Adam Sealfon, Jonathan Ullman
We give a simple, computationally efficient, and node-differentially-private algorithm for estimating the parameter of an Erdos-Renyi graph---that is, estimating p in a G(n,p)---wi…
Population stability: regulating size in the presence of an adversary
Shafi Goldwasser, Rafail Ostrovsky, Alessandra Scafuro +1
We introduce a new coordination problem in distributed computing that we call the population stability problem. A system of agents each with limited memory and communication, as we…
Shortest Paths and Distances with Differential Privacy
Adam Sealfon
We introduce a model for differentially private analysis of weighted graphs in which the graph topology is assumed to be public and the private information consists only of…
Agreement in Partitioned Dynamic Networks
Adam Sealfon, Aikaterini Sotiraki
In the dynamic network model, the communication graph is assumed to be connected in every round but is otherwise arbitrary. We consider the related setting of -partitioned dynam…