Paper Info
Title
Steganographic communication in ordered channels
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].
Year
Venue
Keywords
2006
Information Hiding
distance-bounded model,ordered channel,k-buffer permuter,steganographic communication,k-stack permuter,channel process,distance permuter,asymptotically optimal,distance bounded permutation,mutual information rate,formal model,packet loss,error correction code,mutual information,state transition,nash equilibrium
Field
DocType
Volume
Computer science,Permutation,Network packet,Packet loss,Theoretical computer science,Mutual information,Decoding methods,Jamming,Channel capacity,Bounded function
Conference
4437
ISSN
Citations 
PageRank 
0302-9743
13
0.79
References 
Authors
3
6
Name
Order
Citations
PageRank
R. C. Chakinala1181.37
A. Kumarasubramanian2181.37
R. Manokaran3181.37
Guevara Noubir488775.90
C. Pandu Rangan51434149.57
Ravi Sundaram676272.13