Secure Image Encryption Authentication Compression System

Transcription

1 Secure Image Encryption Authentication Compression System Vinolina.R 1,M.S.Vijaykumar 2,A.M Senthil Kumar 3 1 CSE Department,Tejaa Shakthi Institute of Technology For Women,Coimbatore 2 Assistant Professor, CSE Department, Tejaa Shakthi Institute of Technology For Women, Coimbatore 3 HOD,CSE Department, Tejaa Shakthi Institute of Technology For Women,Coimbatore Abstract-A two-phase content-based image authentication scheme is constructed based on a combination of hard and soft authentication implementing previous existing generic approximate message authentication codes which is a error-correcting codes with cryptographic message authentication codes and symmetric encryption techniques. The message authentication codes which used for hard authentication. The two-phase image authentication scheme verifies the validity of an image in two phases. In low frequency elements the image are subjected to the early phase while some higher frequency elements are left to the instant phase only if the first phase succeeds. The planned scheme tolerates common content-preserving modifications in an image and can separate intended modifications affecting the image content. The Proposed scheme demonstrates high perceptive capability and can detect different types of forgery attacks on images while preserving the robustness. The level of content perseverance is defined by the content based authentication scheme in use, e.g., using a threshold value. This threshold is based on the criticality level of the application for which the threshold is chosen. Highly critical applications have more stringent requirements and therefore prefer a hard authentication by choosing a smaller threshold. Less critical applications uses soft authentication scheme by selecting a higher value for threshold. Key words: Approximate Message Authentication Code, Hard and Soft authentication. I. INTRODUCTION In realistic image encryption has to be conducted earlier to image compression. This leads to the problem to design a pair of image encryption and compression algorithms such that the compressed encrypted images can even performed efficiently. In this work, we design a highly efficient image encryption-then-compression system, in which it measures both lossless and lossy compressions.the proposed encryption plan operated in the prediction error domain is revealed to provide a reasonably high level of security. Arithmetic coding-based approach can be broken to efficiently compress the encrypted images. The compression approach applied to encrypted images is worser than the state-ofthe-art lossless/lossy image codes, which take unique, unencrypted images as inputs. In contrast, the existing ETC solutions make significant penalty on the compression efficiency. In general, the purpose of image authentication is to verify the authenticity of the images as long as the content is preserved. The level of content perseverance is defined by the content based authentication scheme in use, e.g., using a threshold value. This threshold is based on the criticality level of the application for which the threshold is chosen. Highly critical applications have more stringent requirements and therefore prefer a hard authentication by choosing a smaller threshold. Less critical applications use a soft authentication scheme by selecting a higher value for threshold. However, security should not be compromised by such mechanisms and the forged images or intentionally modified images with different content should be All Rights Reserved 735

2 II. REVIEW OF IMAGE AUTHNTICATION Different classifications exist for image authentication methods according to their construction and functionality. In the most common classification, image authentication approaches are divided into two major groups including strict or hard image authentication and soft image authentication. The message authentication schemes do not tolerate any changes in the image content. The accepted modifications are changes which preserve the pixel values, such as lossless compression or format conversion. The main techniques used in this group are based on fragile watermarking and standard cryptography. Fragile watermarking consists of generating a watermark and inserting it into the image such that it reflects any changes occurred in the image. The verification is successful if the pixels are left unchanged. The authentication tag in this method is generated mainly based on a checksum, predefined logo, discrete cosine transform (DCT) or color components. Image authentication schemes based on standard cryptography use common cryptographic primitives as their internal building blocks. They may provide partial forgery localization capabilities but no image restoration is normally possible. The main methods in this group consist of tiling the image into sub-blocks and calculating the MAC of the image row-wise, column-wise or block-wise. The second group concerns soft image authentication where the malicious content manipulations are rejected and the rest are accepted. Semi-fragile watermarking and contentbased signatures are the main approaches in this category. The general technique for semi-fragile watermarking is to insert the computed watermark into the image such that specific image processing operations such as compression and noise addition can be tolerated by the authentication scheme while malicious alterations are detected and localized. Additionally, the restoration capability is possible in some proposed schemes. Vector quantization and block similarities are some of important methods for watermark generation in semi-fragile watermarking schemes. III. DESCRIPTION OF EXISTING SYSTEM AND PROPOSED SYSTEM ETC solutions induce significant penalty on the compression was proposed to losslessly compress the stream of cipher encrypted grayscale/color images. Compressing block cipher encrypted data achieve higher compression ratios; lossy compression of encrypted data was also studied. The lossy coding framework of encrypted images via a multi-resolution construction was planned. A Compressive Sensing (CS) mechanism utilized to compress encrypted images resulted from linear encryption. A modified basis detection algorithm is applied to estimate the original image from the compressed and encrypted data.an image encryption scheme via pixel-domain permutation, verified that the encrypted file can be efficiently compressed by removal of excessively rough and fine datas of coefficients in the transform domain. A generic 2-phase scheme for content-based image authentication is introduced. The initially presented scheme is developed and significantly enhanced and, comprehensive experimental and comparison results are given. The Approximate Message Authentication Code (AMAC) have advantages and drawbacks to be used individually in image authentication applications. The AMACs are suitable authentication mechanisms which tolerate acceptable modifications to the input message. To tolerate such acceptable modifications, robustness must be introduced and provided by the primitives. This causes reduction of the security and the accuracy level. Also the sensitivity of the AMAC against different images or malicious image modifications which indicates its discriminating capability may be endangered. This capability of an AMAC is referred to fragility. The focus of work is based on the design of image encryption and compression schemes, in such a way that compressing the encrypted images is similarly efficient as compressing their original, un encrypted counterparts. A All Rights Reserved 736

