A Covert Timing Channel via Algorithmic Complexity Attacks: Design and Analysis

Abstract

A covert channel is a communication channel that bypasses the access controls of the system, and it is a threat to the system's security. In this paper, we propose a new covert timing channel which exploits the algorithmic complexity vulnerabilities in the name lookup algorithm of the kernel. This covert channel has a high capacity and it is practically exploitable. In our experiments, the data rate reaches 2256 bps under a very low error rate. This data rate is high enough for practical use. So our covert channel is dangerous. To our knowledge, no previous works propose this covert channel nor implement it.We describe our design and implementation of the covert channel on a SELinux system, discuss the subtle issues that arose in the design, present performance data of the covert channel and analyse its capacity.

The Power of Evil Choices in Bloom Filters

“…In most of these works, weak non-cryptographic hash functions were responsible for the attacks. The general impact of these attacks was DoS [39] or the creation of covert channels [40]. Our work contributes to algorithmic complexity attacks in three aspects.…”