학술논문

Characterizing the Efficacy of the NRL Network Pump in Mitigating Covert Timing Channels
Document Type
Periodical
Source
IEEE Transactions on Information Forensics and Security IEEE Trans.Inform.Forensic Secur. Information Forensics and Security, IEEE Transactions on. 7(1):64-75 Feb, 2012
Subject
Signal Processing and Analysis
Computing and Processing
Communication, Networking and Broadcast Technologies
Timing
Noise
Cryptography
Upper bound
Noise measurement
Materials
Encoding
Information-theoretic bounds
network security
NRL network pump
queueing theory
timing channels
Language
ISSN
1556-6013
1556-6021
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.