3 based image encryption approach conducted in excess of the prediction error domain. A contextadaptive arithmetic coding (AC) efficiently compress the encrypted data.due to the high sensitivity of prediction error sequence against conflict, high level of security could be retained.in projected system a highly efficient image encryption-then-compression (ETC) system, where mutually lossless and lossy compression are measured. The projected image encryption scheme operated in the prediction error domain provide a reasonably high level of security. We demonstrate that an arithmetic coding-based approach can be broken to efficiently compress the encrypted images. IV. EXPERIMENTAL SETUP Various implementations can be achieved via different selection of the transformation. Here, the special case of T= DCT is presented and implemented. A Reed Solomon (RS) code is selected as the errorcorrecting code in the first phase. However other error-correcting codes can be used if they provide the desired error correction capability. The mechanism is called the DCT-RS-based scheme. Accordingly, when T= DWT or T=SVD and it is called the DWT-RS-based and the SVD-RS-based scheme respectively. Let T=DCT, the image is firstly normalized using a bilinear interpolation and mapped into a fixed square size image. Fig2. Permutated image Then, a low-pass Gaussian filter is applied to create the preprocessed image J. The image J is divided into non-overlapping blocks and the 2-dimensional DCT is applied to each image block. The DC element from each block is picked and quantized. The quantized DCs are concatenated together to form a -bit message for hard authentication part corresponding to AMAC1. The choice of quantization coefficients for DCs depends on the expected robustness. Larger quantization coefficients provide more robustness against acceptable image modifications. A Reed Solomon code is used in the correction step. RS codes are defined over a Galois Field (GF(P1 p2 )) where p1 is a small prime number with typical value 2 while p2 is a small integer and typically 2<= P2 <=8. They have the ability to detect and correct multiple symbol All Rights Reserved 737

4 Fig 3.Encrypted image Fig4.Decrypted image V. CONCLUSION AND FUTURE WORK Secure and Robust Two-Phase Image Authentication, have designed an efficient image Encryption-then- Compression system using two-phase authentication system with multiples permutations based on the cluster. Within the proposed framework, the image encryption has been achieved through prediction error clustering and random permutation. Extremely efficient compression of the encrypted data has realized by a context-adaptive arithmetic coding approach. The theoretical and experimental results have shown high level of security which has been retained. More notably, the coding efficiency of our projected compression method on encrypted images is very close to that of the state- of-the-art lossless/lossy image codes, which receive original, unencrypted images as inputs. The proposed 2-phase image authentication almost outperforms in the context of forgery attack detection. However, it is unable to classify and identify the type of attack or to localize the attacked part of the image. Future work will be focused on improvement of the scheme towards to the tamper/forgery classification and accurate forgery area localization of images. REFERENCES 1. Byun.SC, Lee.IL, and Shin.TH,( Aug. 2002) A public-key based watermarking for color image authentication, in Proc. IEEE Int. Conf. Multimedia Expo., vol. 1, pp Fridrich.J and Goljan.M,( 1999) Protection of digital images using self embedding, in Proc. Symp. Content Security Data Hiding Digital Media. 3. Fridrich.J,( 1999) Methods for tamper detection in digital images, in Proc. Multimedia Security Workshop ACM Multimedia, Orlando, FL, USA, pp Ge.R, Arce G.R, and Crescenzo G.D(Mar. 2006), Approximate message authentication codes for N-ary alphabets, IEEE Trans. Inf. Forensics Security, vol. 1, no. 1, pp ,. 5. Haouzia.A and Noumeir.D(2008), Methods for image authentication: A Survey, Multimedia Tools Appl., vol. 39, pp. 1 46,. 6. Koval.O, Voloshnovskiy.S, Beekhof.K, and Pun.T(2008), Security analysis of robust perceptual hashing, in Proc. SPIE 6819, Security, Forensics, Steganography, Watermarking Multimedia Contents X, p. All Rights Reserved 738

5 7. Menezes.A,Van Oorschat. P, and Vanstone.S(1996), Handbook of Applied Cryptography. Boca Raton, FL, USA: CRC Press. 8. Naor.M and Yung.M(1989), Universal one-way hash functions and their Cryptographic applications, in Proc. Annu. ACM Symp. Theory Comput.,, pp Safavi-Naini.R and Tonien.D( 2011), Fuzzy universal hashing and approximate authentication, Discrete Math., Algorithms Appl., vol. 3, no. 4, pp Safavi-Naini.D and Tonien.D(Aug. 2005), Fuzzy universal hashing and approximate authentication, Cryptology eprint Archive pp Available: Shin.J and Ruland.C(Oct. 2013), A survey of image hashing technique for data Authentication in WMSNs, in Proc. IEEE Int. Conf. Wireless Mobile Comput., Netw. Commun., pp Tabatabaei.S.A.H.A.E, Ur-Rehman.O, and Zivic.N(Jun. 2013), AACI: A Mechanism for authentication and correction of images, in Proc. IEEE Int. Conf. Commun. Workshops, pp Tabatabaei.S.A.H.A.E, Ur-Rehman.O, and Zivic.N(2013), A DWT-based image authentication and correction mechanism, in Proc. Int. Symp. ELMAR, pp Tang.Z, Wang.S, Zhang.X,Wei.W, andsu(2008), Robust image hashing for tamper detection using non-negative matrix factorization, J. Ubiquitous Convergence Technol., vol. 2, no. 1, pp Tonien. D, Safavi-Naini. R, Nickolas. P, and Desmedt.Y(2009), Unconditional Secure approximate message authentication, in Proc. Int. Workshop coding Cryptology, vol. 5557, pp. 233 All Rights Reserved 739