A Round-Based Cover Traffic Algorithm for Anonymity Systems

In this paper we propose a new cover traffic generation algorithm for flow-based anonymity systems and compare it with other algorithms from the literature. Our algorithm is based on four ideas: fixed time rounds, flow classification with different protection methods for different classes, protection depending on the potential cost and finally, use of history. Simulation results show that our solution provides sufficient protection while reducing overhead traffic.