An information-theoretic and game-theoretic study of timing channels
- 7 November 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 48 (9), 2455-2477
- https://doi.org/10.1109/tit.2002.801405
Abstract
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for continuous-time or discrete-time packet waveforms. Fluid waveform approximations of each of these classes of waveforms are employed to aid in analysis. Channel capacity is defined and an information-theoretic game based on mutual information rate is studied. Min-max optimal jammers and max-min optimal input processes are sought. Bounds on the min-max and max-min mutual information rates are described, and numerical examples are given. For maximum-delay-constrained (MDC) jammers with continuous-time packet waveforms, saddle-point input and jammer strategies are identified. The capacity of the maximum-delay constrained jamming channel with continuous-time packet waveforms is shown to equal the mutual information rate of the saddle point. For MDC jammers with discrete-time packet waveforms, saddle-point strategies are shown to exist. Jammers which have quantized batch departures at regular intervals are shown to perform well. Input processes with batches at regular intervals perform well for MDC or maximum-buffer-size-constrained jammers.Keywords
This publication has 32 references indexed in Scilit:
- A bandwidth computation model for covert storage channels and its applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Simple timing channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Covert channels-here to stay?Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multiple Trojan horse systems and covert channel analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Capacity estimation and auditability of network covert channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Elements of Information TheoryPublished by Wiley ,2001
- Robust decoding for timing channelsIEEE Transactions on Information Theory, 2000
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Auditing the use of covert storage channels in secure systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Coding for a class of unknown channelsIEEE Transactions on Information Theory, 1966