Steganographic communication in ordered channels

Authors:
R. C. Chakinala;A. Kumarasubramanian;R. Manokaran;G. Noubir;C. Pandu Rangan;R. Sundaram
Affiliations:
Northeastern University, Boston, MA;Northeastern University, Boston, MA;Northeastern University, Boston, MA;Northeastern University, Boston, MA;Indian Institute of Technology - Madras, Chennai;Northeastern University, Boston, MA
Venue:
IH'06 Proceedings of the 8th international conference on Information hiding
Year:
2006

Citing 3
Cited 5

Indexing permutations

Journal of Computing Sciences in Colleges
A Mathematical Theory of Communication

A Mathematical Theory of Communication
Asymptotically good codes correcting insertions, deletions, and transpositions

IEEE Transactions on Information Theory

Disappearing Cryptography: Information Hiding: Steganography & Watermarking

Disappearing Cryptography: Information Hiding: Steganography & Watermarking
On the secondary capacity of the communication protocols

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Evaluating the transmission rate of covert timing channels in a network

Computer Networks: The International Journal of Computer and Telecommunications Networking
A framework for avoiding steganography usage over HTTP

Journal of Network and Computer Applications
Cloak: a ten-fold way for reliable covert communications

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we 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. We propose a formal model for transmitting information by packet-reordering. We present natural and well-motivated channel models and jamming models including the k- distance permuter, the k-buffer permuter and the k-stack permuter. We 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. We study the zero-error (discrete) equivalent and provide error-correcting codes with optimal performance for the distance-bounded model, along with efficient encoding and decoding algorithms. One outcome of our work is that we extend and complete D. H. Lehmer's attempt to characterize the number of distance bounded permutations by providing the asymptotically optimal bound - this also tightly bounds the first eigenvalue of a related state transition matrix [1].