The ultimate steganalysis benchmark?

  • Authors:
  • Andrew D. Ker

  • Affiliations:
  • Oxford University, Oxford, United Kingdom

  • Venue:
  • Proceedings of the 9th workshop on Multimedia & security
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

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 suggested methods are presented, but no definitive answer emerges. As a simple case study, some steganalysis methods from the literature are evaluated using these techniques.