Efficient High Capacity Steganography Technique (2004.11984v1)

Abstract: Performance indicators characterizing modern steganographic techniques include capacity (i.e. the quantity of data that can be hidden in the cover medium), stego quality (i.e. artifacts visibility), security (i.e. undetectability), and strength or robustness (intended as the resistance against active attacks aimed to destroy the secret message). Fibonacci based embedding techniques have been researched and proposed in the literature to achieve efficient steganography in terms of capacity with respect to stego quality. In this paper, we investigated an innovative idea that extends Fibonacci-like steganography by bit-plane(s) mapping instead of bit-plane(s) replacement. Our proposed algorithm increases embedding capacity using bit-plane mapping to embed two bits of the secret message in three bits of a pixel of the cover, at the expense of a marginal loss in stego quality. While existing Fibonacci embedding algorithms do not use certain intensities of the cover for embedding due to the limitation imposed by the Zeckendorf theorem, our proposal solve this problem and make all intensity values candidates for embedding. Experimental results demonstrate that the proposed technique double the embedding capacity when compared to existing Fibonacci methods, and it is secure against statistical attacks such as RS, POV, and difference image histogram (DIH).