Characterizing the Efficacy of the NRL Network Pump in Mitigating Covert Timing Channels
- 1 August 2011
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 7 (1) , 64-75
Abstract
The Naval Research Laboratory (NRL) Network Pump, or Pump, is a standard for mitigating covert channels that arise in a multilevel secure (MLS) system when a high user (HU) sends acknowledgements to a low user (LU). The issue here is that HU can encode information in the "timings" of the acknowledgements. The Pump aims at mitigating the covert timing channel by introducing buffering between HU and LU, as well as adding noise to the acknowledgment timings. We model the working of the Pump in certain situations, as a communication system with feedback and use then this perspective to derive an upper bound on the capacity of the covert channel between HU and LU in the Pump. This upper bound is presented in terms of a directed information flow over the dynamics of the system. We also present an achievable scheme that can transmit information over this channel. When the support of the noise added by Pump to acknowledgment timings is finite, the achievable rate is nonzero, i.e., infinite number of bits can be reliably communicated. If the support of the noise is infinite, the achievable rate is zero and hence a finite number of bits can be communicated.Keywords
This publication has 28 references indexed in Scilit:
- IP Covert Channel DetectionACM Transactions on Information and System Security, 2009
- Remote timing attacks are practicalComputer Networks, 2005
- The Capacity of Finite-State Markov Channels With FeedbackIEEE Transactions on Information Theory, 2005
- An information-theoretic and game-theoretic study of timing channelsIEEE Transactions on Information Theory, 2002
- A network pumpIEEE Transactions on Software Engineering, 1996
- Bits through queuesIEEE Transactions on Information Theory, 1996
- The channel capacity of a certain noisy timing channelIEEE Transactions on Information Theory, 1992
- Blind Signatures for Untraceable Payments1983
- The Bidirectional Communication Theory--A Generalization of Information TheoryIEEE Transactions on Communications, 1973
- A note on the confinement problemCommunications of the ACM, 1973