A survey of timing channels and countermeasures

AK Biswas, D Ghosal, S Nagaraja - ACM Computing Surveys (CSUR), 2017 - dl.acm.org
A timing channel is a communication channel that can transfer information to a
receiver/decoder by modulating the timing behavior of an entity. Examples of this entity …

An operational approach to information leakage

I Issa, AB Wagner, S Kamath - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
Given two random variables X and Y, an operational approach is undertaken to quantify the
“leakage” of information from X to Y. The resulting measure L (X→ Y) is called maximal …

Sharp moment-entropy inequalities and capacity bounds for symmetric log-concave distributions

M Madiman, P Nayar, T Tkocz - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We show that the uniform distribution minimizes entropy among all one-dimensional
symmetric log-concave distributions with fixed variance, as well as various generalizations …

Capacity of queues via point-process channels

R Sundaresan, S Verdú - IEEE transactions on information …, 2006 - ieeexplore.ieee.org
A conceptually simple proof for the capacity formula of an exponential server timing channel
is provided. The proof links the timing channel to the point-process channel with …

Capacity of systems with queue-length dependent service quality

A Chatterjee, D Seo… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
We study the information-theoretic limit of reliable information processing by a server with
queue-length dependent quality of service. We define the capacity for such a system as the …

Feedback Increases the Capacity of Queues with Finite Support Service Times

KR Sahasranand, A Tchamkerten - 2023 IEEE International …, 2023 - ieeexplore.ieee.org
In their" Bits Through Queues" paper, Anantharam and Verdú showed that if the service time
is memoryless feedback does not increase capacity under a FIFO policy, and further …

Capacity bounds on timing channels with bounded service times

SH Sellke, CC Wang, N Shroff… - 2007 IEEE International …, 2007 - ieeexplore.ieee.org
It is well known that queues with exponentially distributed service times have the smallest
Shannon capacity among all single-server queues with the same service rate. In this paper …

Stabilizing a linear system using phone calls

MJ Khojasteh, M Franceschetti… - 2019 18th European …, 2019 - ieeexplore.ieee.org
We consider the problem of stabilizing an undisturbed, scalar, linear system over a “timing”
channel, namely a channel where information is communicated through the timestamps of …

The rate-distortion function of a Poisson process with a queueing distortion measure

TP Coleman, N Kiyavash… - … Conference (dcc 2008), 2008 - ieeexplore.ieee.org
This paper presents a proof of the rate distortion function of a Poisson process with a
queuing distortion measure that is in complete analogy with the proofs associated with the …

Practical codes for queueing channels: An algebraic, state-space, message-passing approach

TP Coleman, N Kiyavash - 2008 IEEE Information Theory …, 2008 - ieeexplore.ieee.org
This paper examines more closely the probabilistic dynamics of queueing timing channels
and discusses a new practical coding scheme which is tailored to them and approaches …