In the current era, transmission and storing of medical data in the digital form is of great concern and thus the requirement for content authentication has aroused. As a solution to these, digital watermarking techniques and encryption schemes have been used to secure medical data like medical images. In this paper a combination of two algorithms to provide image authentication for medical images in the compressed format is proposed. In the proposed method, the watermark image is encrypted using the Enhanced modified RC6 block cipher (EMRC6) algorithm and the encrypted watermark image is watermarked using the simple Least significant Bit (LSB) watermarking technique. The watermarked output image shows no visual imparity and the watermark which has been extracted has no visual difference. The test results show that the watermarked image has high quality and the watermark is very secure. Also the PSNR value of proposed method is 44.966 on an average and 43.0633 for the existing system where LSB technique is integrated with MRC6 for security of watermark. Hence the work is aimed to increase the embedding volume and make the watermark more secure which is the basic requirement of medical image security.
In the recent era where the data are being transformed into digital content, the need for security of medical images becomes intense. Digital Asset and Right Management Systems (DARMS) is intended to be used with data that are either encrypted or compressed. Encryption schemes are used to provide security to digital data like text, image, audio, video, etc. Encryption is a process in which the input is combined with a key to produce an output that is not in the human readable form. Similarly watermarking methods are used to minimize forgery in the digital data that is being stored in a computer or being transferred over the network.
The method of embedding an image inside the cover image for the purpose of security is called watermarking. Larobina explained various medical image formats that can be used for watermarking [1] . As compressed images are mainly used as input in digital watermarking algorithms, Rabbani described a lossless image compression format for storing images of any type that occupies less storage space in [2] . To overcome the weaknesses of digital signature for content authentication, many researchers proposed watermarking techniques for digital data authentication. In digital signature, content modification or data tampering can be found out. But the location where such alteration has been found could not be identified [3] - [6] .
In addition to watermarking techniques, encryption schemes increase the reliability and security of digital content. Depending on the technology used, cryptographic methods are difficult to detect. The usage of an additional key makes it more robust. Watermarking is said to be a form of communication, since the basic task of watermarking is the reliable embedding and detection of digital content. Secure delivery of content is a major task of cryptography in addition to providing reliability. The decrypted form of the content has no protection in cryptography, but it is complimented by watermarking techniques by embedding the watermark inside the digital content. Thus the “analog hole” created by encryption schemes can be sealed by watermarking techniques [7] - [10] .
Lot of researchers combined watermarking schemes with encryption algorithms to increase the security of the digital content. RSA, Paillier, Goldwasser-Micali, Elgamelare asymmetric encryption schemes with homomorphic property and they have their downsides. There is loss of compression efficiency in the output cipher text if the message size is small and compression loss is reduced, but the payload capacity decreases if the message size is large in the above said schemes [11] - [14] .
The downsides of those are overcome by RC4 symmetric stream cipher scheme with homomorphic property which was proposed by Subramanyam et al. [15] . The chances of data trade-off attacks which are based on the key scheduling algorithm are caused by low sampling resistance in RC4 [16] . The symmetric block cipher RC5 which is more secure and robust than RC4 due to its increased number of rounds to work with the watermarking schemes used in [15] was proposed by Gayathri I.K. [17] . With less than 18 rounds RC5-64 algorithm (64-bit blocks) is prone to differential attack, when the chosen plain text is 244 [17] . RC6 is being used instead of RC5 due to its increased use of registers which was proposed by Kukoo Anna Mathew [18] .
Elashry in [19] proposed a method in which LSB is integrated with RC6 to provide security with good image quality. But RC6 undergoes differential linear attack, statistical attack and X2 attack [20] - [22] . Later to overcome the disadvantages of RC6 an Enhanced version of RC6 (ERC6) is used. It has 8 working registers and it acts on 256-bits input/output blocks.ERC6 encrypts at about 17.3 MB/sec making it about 1.7 times faster than RC6. But it is prone to X2 attack up to 44 rounds [23] .
So in order to overcome the drawbacks of ERC6 a modified version of RC6 (MRC6) is being found with better performance. It uses sixteen working registers instead of four registers in RC6. MRC6 achieves greater security at fewer rounds thus increasing the throughput with minimum encryption/decryption time [24] . But the Enhanced Modified Version of RC6 (EMRC6) has 32 working registers instead of sixteen in MRC6, and integer multiplication is used as an extra primitive operation which intensifies the diffusion obtained per round thus attaining high security and maximum throughput in less number of rounds [25] .
LSB technique is used where the embedding process is simple. It is one in which the image pixels of the cover image are replaced by the bits from the secret message. Embedding can be done in any of the eight bits in a bit plane. Bamatraf proposed a LSB technique where the hiding of data is done in the third and fourth LSB of the cover image [26] .
Singh et al. proposed a watermarking method using replacement of second LSB with inverse of LSB which is a powerful method for image authentication and copyright protection [27] . Puneet analysed various image watermarking using LSB algorithms and the results show that the hiding of the secret data in the first bit is without noticeable distortion on it [28] .
The current work is intended to convert the input into JPEG2000 format and encrypt the watermark with LSB watermarking scheme and then watermarking the encrypted watermark with EMRC6 encryption scheme so as to provide content authentication.
Figure 1 shows the basic model for content authentication, in which the cover image is a color image and the watermark image is the one that has to be embedded in to the cover/input image. The watermark image in encrypted using any encryption scheme and the output encrypted watermark is then watermarked using any spatial or frequency domain watermarking algorithm producing the final watermarked output.
2. Proposed System
The proposed system is aimed at combining LSB watermarking method with Enhanced Modified Version of RC6 (EMRC6) encryption scheme to provide content authentication for compressed images. The cover image “I” may be of any image type and is given as input to the JPEG2000 encoder. The JPEG2000 encoder processes the input image by undergoing five stages by dividing the image into rectangular tile that does not overlap and then it undergoes discrete wavelet transformation (DWT) and is quantized and is further divided into different bit planes.
This is then block coded with optimized truncation which results in stream of compressed byte which is packed into different wavelet packets. This JPEG2000 encoded output is represented as “Ij”.
The watermark image represented as “Wm” is encrypted using Enhanced Modified Version of RC6 (EMRC6). The encryption process takes the input watermark and is converted into stream of bits. This is encrypted using the key “K” which is generated from the key of “b” bytes supplied by the user. The encryption process has a round function which has 16 rotations per round. The input stream undergoes 18 such rounds to produce the output ciper “Ew”. The Encoded cover image “Ij” and the output cipher “Ew” are given as input to the LSB watermarking scheme
The LSB embedding scheme replaces few characteristics of the last bit of each pixel of the cover image “Ij” with few information from the watermark image “Wm”. A pseudo Random Number generator (PRNG) that produces a seed value is used with the LSB embedding in order to overcome the attacks on LSB embedding since LSB is a fragile scheme. Thus the output of the embedding process is the watermarked image “We” which is highly secure and has good image quality. The Peak signal to noise ratio (PSNR) value is high and the Mean Square Error (MSE) value is low when compared to the previous method where LSB technique is integrated with MRC6. This method increases embedding volume and make the watermark more secure thus providing content authentication for compressed medical images. Figure 2 shows the embedding of the watermark in the encrypted image.
Basic model for content authentication
Embedding of watermark
2.1. JPEG2000 Encoder
In the Proposed algorithm the input is any image and this image is converted into JPEG 2000 compressed code image using JPEG 2000 encoder by undergoing five steps. First the image is split into non overlapping tiles which are unsigned values and is reduced by a constant value. Then Discrete wavelet Transformation (DWT) is done followed by quantization and further the co-efficient are split into different bit-planes using embedded block coding with optimized truncation (EBCOT) coding method. As a final step compressed stream are packed into different wavelet packages [29] .
2.2. Enhanced Modified Rivest Cipher 6 (EMRC6)
EMRC6 (32/18/16) has 32 registers each with ‘w’ bit words, whereas the working registers is less in numbers in the previous version of RC6. EMRC6 has an integer multiplication as an extra basic operation which increases the diffusion attained per round. This provides high security, increase in number of rounds and greater throughput. It can process 1024 bits as a single block per round. The EMRC6 algorithm has three basic modules.
1) EMRC6 key expansion.
2) EMRC6 encryption.
3) EMRC6 decryption.
2.2.1. EMRC6 Key Expansion
The key expansion algorithm of EMRC6 is almost similar to the one in the previous version of RC6. But the main difference in EMRC6 is, more number of words are extracted from the key supplied by the user. The key of length “b” bytes where 0 ≤ b ≤ 255 is supplied by the user. To this user defined key, enough zeroes are added to make the length of the key equal to non-zero integral values and stored in. These user supplied “b” bytes of keys is stored in another array “V” in the little endian format as. The values from “V” table is expanded and stored in a table, thus producing 16r + 32 sub keys. The left barrel shifter shifts the sub keys by three positions and the resultant is stored again in “T” table. The below algorithm shows the key expansion algorithm of EMRC6.
The two values Pw and Qw are called magic constants and is defined as
and (1)
where
e = 2.7182818 and Ø = 1.618033 is called the golden constant.
2.2.2. EMRC6 Encryption Algorithm
EMRC6 encryption module convert the input into the cipher output using the generated sub key. It uses 32 working registers () to store the initial input and the final output. The steps involved in EMRC6 encryption is
・ Addition (+)
・ Bitwise EX-OR operation
・ Left rotation, a <<< b.
・ Integer Multiplication modulo 2n (*).
The 32 working registers contain the initial input for the encryption process represented as R[ ]. The first byte of the input is stored in the LSB of first register i.e., R[0] and the last byte is stored in the MSB of the last register. For example, the assignment from right to left is parallel as (R1, R2, R3, R4) = (R2, R3, R4, R1).
2.2.3. EMRC6 Decryption Algorithm
The EMRC6 decryption process reproduces the original content from the cipher using the sub key. This is the inverse operation of EMRC6 encryption. The following algorithm represents the EMRC6 decryption process. Various steps involved in decryption process are
・ Integer subtraction (−)
・ Bit wise EX-OR
・ Integer multiplication
・ Right shift, a >>> b.
2.3. LSB Watermarking
Least significant Bit (LSB) technique is based on exchanging few characteristics of each pixel’s last bit with some of the information from the input image. The embedding can be done in any of the bit plane, but LSB embedding focuses on embedding in the least significant bit of each pixel. This bit plane is chosen in order to reduce the difference in colors in the watermarked image. Basically LSB embedding scheme is fragile and hence it can be easily broken. But it is being widely used because of its simplicity. This overcomes cropping attack but undergoes a number of attacks if all the LSB is changed to one. For example, Let “01110100” be the bits to be embedded into the least significant bit (LSB) of the input image values. The watermarked output obtained using LSB technique for the given sample input is shown in Table 1.
2.3.1. LSB Embedding Algorithm
The steps in LSB embedding algorithm is listed below
・ “Ew” is read and is stored as matrix element “Ew[][]”.
・ “Ij” is normalized and rounded off to the adjacent integer with a bit precision of eight.
・ Determine the size of “Ew” and “Ij”.
・ Expand “Ew[][]” such that the size of watermark is same as that of “Ij”. The Components in “Ew[][]” are individual bits that represent pixel values of the “Ew”.
・ “Ij” is split into pixel and stored in “Ij[][]”.
・ LSB of each element from “Ij[][]” is replaced by the matching elements from “Ew[][]”.
・ The resultant matrix is converted into the watermarked image.
2.3.2. LSB Extraction Algorithm
The steps in LSB extraction process is listed below
・ “We” is read and the pixel values are stored in “We[][]”.
・ Find the size of “We”.
・ An expansion matrix is formed by extracting the LSB of each pixels from “We[][]”.
・ The bits per pixel of “We” are determined and the bits are clustered based on it. The expansion matrix consists of repeated pattern of bits at constant intervals.
・ Thus multiple watermarks are recovered inside the expansion matrix.
3. Analyzing and Evaluating the Performance3.1. Analyzing EMRC6 Encryption
EMRC6 is better than any other version of RC6 due to its increased complexity, security and throughput. The EMRC6 encryption is three times faster than RC6 and the throughput is high when compared to its predecessor MRC6. Table 2 shows the comparison between various parameters of EMRC6 and the parameters of other version of RC6.
Watermarked image values
Input
Watermark
Watermarked Output
00011100
0
00011100
11110010
1
11110011
01011000
1
01011001
10011010
1
10011011
00100111
0
00100110
11101000
1
11101001
11001000
0
11001000
00110101
0
00110100
Comparisons of RC6 versions
Parameters
RC6
ERC6
MRC6
EMRC6
w/r/b
32/20/16
32/16/16
32/16/16
32/18/16
Working Registers
4
8
16
32
Block size (bits)
128
256
512
1024
No. of rounds
20
16
16
18
Rotations per round
2
4
8
16
Encryption time (sec. for 4 MB)
0.281
0.251
0.201
0.171
Throughput (Mb/s)
10.8
17.3
19.5
34.13
Sub-keys
2r + 4
4r + 8
8r + 16
16r + 32
Speed
1 unit
1.7 times faster than RC6
Twice faster than RC6
Thrice faster than RC6
Attack
Linear, differential, chi-squared attack
chi-squared attack
chi-squared attack
No attack
3.2. Security Issues
The diffusion per round in achieved by the use of multiplication which provides high security in lesser number of rounds. Because of sixteen rotations per round the complexity of the algorithm is increased which proportionally increases the security. It is robust against differential linear attack, statistical attack and chi-square attack due to its increased no of rotations per round [25] .
Figure 3 shows that the encryption time is increased with increase in the size of the data block. But when compared with the previous version of RC6 it has got better encryption time. Figure 4 shows the throughput
Consequence of encryption time over varied data size
Consequence of number of rounds on throughput
decreases with increased number of rounds which gives the conclusion that the security is high with more number of rounds since security and throughput are inversely proportional.
3.3. Correlation Coefficient
Correlation Coefficient is the value between pixels in the same place in the input image and watermarked image. Correlation Coefficient is used to measure the image quality between the pixels in the original image and watermarked cipher image at a particular location.
Coefficient Correlation is found using Equation (3).The Expectation and variant value to be substituted in Equation (3) is found using Equation (4) and Equation (5).
where,
& are Expectation of pixel from and
& are Variants of pixel from and.
Table 3 shows the correlation coefficient of three sample images for the existing method and the proposed method which concludes that the correlation coefficient is low for the proposed method is low when compared with other encryption scheme.
3.4. Analysis of LSB Embedding Efficiency
The image quality of the output watermarked cipher image “We” is found using the PSNR and MSE calculation. Equation (6) depicts the PSNR calculation and Equation (7) calculates the MSE value.
where
m is the row values of the images.
n is the column values of the images.
x, y is the pixel values of the images.
The PSNR value from Table 4 predicts that the PSNR value of the sample images is high when compared with the previous method and hence the quality of the watermarked cipher image is of good quality for the proposed method. Table 5 includes the output of each level and the overall output, for the test images.
Comparison of correlation coefficient
Image
Nike
Lenna
Girls
Correlation coefficient of Existing Method
0.0001749
0.0033
0.00016
Correlation coefficient of Proposed Method
0.00016
0.0021
0.00002
PSNR of the watermarked encrypted Image
IMAGE
Nike.png
Lenna.bmp
Girls.jpg
PSNR of Existing Method
41.82
42.31
45.06
PSNR of Proposed Method
43.6
44.1
47.2
Overall output for test data
Image
Watermark
Encrypted watermark
Watermarked cipher output
Size of the Original Image
45 Kb
657 Kb
68 Kb
Size of the Watermark Image
6 Kb
18 Kb
10 Kb
PSNR of Watermarked cipher image (Proposed System)
43.6
44.1
47.2
PSNR of Watermarked cipher image (existing System)
41.82
42.31
45.06
Correlation coefficient of encrypted watermark (Proposed System)
0.00016
0.0021
0.00002
Correlation coefficient of encrypted watermark (existing System)
0.0001749
0.0033
0.00016
4. Conclusions
The combination of EMRC6 (Enhanced modified version of RC6) Scheme with LSB (Lest Significant bit) is a proper method for medical image authentication. The input image is converted into JPEG2000 image to make encryption and embedding scheme simple. EMRC6 provides high security since it withstands almost all attacks which was imposed on previous RC6 version. The security level of watermark is increased by this encryption and the watermark embedding capacity also improved. Even though LSB is a fragile watermark scheme, it is best suited for content authentication. But the watermark is encrypted to make the watermark robust. So that extraction of the watermark is difficult. The encryption speed of EMRC6 is high and the throughput is high when compared with its predecessor. The correlation coefficient is very low proving that the image quality is good. After embedding the PSNR value is high and MSE value is low when compared with other algorithm.
The upcoming work is to provide copyright production using a frequency domain algorithm and EMRC6 encryption scheme.
Cite this paper
S. J. Jereesha Mary,C. Seldev Christopher,S. Sebastin Antony Joe, (2016) Novel Scheme for Compressed Image Authentication Using LSB Watermarking and EMRC6 Encryption. Circuits and Systems,07,1722-1733. doi: 10.4236/cs.2016.78149
ReferencesLarobina, M. and Murino, L. (2014) Medical Image File Formats. Journal of Digital Imaging, 27, 200-206.Rabbani, M. and Joshi, R. (2002) An Overview of the JPEG 2000 Still Image Compression Standard. Signal Processing: Image Communication, 17, 3-48. http://dx.doi.org/10.1016/S0923-5965(01)00024-8Wang, M.S. and Chen, W.C. (2007) A Majority-Voting Based Watermarking Scheme for Colour Image Tamper Detection and Recovery. Computer Standards & Interfaces, 29, 561-570. http://dx.doi.org/10.1016/j.csi.2006.11.009Eggers, J.J. and Girod, B. (2001) Blind Watermarking Applied to Image Authentication. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, 3, 1977-1980. http://dx.doi.org/10.1109/icassp.2001.941335Lin, E.T., Podilchuk, C.I. and Delp, E.J. (2000) Detection of Image Alterations Using Semi-Fragile Watermarks. In: Electronic Imaging, International Society for Optics and Photonics, 152-163. http://dx.doi.org/10.1117/12.384969Kundur, D. and Hatzinakos, D. (1999) Digital Watermarking for Telltale Tamper Proofing and Authentication. In: Proceedings of the IEEE, 87, 1167-1180. http://dx.doi.org/10.1109/5.771070Nadeem, A. and Javed, M.Y. (2006) A Performance Comparison of Data Encryption Algorithms. International Conference on Information and Communication Technologies, 27-28 August 2005, 84-89.Cox, I.J., Do?rr, G. and Furon, T. (2006) Watermarking Is Not Cryptography. In: Shi, Y. and Jeon, B., Eds., Digital Watermarking, Vol. 4283, Springer Berlin/Heidelberg, 1-15. http://dx.doi.org/10.1007/11922841_1 Farah, T., Hermassi, H., Rhoouma, R. and Belghith, S. (2013) Watermarking and Encryption Scheme to Secure Multimedia Information. World Congress on Computer and Information Technology (WCCIT), Sousse, 22-24 June 2013, 1-5. http://dx.doi.org/10.1109/wccit.2013.6618760Bouslimi, D., Coatrieux, G. and Roux, Ch. (2011) A Joint Watermarking/Encryption Algorithm for Verifying Medical Image Integrity and Authenticity in Both Encrypted and Spatial Domains. Annual International Conference of the IEEE Engineering in Medicine and Biology Society, Boston, 30 August 2011-3 September 2011, 8066-8069. http://dx.doi.org/10.1109/iembs.2011.6091989ElGamal, T. (1985) A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory, 31, 469-472. http://dx.doi.org/10.1109/TIT.1985.1057074Rivest, R., Shamir, A. and Adleman, L. (1978) A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Commun. ACM, 21, 120-126. http://dx.doi.org/10.1145/359340.359342Paillier, P. (1999) Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Lecture Notes in Computer Science, 1592, 223-238. http://dx.doi.org/10.1007/3-540-48910-x_16Goldwasser, S. and Micali, S. (1984) Probabilistic Encryption. Journal of Computer and System Sciences, 28, 270-299. http://dx.doi.org/10.1016/0022-0000(84)90070-9Subramanyam, A.V., Emmanuel, S. and Kankanhalli, M.S. (2010) Compressed Encrypted Domain JPEG2000 Image Watermarking. IEEE International Conference on Multimedia and Expo (ICME), Suntec City, 19-23 July 2010, 1315-1320. http://dx.doi.org/10.1109/icme.2010.5583571Fluhrer, S., Mantin, I. and Shamir, A. (2001) Weaknesses in the Key Scheduling Algorithm of RC4. In: Vaudenay, S. and Youssef, A.M., Eds., Selected Areas in Cryptography, Springer, Berlin, 1-24.Gayathri I.K. ,et al. (2013)Digital Watermarking Using RC5 Encryption on JPEG2000 Images International Journal of Engineering Research & Technology 2, 1439-1445.Mathew K.A. ,et al. (2013)Watermarking of JPEG2000 Compressed Images with Improved Encryption International Journal of Computer Applications Technology and Research 2, 245-249.Elashry, F., Allah, O.S.F., Abbas, A.M., El-Rabaie, S. and El-Samie, F.E.A. (2009) Homomorphic Image Encryption. Journal of Electronic Imaging, 18, 033002. http://dx.doi.org/10.1117/1.3167847Borst, J., Preneel, B., Vandewalle, J. and Leuven, K.U. (1999) Linear Cryptanalysis of RC5 and RC6. In: Knudsen, L., Ed., Fast Software Encryption, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 16-30.Gilbert, H., Handschuh, H., Joux, A. and Vaudenay, S. (2000) A Statistical Attack on RC6. In: Goos, G., Hartmanis, J., van Leeuwen, J. and Schneier, B., Eds., Fast Software Encryption, Springer-Verlag, Berlin, 64-74.Miyaji, A. and Takano, T. (2007) Evaluation of the Security of RC6 against the x2-Attack. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, E90-A, 22-28.Ragab, A.H.M., Ismail, N.A. and Faragallah, O.S. (2001) Enhancement and Implementation of RC6 Block Cipher for Data Security. Electronic Engineering Bulletin, No. 21, 133-137.El-Fishawy, N., Danaf, T. and Zaid, O. (2004) A Modification of RC6TM Block Cipher Algorithm for Data Security (MRC6). International Conference on Electrical, Electronic and Computer Engineering, Cairo, 5-7 September 2004, 222-226. http://dx.doi.org/10.1109/iceec.2004.1374428Khanapur, N.H. and Patro, A. (2015) Design and Implementation of Enhanced Version of MRC6 Algorithm for Data Security. International Journal of Advanced Computer Research (IJACR), 5, 225-232.Bamatraf, A., Ibrahim, R. and Salleh, M.N.B.M. (2010) Digital Watermarking Algorithm Using LSB. 2010 International Conference on Computer Applications and Industrial Electronics (ICCAIE), Kuala Lumpur, 5-8 December 2010, 155-159. http://dx.doi.org/10.1109/iccaie.2010.5735066Singh, A., Jain, S. and Jain, A. (2013) Digital Watermarking Method using Replacement of Second Least Significant Bit (LSB) with Inverse of LSB. International Journal of Emerging Technology and Advanced Engineering, 3, 121-124.Kr Sharma P. and Rajni ,et al. (2012)Analysis of Image Watermarking Using Least Significant Bit Algorithm International Journal of Information Sciences and Techniques (IJIST) 2, 95-101.Wu, H. and Ma, D. (2004) Efficient and Secure Encryption Schemes for JPEG 2000. IEEE International Conference on Acoustics, Speech and Signal Processing, 5, 869-872.