Enping Li
ABSTRACT
The Square Root Law of Ker, Filler and Fridrich establishes asymptotic capacity limits for steganographic communication, caused by the watchful eye of a passive warden. We exhibit a separate fundamental limit of steganographic communication caused by a second phenomenon, the noise inflicted by an active warden. When a steganographic channel is not protected by a secret key, for example when it is used for key exchange, the number of errors needed to derail the channel grows no faster than the square root of the cover length. This means that contrary to intuition, embedding a message across a larger cover makes transmission less robust. This result is so pessimistic that it applies even to the transmission of a single datagram, a message of constant length, within a cover stream of arbitrary size. It is also true if the warden is forced by channel constraints to inflict noise randomly instead of surgically.
While this law does not apply when the sender and receiver share a key in advance, ultimately this result implies that an active warden can indefinitely postpone the initial handshake of steganographic communication with a vanishingly small error rate. It also causes us to question whether the notion of a supraliminal channel is physically realizable, as even very highly robust communications channels become increasingly vulnerable for larger covers.
- S. Craver, E. Li, and J. Yu. Protocols for data hiding in pseudo-random state. In Media Forensics and Security, page 72540, 2009.Google Scholar
- S. Craver, E. Li, J. Yu, and I. Atakli. Information hiding. chapter A Supraliminal Channel in a Videoconferencing Application, pages 283--293. Springer-Verlag, Berlin, Heidelberg, 2008. Google ScholarDigital Library
- T. Filler, A. D. Ker, and J. J. Fridrich. The square root law of steganographic capacity for markov covers. In Media Forensics and Security, page 725408, 2009.Google Scholar
- N. L. Johnson and S. Kotz. Continuous univariate distributions--l. In International Symposium on Mobile Agents, 1970.Google Scholar
- E. Li and S. Craver. A supraliminal channel in a wireless phone application. In Proceedings of the 11th ACM workshop on Multimedia and security, MM&Sec '09, pages 151--154, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- G. J. Simmons. The history of subliminal channels. In Proceedings of the First International Workshop on Information Hiding, pages 237--256, London, UK, 1996. Springer-Verlag. Google ScholarDigital Library
Index Terms
- A square-root law for active wardens
Recommendations
The square root law does not require a linear key
MM&Sec '10: Proceedings of the 12th ACM workshop on Multimedia and securitySquare root laws are theorems about imperfect steganography, embedding which fails to preserve all statistical properties of covers. They show that, in various situations, capacity of covers grows only with the square root of the available cover size. ...
The square root law requires a linear key
MM&Sec '09: Proceedings of the 11th ACM workshop on Multimedia and securityWe extend the square root law of steganographic capacity, for the simplest case of iid covers, in two ways. First, we show that the law still holds under a more realistic embedding assumption, where the payload is of fixed length (instead of, in the ...
The Square Root Law of Steganography: Bringing Theory Closer to Practice
IH&MMSec '17: Proceedings of the 5th ACM Workshop on Information Hiding and Multimedia SecurityThere are two interpretations of the term "square root law of steganography". As a rule of thumb, that the secure capacity of an imperfect stegosystem scales only with the square root of the cover size (not linearly as for perfect stegosystems), it acts ...
Comments