Balancing Timeliness and Privacy in Discrete-Time Updating Systems

TL;DR

This paper investigates the balance between information freshness and privacy leakage in discrete-time systems, proposing optimal policies for different server strategies to minimize Age of Information while controlling maximal leakage.

Contribution

It introduces a comparative analysis of coupled and decoupled policies, showing decoupled dumping policies outperform coupled ones in age-leakage trade-offs.

Findings

Decoupled dumping policies provide better age-leakage trade-offs.

Optimal dumping strategies involve dithering between two deterministic periods.

Decoupled policies outperform coupled policies in the age-leakage trade-off.

Abstract

We study the trade-off between Age of Information (AoI) and maximal leakage (MaxL) in discrete-time status updating systems. A source generates time-stamped update packets that are processed by a server that delivers them to a monitor. An adversary, who eavesdrops on the server-monitor link, wishes to infer the timing of the underlying source update sequence. The server must balance the timeliness of the status information at the monitor against the timing information leaked to the adversary. We consider a model with Bernoulli source updates under two classes of Last-Come-First-Served (LCFS) service policies: (1) Coupled policies that tie the server's deliveries to the update arrival process in a preemptive queue; (2) Decoupled (dumping) policies in which the server transmits its freshest update according to a schedule that is independent of the update arrivals. For each class, we characterize the structure of the optimal policy that minimizes AoI for a given MaxL rate. Our analysis reveals that decoupled dumping policies offer a superior age-leakage trade-off to coupled policies. When subject to a MaxL constraint, we prove that the optimal dumping strategy is achieved by dithering between two adjacent deterministic dump periods.