The ultimate steganalysis benchmark?

  title={The ultimate steganalysis benchmark?},
  author={Andrew D. Ker},
We present a new benchmark for binary steganalysis methods, based on the asymptotic information (in the entropic sense) it gives about the presence of hidden data. The theoretical foundation is quite unlike ad hoc performance measures found in steganalysis literature that are based on false positive and negative rates. It is argued that this new metric is an application-independent long-run measure of true performance. There are some challenges to computing the benchmark empirically, and some… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-5 of 5 references

An information-theoretic model for steganography

Inf. Comput. • 2004
View 5 Excerpts
Highly Influenced

Detection of LSB Steganography via Sample Pair Analysis

Information Hiding • 2002
View 4 Excerpts
Highly Influenced

Divergence estimation of continuous distributions based on data-dependent partitions

IEEE Transactions on Information Theory • 2005
View 3 Excerpts
Highly Influenced

Steganalysis of additive-noise modelable information hiding

Security and Watermarking of Multimedia Contents • 2003
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…