New results on steganographic capacity

Pierre Moulin, Ying Wang · 2004

This paper extends recent results on steganographic capacity. We derive capacity expressions for perfectly-secure steganographic systems. The warden may be passive, or active using a memoryless attack channel, or active using an arbitrarily varying channel. Neither encoder nor decoder know which channel was selected by the warden. In some cases, the steganographic constraint does not result in any capacity loss. To achieve steganographic capacity, encoder and decoder generally need to share a secret codebook.

Read the paper · More papers on PaperTik