Header menu link for other important links
Steganographic communication in ordered channels
Rajsekar Manokaran,
Published in
Volume: 4437 LNCS
Pages: 42 - 57
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]. © Springer-Verlag Berlin Heidelberg 2007.
About the journal
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Open AccessNo
Concepts (11)
  •  related image
  •  related image
    Nash equilibrium
  •  related image
  •  related image
  •  related image
    Embedded systems
  •  related image
    Error detection
  •  related image
    Game theory
  •  related image
    Model checking
  •  related image
    Packet loss
  •  related image
    Security of data
  •  related image
    Communication channels (information theory)