Upper and lower bounds on black-box steganography (Q1027982)

The present paper represents a cryptanalyst way to show the limitation of a cryptographically system. Starting from it, the authors show a secret-key stegosystem. The entire work is structured like a full research report and the mathematically background is very clearly presented and proved. The secret-key stegosystem which it is proposed is efficient (the rate vs. number of samples tradeoff is very close to the lower bound, in fact, for channels with sufficient entropy, the optimal rate allowed by the lower bound and the achieved rate differ by \(\log_2 2e<2.5\) bits) and the proof for it is done.