1 citations · 1 across the 10 of their papers we have counts for
8 papers · 1 filter
Dithered Gaussian Mechanism for Randomness-Efficient Differential Privacy
Nikita P. Kalinin, Rasmus Pagh
We present the dithered Gaussian mechanism, an alternative to the discrete Gaussian mechanism for differential privacy that discretizes the private output rather than the noise dis…
Privacy by Postprocessing the Discrete Laplace Mechanism
Quentin Hillebrand, Jacob Imola, Rasmus Pagh +1
We show that an "old dog", the classical discrete Laplace (aka.~geometric) mechanism, can "perform new tricks": 1. It can be post-processed to yield a simple, unbiased estimator of…
Piquant: Private Quantile Estimation in the Two-Server Model
Hannah Keller, Jacob Imola, Fabrizio Boninsegna +2
Quantiles are key in distributed analytics, but computing them over sensitive data risks privacy. Local differential privacy (LDP) offers strong protection but lower accuracy than…
Private Lossless Multiple Release
Joel Daniel Andersson, Lukas Retschmeier, Boel Nelson +1
Koufogiannis et al. (2016) showed a result for Laplace noise-based differentially private mechanisms: given an -DP release, a new release wi…
Lightweight Protocols for Distributed Private Quantile Estimation
Anders Aamand, Fabrizio Boninsegna, Abigail Gentle +2
Distributed data analysis is a large and growing field driven by a massive proliferation of user devices, and by privacy concerns surrounding the centralised storage of data. We co…
Count on Your Elders: Laplace vs Gaussian Noise
Joel Daniel Andersson, Rasmus Pagh, Teresa Anna Steiner +1
In recent years, Gaussian noise has become a popular tool in differentially private algorithms, often replacing Laplace noise which dominated the early literature. Gaussian noise i…
Continual Counting with Gradual Privacy Expiration
Joel Daniel Andersson, Monika Henzinger, Rasmus Pagh +2
Differential privacy with gradual expiration models the setting where data items arrive in a stream and at a given time the privacy loss guaranteed for a data item seen at time…
Profile Reconstruction from Private Sketches
Hao Wu, Rasmus Pagh
Given a multiset of items from , the \emph{profile reconstruction} problem is to estimate, for , the fraction of items in $\mathca…