Image Steganalysis with Binary Similarity Measures
- PDF / 532,841 Bytes
- 9 Pages / 600 x 792 pts Page_size
- 75 Downloads / 208 Views
Image Steganalysis with Binary Similarity Measures ˙Ismail Avcıbas¸ Department of Electronics Engineering, Uluda˘g University, 16059 Bursa, Turkey Email: [email protected]
Mehdi Kharrazi Department of Electrical and Computer Engineering, Polytechnic University, Brooklyn, NY 11201, USA Email: [email protected]
Nasir Memon Department of Computer and Information Science, Polytechnic University, Brooklyn, NY 11201, USA Email: [email protected]
¨ Bulent Sankur ˙ Department of Electrical and Electronics Engineering, Bo˘gazic¸i University, 34342 Istanbul, Turkey Email: [email protected] Received 14 March 2004; Revised 10 May 2005; Recommended for Publication by Mauro Barni We present a novel technique for steganalysis of images that have been subjected to embedding by steganographic algorithms. The seventh and eighth bit planes in an image are used for the computation of several binary similarity measures. The basic idea is that the correlation between the bit planes as well as the binary texture characteristics within the bit planes will differ between a stego image and a cover image. These telltale marks are used to construct a classifier that can distinguish between stego and cover images. We also provide experimental results using some of the latest steganographic algorithms. The proposed scheme is found to have complementary performance vis-`a-vis Farid’s scheme in that they outperform each other in alternate embedding techniques. Keywords and phrases: steganography, steganalysis, universal steganalysis.
1.
INTRODUCTION
Steganography refers to the science of “invisible” communication, where communication between two parties is undetectable by an eavesdropper. This is quite different from cryptography, where the goal is to make the content of the communications inaccessible to an eavesdropper. In contrast, steganographic techniques strive to hide the very presence of the message or communication itself from an observer. The subject is best explained in terms of the prisoner’s problem [2], where Alice and Bob are two inmates who wish to communicate in order to hatch an escape plan. However, all communication between them is examined by the warden, Wendy, who will put them in solitary confinement at the slightest suspicion of covert communication. Specifically, in the general model for steganography we have Alice wishing to send a secret message m to Bob. In order to do so, she “embeds” m into a cover object c, to obtain the stego object s. The stego object is then sent through the public channel.
In a pure steganography framework, the technique for embedding the message is unknown to Wendy and shared as a secret between Alice and Bob. However, it is generally not considered as good practice to rely on the secrecy of the algorithm itself. In private key steganography Alice and Bob share a secret key, which is used to embed the message. The secret key, for example, can be a password used to seed a pseudorandom number generator to select pixel locations in an image cover object for embedding the secret me
Data Loading...
