21 March 2005 On the choice of risk optimal data embedding strategy, safe embedding rate, and passive steganalysis
Author Affiliations +
Suppose Alice the information hider wants to send a stego message to Bob in the presence of Wendy the (passive) warden. Wendy employs one of n different passive steganalysis detectors to decide if the data from Alice contains any hidden message before passing it on to Bob. Suppose Alice can choose from a set of information hiding schemes and possesses only an incomplete information about the steganalysis strategy choice of Wendy. That is, suppose Alice only knows an ordering of the probabilities (and not the values themselves), say, p1p2 ≥ ... ≥ pn where pj is the probability of Wendy using jth detector. Under this scenario we investigate answers to the following two questions by generalizing a previous result by the author and deriving new ones: (a) how must Alice choose the optimal data hiding strategy subject to risk constraints and (b) what is the maximum safe embedding rate, i.e., maximum message rate that can be embedded without being detected by Wendy? Detailed analysis and numerical results are presented to answer these questions.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Rajarathnam Chandramouli, "On the choice of risk optimal data embedding strategy, safe embedding rate, and passive steganalysis", Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); doi: 10.1117/12.591875; https://doi.org/10.1117/12.591875


One improved LSB steganography algorithm
Proceedings of SPIE (March 13 2013)
Reverse-engineering a detector with false alarms
Proceedings of SPIE (February 27 2007)
Steganalysis using logistic regression
Proceedings of SPIE (February 10 2011)
Steganography capacity: a steganalysis perspective
Proceedings of SPIE (June 20 2003)
Steganalysis of block-structured stegotext
Proceedings of SPIE (June 22 2004)

Back to Top