A capacity result for batch steganography

doi:10.1109/LSP.2006.891319

2007-08-01

Andrew D. Ker *

DOI：10.1109/LSP.2006.891319

原文链接

原文求助

摘要

En 中文

The problems of batch steganography and pooled steganalysis, proposed in [1], generalize the problems of hiding and detecting hidden data to multiple covers. It was conjectured that, given covers of uniform capacity and a quantitative steganalysis method satisfying certain assumptions, secure steganographic capacity is proportional only to the square root of the number of covers. We now prove that, with respect to a natural definition of secure capacity, and in a suitably asymptotic sense, this conjecture is true. This is in sharp contrast to capacity results for noisy channels.

Keyword:

channel capacity

communication systems

information hiding

steganography