Determining achievable rates for secure zero divergence steganography

K. Sullivan, K. Solanki, B. S. Manjunath, U. Madhow, and S. Chandrasekaran
Dept. of Electrical and Computer Engineering
University of California at Santa Barbara
Santa Barbara CA 93106


In steganography (the hiding of data into innocuous covers for secret communication) it is difficult to estimate how much data can be hidden while still remaining undetectable. To measure the inherent detectability of steganography, Cachin [1] suggested the e- secure measure, where e is the Kullback Leibler (K-L) divergence between the cover distribution and the distribution after hiding. At zero divergence, an optimal statistical detector can do no better than guessing; the data is undetectable. The hider's key question then is, what hiding rate can be used while maintaining zero divergence? Though work has been done on the theoretical capacity of steganography, it is often difficult to use these results in practice. We therefore examine the limits of a practical scheme known to allow embedding with zero-divergence. This scheme is independent of the embedding algorithm and therefore can be generically applied to find an achievable secure hiding rate for arbitrary cover distributions.
[PDF] [BibTex]
K. Sullivan, K. Solanki, B.S. Manjunath, U. Madhow and S. Chandrasekaran,
IEEE International Conference on Image Processing 2006 (ICIP06), Atlanta, GA USA, Oct. 2006.
Node ID: 445 , DB ID: 248 , Lab: VRL , Target: Proceedings
Subject: [Digital Watermarking and Data Hiding] « Look up more