Pure Differentially Private Query Release via Laplace Input Smoothing
We study the offline release of a public family of $k$ statistical queries on a database of $N$ records from a public universe of size $d$, under pure $\varepsilon$-differential privacy. We give an efficient algorithm that, with probability at least $1-\beta$, answers all queries simultaneously to error $$O\left(\min\l...