KEYWORDS
|
Adaptive Pixel Pair Matching (APPM), Blowfish, Edge based Adaptive Pixel Pair Matching (EAPPM). |
INTRODUCTION
|
Data communication over the internet can be made secure and private by using two security mechanisms namely, cryptography and steganography. Typically cryptography based communication have four steps: encrypting, sending, receiving and decrypting. Sender encrypts the data and the sends it to the receiver. Whereas the receiver receives the encrypted data which has to be decrypted in order to read the original message. Since a cryptographic algorithm can be easily cracked by the attackers using average computation power, a parallel research field named Steganography had been developed which tries to hide data in a cover medium. This paper presents the idea of combining both cryptography and steganography mechanisms, which will increase the overall security of a communication through a open channel. |
In such a combined system, it becomes even harder to get the secret data due to the complexity in the process of extracting the encrypted data from stego file and then deciphering it. But developing such a system increases the time complexity of the algorithm. In order to reduce the time complexity, the combined system uses a symmetric key encryption (Blowfish) algorithm [14] [11] in cryptography module. Since symmetric key encryption algorithm [14] [11] [13] takes small amount of computation time and taking only a small amount of the system assets to perform encryption and decryption against asymmetric key encryption. To increase the security in steganography, the stego module perform edge detection on the cover image file then performs the Adaptive Pixel Pair Matching (APPM) method to hide the encrypted data into the cover file over the edge of the image. |
This paper is organized as follows: Section II will give an overview of the works related to this proposed system. The proposed system is divided into two modules: Crypto module and Stego module. These modules are briefly discussed in Section III. Section IV will give the experimental results and analysis of Edge based Adaptive Pixel Pair Matching along with normal Adaptive Pixel Pair Matching method. Section V will walk through the conclusion of the paper. |
RELATED WORKS
|
The security of Steganography method depends on the following aspects: detection of the data present in the stego file, and removal of those data from the stgo file. Once a method gives difficulty to those aspects then the method is consider to be secure one, but it is not easy to satisfy. Least-significant bit (LSB) is the most widely used Steganography method as it is easy to implement but the detection of data and extraction of the data from the stego file can be easily done. Hence the problem with LSB method is that the data can be easily detected and extracted from the stego file using simple steganalysis method. |
A Pixel Pair Matching (PPM) [6] approach for steganography had been proposed, which is improvement of LSB matching; this method uses two pixels as an embedding unit while LSB uses single pixel value. Chao et.al [12] proposed a diamond encoding (DE) method which enhance the payload of exploiting modification direction (EMD) [18] method. Hong and Chen [17] proposed Adaptive Pixel Pair Matching (APPM) method based on the concept of Pixel Pair Matching (PPM. Suppose a data to be hiding in a pixel value, first calculate the modular distance for that pixel then find neighbourhood pixel according to the calculated modular distance. Once the neighbourhood pixel is calculated, it will be replaced by the original pixel value. |
PROPOSED WORK
|
Steganography methods are used to hide the existence of secret data in a cover file. The confidentiality of the hidden information is an important aspect that is to be considered. To ensure confidentiality of a secret data, in this paper a new approach of embedding encrypted data into an image cover file has been proposed. As Blowfish [14] [11] is the best performing algorithm compared with all other most widely used symmetric key algorithms.The proposed method first encrypts the data using Blowfish encryption algorithm. It also has an advantage that Blowfish is very harder to crack since it uses the key length values varying from 32 bits to 448 bits. The next step is to embed the encrypted data into an image cover file using EAPPM method. Figure 1 gives overview of the proposed system. |
A. Blowfish Encryption Algorithm |
Blowfish [13] [15] is a 64-bit block cipher with a variable-length key. Key expansion and data encryption are the two parts of Blowfish algorithm. The key expansion step converts 448 bit key into 4168 bytes. It uses a Single P-array that has size of 18 and four S-boxes that have size of 256. |
The overall process of data encryption consists of six steps as shown in Figure 2. Data encryption has a simple function which is iterated 16 times. In each round a 32 bit subkey is XOR-ed with leftmost 32 bits of plaintext and the result is then passed to the F function of Blowfish. |
This result becomes rightmost 32 bits for the next round and the output of F function is XOR-ed with the original rightmost 32 (XR) bits of plaintext becomes leftmost 32 (XL) bits for the next round function and proceeds. The Function F follows: |
F(XL) = {{S1[a] + S2[b] mod 232} • S3[c]} + S4[d] mod 232 |
Where, S1, S2, S3 and S4 are S-boxes 1, 2, 3 and 4 respectively. |
Figures 3a and 3b are snippet of text file before and after encrypting the data by Blowfish encryption algorithm. |
B Edge based Adaptive Pixel Pair Matching (EAPPM) |
Normal human visual system notifies the alteration in soft areas of an image rather than sharp areas in that. In order to find sharp areas of an image an edge detection mechanism is used. There are many edge detection methods like Canny, Fuzzy, Sobel and Laplacian filters [1] which are commonly used and these sharp edges are used to hide the data using steganography method which gives good results than the normal steganography method. For this reason the proposed method embed the data in sharp areas. |
Figure 4.1a and 4.2a is the couple of sample images taken as input to the Sobel operator and the outcome of edge based images are 4.1b and 4.2b. From the outcome of images the sharp areas of the original image are recorded. |
Select a pixel from the recorded sharp areas to embed data in that. Suppose a pixel (x, y) is selected to embed the data digit (ma) then calculate the modular distance by md by using formula 2 and 3. The next step is to find the neighbourhood pixel (x+x(md), y+y(md)) of (x, y) based on figure 5. Once the neighbourhood pixel is calculated, it is replaced by the original pixel (x,y). |
In order to extract the data from a stego file, initially the stego file is given to the Sobel operator to find the sharp areas in the image and those pixel values are recorded. Suppose a pixel (x’,y’) is selected to extract the data from it, calculate f(x’,y’) by using the formula 3. The result will give the embedded data digit in it. |
EXPERIMENTAL SETUP AND RESULTS
|
The proposed technique has been applied on a set of 10 sample text files with various sizes (ranges from 250 bytes to 4000 bytes) over a set of 50 sample cover images. A data file as in figure 3a is taken for the experimental process, the crypt file figure 3b of the taken data file is generated by using the Blowfish encryption algorithm. In order to embed the encrypted data file in the cover images 4.1a and 4.2a, the data is converted into Hexastring format. |
The pixel ranges starting from {(30,210),(31,209),..} are the outcome of sobel operator of image lena (Figure 4.2a the pixel ranges are highlighted in a binary image of lena is shown in Figure 4.2b. Now the Hexastring values are converted into bit values then use the EAPPM method to embed the data. |
A 5x11 window which is marked with yellow color Rectangle in the binary edge image show in figure 4.2b is taken as example. This zoomed view of the window is shown in figure 7a. The text file shown in figure 3a has to be embedded in the cover image shown in figure 4.2a. Consider the edge pixel value (31,224) from the figure 7a, if 6 is the data bit to be hidden in the selected pixel (31,224) the corresponding neighborhood pixel is calculated by using the equations 2 and 3 as follows: |
Md = 6 – f(31,224) mod 16 |
= 6 – [(31+6*224) mod 16] mod 16 |
= 6 – [0 mod 16] mod 16 = 6 |
So the corresponding neighborhood pixel is (32,225) calculated as shown in figure 5. Similarly the neighborhood pixels are calculated for all other edge pixels. The original pixels are replaced by the neighborhood pixels. After embedding all the content of the data file the sample window is as shown in figure 7b. The original values of edge pixels present in the sample window and the calculated neighborhood pixel values before and after embedding is tabulated in table 1. |
For the purpose of analysis of the proposed system the process is also subjected to APPM method over a text file and crypt file. The obtained stego images from both APPM and EAPPM embedding process are subjected to image quality analysis. The image quality measures used for analysis are Structural content (SC), Normalized cross correlation (NCC), Peak Signal to Noise Ratio (PSNR), mean Square Error (MSE). |
Structural content is a measure of structural quality of an image if it value is placed at one, it means that image is of better quality. If value is too large then it is a poor quality image. Normalized cross correlation is a measure of how much similar the given images are. If it value tends to one then it said that both are very much similar. Highest PSNR value and lowest MSE value represents a better quality image. Figure 6.1 and 6.2 show a sample of two images which have been used for analysis. |
Experimental results for two sample images are recorded and show in table 2, 3 and 4. Table 2 is a comparison of image quality parameters of stego images which are obtained after embedding the text file and table 3 gives a comparison of those parameters of stego images obtained after embedding a crypto file. From the table 2 it is seen that the value of SC is nearly one and NCC value is also one and hence we can say that the images are similar to the original after embedding the text. The stego image obtained after edge based APPM method have highest PSNR value and lowest MSE value which shows that EAPPM have better performance in terms of image quality. Similarly from table 3 it can be said that Edge based Adaptiive Pixel Pair matching method is best. |
Table 4 shows a comparison of image quality measures of stego files obtained using EAPPM over a text file and crypt file. From table 4 it is seen that SC value and NCC value of a text file are nearly one which seems to be better than a crypt file. Similarly the value of PSNR is high and MSE is low for a text file. This results show that EAPPM is better over a text file than a crypt file. |
CONCLUSION
|
The experimental results show that edge based APPM is better than normal APPM method. EAPPM gives better performance for a text file over the crypt file in terms of image quality. Compared to image quality, the confidentiality of the secret data is the most important aspect in an open channel communication. In terms of security EAPPM over a crypt file is highly secure than EAPPM over a normal text file. Hence it is concluded that EAPPM over a crypt file can be considered as the best steganography method which ensures high confidentiality to the embedded secret data. |
Tables at a glance
|
|
|
|
|
Table 1 |
Table 2 |
Table 3 |
Table 4 |
|
|
Figures at a glance
|
|
|
|
|
|
Figure 1 |
Figure 2 |
Figure 3 |
Figure 4 |
Figure 5 |
|
|
|
|
Figure 6 |
Figure 7 |
Figure 8 |
Figure 9 |
|
|
References
|
- Anastasia Ioannidou, Spyros T. Halkidis, George Stephanides “A novel technique for image steganography based on a high payload method and edge detection”, Expert Systems with Applications 39 (2012) 11517–11524.
- Cheng-HsingYang “Inverted pattern approach to improve image quality of information hiding by LSB substitution”, Journal of Pattern Recognition 41 (2008) 2674 – 2683.
- Chi-Kwong Chan, L.M. Cheng “Hiding data in images by simple LSB substitution” Journal of Pattern Recognition 37 (2004) 469 – 474.
- Eric Cole.”Hiding in Plain Sight: Steganography and the Art of Covert Communication”.
- Ingemar J. Cox, Matthew L. Miller, Jeffrey A. Bloom, Jessica Fridrich, and Ton Kalker.”Digital Watermarking and Steganography”, Second Edition 2008.
- Jarno Mielikainen “LSB Matching Revisited” ieee signal processing letters, vol. 13, no. 5, may 2006.
- Jianjun Wang ,YitingSun et.al. “An improved section-wise exploiting modification direction method”, Journal of Signal Processing 90 (2010) 2954–2964.
- National Bureau of Standards – 3-Data Encryption Standard, FIPS Publication 46, 1977.
- National Bureau of Standards – Data Encryption Standard, FIPS Publication 46, 1977.
- NIST, "Advanced Encryption Standard Call", NIST, 1997. http://www.nist.gov/aes/
- Verma O P, Ritu Agarwal, Dhiraj Dafouti, Shobha Tyagi “Peformance Analysis of Data Encryption Algorithms” Electronics Computer Technology (ICECT), 2011 3rd International Conference.
- Ruey-Ming Chao, Hsien-ChuWu, Chih-Chiang Lee, and Yen-Ping Chu “A Novel Image Data Hiding Scheme with Diamond Encoding” ” EURASIP Journal on Information Security Volume 2009.
- Schneier B. “Description of a New Variable-length Key 64- Bit Block Cipher (Blowfish).” Fast Software Encryption, Cambridge Security Workshop Proceedings (December 1993), Springer-Verlag, 1994, pp. 191-204. http://www.schneier.com/paper-blowfishfse.html
- Shanmugam.E and Dr.T.K.Thivakaran, “Performance Comparison of AES and Blowfish for Dual Layer Security in an Open Channel”. 3rd Indian Conference on Computational Intelligence (ICCI), April 2013.
- Stallings, Cryptography & Network Security - Principles & Practice, Prentice Hall, 3rd Edition 2002.
- Stefan Katzenbeisser and Fabien A “Information Hiding Techniques for Steganography and Digital Watermarking”.
- Wien Hong and Tung-Shou Chen “A Novel Data Embedding Method Using Adaptive Pixel Pair Matching”, IEEE transactions on information forensics and security, vol. 7, no. 1, february 2012.
|