论文标题
离散时间更新系统中的隐私泄漏
Privacy Leakage in Discrete Time Updating Systems
论文作者
论文摘要
源生成了时间stamp的更新数据包，这些数据包被发送到服务器，然后转发到监视器。这发生在存在对手的情况下，该对手可以通过观察服务器的输出过程来推断有关源的信息。该服务器希望及时发布更新，以便将其最小化，以最大程度地减少泄漏给对手的信息。我们分析了信息时代（AOI）与源为伯努利过程产生更新的系统的最大泄漏之间的权衡。在发送更新需要一个插槽的时间插槽系统中，我们考虑三个服务器策略：（1）无内存的Bernoulli Thinning（MBT）：到达更新以某种概率和几何固定时间后释放了一定的概率和主线更新； （2）确定性的累积和降点（爸爸）：固定时间后发布了最近生成的更新（如果有）； （3）随机累积和dump（rad）：在几何等待时间之后释放了最近生成的更新（如果有）。我们表明，与其他两个政策相比，DAD政策的年龄较低，但仅限于离散的年龄渗透性操作点。
A source generates time-stamped update packets that are sent to a server and then forwarded to a monitor. This occurs in the presence of an adversary that can infer information about the source by observing the output process of the server. The server wishes to release updates in a timely way to the monitor but also wishes to minimize the information leaked to the adversary. We analyze the trade-off between the age of information (AoI) and the maximal leakage for systems in which the source generates updates as a Bernoulli process. For a time slotted system in which sending an update requires one slot, we consider three server policies: (1) Memoryless with Bernoulli Thinning (MBT): arriving updates are queued with some probability and head-of-line update is released after a geometric holding time; (2) Deterministic Accumulate-and-Dump (DAD): the most recently generated update (if any) is released after a fixed time; (3) Random Accumulate-and-Dump (RAD): the most recently generated update (if any) is released after a geometric waiting time. We show that for the same maximal leakage rate, the DAD policy achieves lower age compared to the other two policies but is restricted to discrete age-leakage operating points.
