1 citations · 1 across the 7 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.LG2024
Streaming Private Continual Counting via Binning
Joel Daniel Andersson, Rasmus Pagh
In differential privacy, refers to problems in which we wish to continuously release a function of a dataset that is revealed one element at a time…
cs.CR2024
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…
cs.CR2024
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…