On the capacity of stegosystems
Pedro Comesaña, Fernando Pérez‐González · 2007
Among the different applications where data hiding techniques can be used, one that has received huge attention in the last years is steganography. In that scenario, not just the embedded message is hidden, but the communication process itself is tried to be concealed. In spite of the numerous works in this field, the capacity of a perfect stegosystem (meaning a system where it is impossible to know if a given signal is watermarked or not) is still an open question in the data hiding community. In this paper we deal with the capacity of a discrete perfect stegosystem using some optimization procedures, and also present a lower-bound to the capacity of a perfect Gaussian stegosystem; interestingly this bound approaches the capacity of an AWGN channel (without host signal or the perfect steganography constraint) for small (compared with the power of the host) values of the embedding power. Furthermore, we apply the methodology used in this Gaussian scheme to a lattice-based embedding structure, introducing some promising results.