On Information Hiding with Incomplete Information About Steganalysis (TA-S2)

Author(s) : Rajarathnam Chandramouli (Stevens Institute of Technology, USA)

Abstract : Suppose the information hider has a set of information hiding schemes to be employed in the presence of a set of steganalysis detectors. Let the information hider have only an incomplete information about the steganalysis detectors. That is, suppose the probability of the $j$th steganalysis detector will be used is $p_j$ $j=1,2\ldots n$, then the information hider only knows the ordering of these probabilities, say, $p_1\geq p_2\geq \ldots \geq p_n$. Under this circumstance how can the information hider choose the {\em optimal} embedding strategy? This is the question addressed in this paper. Theoretical analysis and some numerical results are presented in this version of the manuscript. Additional numerical results for some popular image steganalysis detectors will be presented in the final version of the paper.

Menu