A Covert Queueing Channel in FCFS Schedulers
Preprint
Abstract
We study covert queueing channels (CQCs), which are a kind of covert timing channel that may be exploited in shared queues across supposedly isolated users. In our system model, a user modulates messages to another user via his pattern of access to the shared resource scheduled in a first-come-first-served (FCFS) manner. One example of such a channel is the cross-virtual network covert channel in data center networks resulting from the queueing effects of the shared resource. First, we study a system comprising a transmitter and a receiver that share a deterministic and work-conserving FCFS scheduler, and we compute the capacity of this channel. We also consider the effect of the presence of other users on the information transmission rate of this channel. The achievable information transmission rates obtained in this study demonstrate the possibility of significant information leakage and great privacy threats brought by CQCs in FCFS schedulers.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Quantifying the Information Leakage in Timing Side Channels in Deterministic Work-Conserving SchedulersIEEE/ACM Transactions on Networking, 2015
- Mitigating timing based information leakage in shared schedulers2012
- Characterizing the Efficacy of the NRL Network Pump in Mitigating Covert Timing ChannelsIEEE Transactions on Information Forensics and Security, 2011
- Uncovering Spoken Phrases in Encrypted Voice over IP ConversationsACM Transactions on Information and System Security, 2010
- Low-Cost Side Channel Remote Traffic Analysis Attack in Packet Networks2010
- A network pumpIEEE Transactions on Software Engineering, 1996
- Bits through queuesIEEE Transactions on Information Theory, 1996