Continual Counting with Gradual Privacy Expiration

arXiv:2406.03802v1 Announce Type: new
Abstract: Differential privacy with gradual expiration models the setting where data items arrive in a stream and at a given time $t$ the privacy loss guaranteed for a data item seen at time $(t-d)$ is $\epsilon g(d)$, where $g$ is a monotonically non-decreasing function. We study the fundamental $\textit{continual (binary) counting}$ problem where each data item consists of a bit, and the algorithm needs to output at each time step the sum of all …

arxiv binary cs.cr cs.ds data differential privacy epsilon expiration function loss non privacy stream study