Steganographic Communication in Ordered Channels
In this paper, the authors focus on estimating the amount of information that can be embedded in the sequencing of packets in ordered channels. Ordered channels, e.g. TCP, rely on sequence numbers to recover from packet loss and packet reordering. They propose a formal model for transmitting information by packet-reordering. They present natural and well-motivated channel models and jamming models including the k-distance permuter, the k-buffer permuter and the k-stack permuter. They define the natural information-theoretic (continuous) game between the channel processes (max-min) and the jamming process (min-max) and prove the existence of a Nash equilibrium for the mutual information rate.