关键词：通信；通信网络；信息交换；网络泵；隐蔽时间信道
摘 要：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 finite number of bits can be communicated.