Joint Encryption and Compression-Based Watermarking Technique for Security of Digital Documents
13 Jan 2021-ACM Transactions on Internet Technology (ACMPUB27New York, NY, USA)-Vol. 21, Iss: 1, pp 1-20
TL;DR: In this article, a joint encryption then compression based watermarking technique for digital document security is proposed, which offers a tool for confidentiality, copyright protection, and strong compression performance of the system.
Abstract: Recently, due to the increase in popularity of the Internet, the problem of digital data security over the Internet is increasing at a phenomenal rate. Watermarking is used for various notable applications to secure digital data from unauthorized individuals. To achieve this, in this article, we propose a joint encryption then-compression based watermarking technique for digital document security. This technique offers a tool for confidentiality, copyright protection, and strong compression performance of the system. The proposed method involves three major steps as follows: (1) embedding of multiple watermarks through non-sub-sampled contourlet transform, redundant discrete wavelet transform, and singular value decomposition; (2) encryption and compression via SHA-256 and Lempel Ziv Welch (LZW), respectively; and (3) extraction/recovery of multiple watermarks from the possibly distorted cover image. The performance estimations are carried out on various images at different attacks, and the efficiency of the system is determined in terms of peak signal-to-noise ratio (PSNR) and normalized correlation (NC), structural similarity index measure (SSIM), number of changing pixel rate (NPCR), unified averaged changed intensity (UACI), and compression ratio (CR). Furthermore, the comparative analysis of the proposed system with similar schemes indicates its superiority to them.
Citations
More filters
TL;DR: The various approaches taken to consider joint encryption and compression, assessing both their merits and their limitations are reviewed, offering a consideration of the different technical perspectives.
Abstract: As digital images are consistently generated and transmitted online, the unauthorized utilization of these images is an increasing concern that has a significant impact on both security and privacy issues; additionally, the representation of digital images requires a large amount of data. In recent years, an image compression scheme has been widely considered; such a scheme saves on hardware storage space and lowers both the transmission time and bandwidth demand for various potential applications. In this article, we review the various approaches taken to consider joint encryption and compression, assessing both their merits and their limitations. In addition to the survey, we also briefly introduce the most interesting and most often utilized applications of image encryption and evaluation metrics, providing an overview of the various kinds of image encryption schemes available. The contribution made by these approaches is then summarized and compared, offering a consideration of the different technical perspectives. Lastly, we highlight the recent challenges and some potential research directions that could fill the gaps in these domains for both researchers and developers.
23 citations
10 citations
01 Jul 2021
TL;DR: A robust information hiding algorithm based on lossless encryption, non-subsampled contourlet transform (NSCT), Hessen-berg decomposition (HD) and singular value decomposition was proposed in this paper.
Abstract: Aiming at the problem of the security of secret information in various potential applications, we introduce a robust information hiding algorithm based on lossless encryption, non-subsampled contourlet transform (NSCT), Hessen-berg decomposition (HD) and singular value decomposition (SVD). Firstly, the carrier and secret mark information is transformed by NSCT-HD-SVD. Secondly, the singular score of secret media information is concealed in the carrier image. Thirdly, the text document is further concealed in the carrier marked image via pseudo magic cubes to achieve the final carrier marked image. Finally, the lossless encryption scheme is utilized to encrypt the final marked image. The simulation results of the proposed algorithm indicate good invisibility and robustness effect compared to existing schemes with high security and hiding efficiency. It indicates a considerable improvement in robustness of up to 96.36% over other schemes. Overall, the proposed algorithm for various images, achieved peak signal-to-noise ratio (PSNR), normalized correlation (NC), structural similarity index (SSIM), number of changing pixel rate (NPCR) and unified averaged changed intensity (UACI) of up to 67.36 dB, 0.9996, 1.0000, 0.9964 and 0.4005, respectively, indicating its effectiveness for secure media applications.
8 citations
01 Jan 2021
TL;DR: Wang et al. as discussed by the authors proposed a robust algorithm based on encrypted medical images, which can resist a certain degree of conventional attacks and geometric attacks, especially against the translation and crop attacks.
Abstract: To ensure the safety of medical images and patient information, this paper proposes a robust algorithm based on encrypted medical images. Firstly, the medical image is encrypted by combining DWT-DCT and tent mapping. Then, the features of the encrypted medical image are extracted by DWT-Gabor transform. Finally, the scrambled watermark is embedded into the encrypted medical image combined with zero watermark technology. Experiments show that the algorithm in this paper has good robustness and invisibility, and can resist a certain degree of conventional attacks and geometric attacks, especially against the translation and crop attacks.
8 citations
TL;DR: In this paper, a robust and secure digital image watermarking is proposed, which exploits the chaotic behaviour of the non-linear oscillators realized through Memristive diodes.
Abstract: With the advent of technology and multimedia production, the world has witnessed a tremendous increase in digital media attacks, which duplicates, forges and tamper the data leading to the violation of copyright laws. In this paper, a robust and secure digital image watermarking is proposed, which exploits the chaotic behaviour of the non – linear oscillators realized through Memristive diodes. The proposed scheme relies on a Human Visual System (HVS) model in order to mimic the real-life scenario. To improve the robustness of the proposed approach and to further increase the security of the digital watermarked media whilst still retaining compatibility with the real-time events, Histogram of Oriented Gradients (HOG) and extreme learning machine (ELM) is implemented. Secure key generation by means of scrambling through Arnold Transform and the coefficients of Memristive Chaotic Oscillator ensures extreme security. The watermark embedding followed the pixel transformation based on discrete cosine coefficient modification, and a semi-blind watermarking extraction procedure was carried out through trained ELM models. A detailed analysis has been presented to evaluate the tradeoff between imperceptibility, security and robustness using performance metrics like PSNR, NC, SSIM, and BER. To establish a real-time implementation of the proposed architecture, the simulated results were verified using real-time chaotic signals generated from the chaotic oscillator, which dictates excellent performance against watermarking attacks and image processing tasks.
8 citations
References
More filters
TL;DR: The redundancy in digital images is explored to achieve very high embedding capacity, and keep the distortion low, in a novel reversible data-embedding method for digital images.
Abstract: Reversible data embedding has drawn lots of interest recently Being reversible, the original digital content can be completely restored We present a novel reversible data-embedding method for digital images We explore the redundancy in digital images to achieve very high embedding capacity, and keep the distortion low
2,739 citations
TL;DR: Methods are shown how to adapt invertible two-dimensional chaotic maps on a torus or on a square to create new symmetric block encryption schemes to encrypt an N×N image.
Abstract: In this paper, methods are shown how to adapt invertible two-dimensional chaotic maps on a torus or on a square to create new symmetric block encryption schemes. A chaotic map is first generalized by introducing parameters and then discretized to a finite square lattice of points which represent pixels or some other data items. Although the discretized map is a permutation and thus cannot be chaotic, it shares certain properties with its continuous counterpart as long as the number of iterations remains small. The discretized map is further extended to three dimensions and composed with a simple diffusion mechanism. As a result, a symmetric block product encryption scheme is obtained. To encrypt an N×N image, the ciphering map is iteratively applied to the image. The construction of the cipher and its security is explained with the two-dimensional Baker map. It is shown that the permutations induced by the Baker map behave as typical random permutations. Computer simulations indicate that the cipher has g...
1,654 citations
TL;DR: The experimental results for many standard test images show that prediction-error expansion doubles the maximum embedding capacity when compared to difference expansion, and there is a significant improvement in the quality of the watermarked image, especially at moderate embedding capacities.
Abstract: Reversible watermarking enables the embedding of useful information in a host signal without any loss of host information. Tian's difference-expansion technique is a high-capacity, reversible method for data embedding. However, the method suffers from undesirable distortion at low embedding capacities and lack of capacity control due to the need for embedding a location map. We propose a histogram shifting technique as an alternative to embedding the location map. The proposed technique improves the distortion performance at low embedding capacities and mitigates the capacity control problem. We also propose a reversible data-embedding technique called prediction-error expansion. This new technique better exploits the correlation inherent in the neighborhood of a pixel than the difference-expansion scheme. Prediction-error expansion and histogram shifting combine to form an effective method for data embedding. The experimental results for many standard test images show that prediction-error expansion doubles the maximum embedding capacity when compared to difference expansion. There is also a significant improvement in the quality of the watermarked image, especially at moderate embedding capacities
1,229 citations
TL;DR: Results indicate that the spatial, quad-based algorithm developed for color images allows for hiding the largest payload at the highest signal-to-noise ratio.
Abstract: A reversible watermarking algorithm with very high data-hiding capacity has been developed for color images. The algorithm allows the watermarking process to be reversed, which restores the exact original image. The algorithm hides several bits in the difference expansion of vectors of adjacent pixels. The required general reversible integer transform and the necessary conditions to avoid underflow and overflow are derived for any vector of arbitrary length. Also, the potential payload size that can be embedded into a host image is discussed, and a feedback system for controlling this size is developed. In addition, to maximize the amount of data that can be hidden into an image, the embedding algorithm can be applied recursively across the color components. Simulation results using spatial triplets, spatial quads, cross-color triplets, and cross-color quads are presented and compared with the existing reversible watermarking algorithms. These results indicate that the spatial, quad-based algorithm allows for hiding the largest payload at the highest signal-to-noise ratio.
1,149 citations
TL;DR: The experimental results demonstrate that the suggested encryption algorithm of image has the advantages of large key space and high security, and moreover, the distribution of grey values of the encrypted y image has a random-like behavior.
584 citations