Coverless Image Steganography using Haar Integer Wavelet Transform
01 Mar 2020-
TL;DR: This paper focuses on increasing the amount of data transmitted in an image, when using coverless image steganography through the use of the Haar lnteger Wavelet Transform.
Abstract: Coverless hnage steganography is a recently discovered steganography method Which does not modify the image carrying the secret information. However, the techniques proposed until now have low efficiency capable of transferring few bits per image. This paper focuses on increasing the amount of data transmitted in an image, when using coverless image steganography through the use of the Haar lnteger Wavelet Transform. In our method, we take a single image of resolution 256x256 and split it into 1024 sub matrices. After that, we use integer wavelet transform to generate the coefficients in each sub-matrix. These sub-matrices are reshaped into arrays. Then the coefficients of each sub-matrix are changed into binary bits, by checking vhether the succeeding value in the array is larger or smaller than the current value vhich leads to an array of length 1064*63. finally, we fragment the secret message into 8 bits and match it with the block and starting location in the array. A location map is generated vhich can be used by the receiver to obtain the secret message.
Citations
More filters
TL;DR: This paper reviews some of the recent works that have been conducted on the topic of coverless image steganography and provides an important insight into how these techniques are performed.
Abstract: Many of the existing image steganographic techniques embed secret information into cover images by slightly altering their contents. These modifications have several effects, on the other hand, Stego-images distorted by these problems become vulnerable to steganalysis tools. Coverless information hiding represents a solution to this problem. Unlike traditional techniques, which alter the carrier, a coverless information hiding procedure does not change it. This paper reviews some of the recent works that have been conducted on the topic of coverless image steganography and provides an important insight into how these techniques are performed.
4 citations
TL;DR: Wang et al. as discussed by the authors proposed a robust coverless steganography using limited mapping images, where they extracted ring statistics to ensure both the distinguishability and robustness of mapping features.
2 citations
31 May 2022
TL;DR: In this article , coverless steganography is used to hide the secret message in the video cover, where multiple covers are chosen so that these covers contain the characteristics of the message to be hidden.
Abstract: In the traditional methods of information hiding, confidential information is embedded in the carriers by modifying carriers’ parameter characteristics, that will certainly leave traces of adjustments on the carriers. These adjustments are usually too small to be discerned by the human eye, but they can be discovered by some steganalysis algorithms and therefore, safety cannot be guaranteed using these methods. This challenge can be solved completely through a new technique called coverless steganography. This method does not need to employ a cover for the purpose of hiding, as well as no traces of modifications occur in the cover by hiding the secret message. In this method, multiple covers are chosen so that these covers contain the characteristics of the message to be hidden, then they are considered as container covers for the secret message and are sent to the recipient for the purpose of extracting the secret message. Therefore, coverless steganography methods have higher security than traditional methods of information hiding. In this study, more than 30 papers are included to provide an extensive explanation of this field as well as cover the main aspects of a coverless information hiding method to hide the confidential information in the video cover.
1 citations
31 May 2022
TL;DR: In this study, more than 30 papers are included to provide an extensive explanation of this field as well as cover the main aspects of a coverless information hiding method to hide the confidential information in the video cover.
Abstract: In the traditional methods of information hiding, confidential information is embedded in the carriers by modifying carriers’ parameter characteristics, that will certainly leave traces of adjustments on the carriers. These adjustments are usually too small to be discerned by the human eye, but they can be discovered by some steganalysis algorithms and therefore, safety cannot be guaranteed using these methods. This challenge can be solved completely through a new technique called coverless steganography. This method does not need to employ a cover for the purpose of hiding, as well as no traces of modifications occur in the cover by hiding the secret message. In this method, multiple covers are chosen so that these covers contain the characteristics of the message to be hidden, then they are considered as container covers for the secret message and are sent to the recipient for the purpose of extracting the secret message. Therefore, coverless steganography methods have higher security than traditional methods of information hiding. In this study, more than 30 papers are included to provide an extensive explanation of this field as well as cover the main aspects of a coverless information hiding method to hide the confidential information in the video cover.
1 citations
References
More filters
31 May 2009
TL;DR: This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Abstract: We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result -- that, to construct an encryption scheme that permits evaluation of arbitrary circuits, it suffices to construct an encryption scheme that can evaluate (slightly augmented versions of) its own decryption circuit; we call a scheme that can evaluate its (augmented) decryption circuit bootstrappable.Next, we describe a public key encryption scheme using ideal lattices that is almost bootstrappable.Lattice-based cryptosystems typically have decryption algorithms with low circuit complexity, often dominated by an inner product computation that is in NC1. Also, ideal lattices provide both additive and multiplicative homomorphisms (modulo a public-key ideal in a polynomial ring that is represented as a lattice), as needed to evaluate general circuits.Unfortunately, our initial scheme is not quite bootstrappable -- i.e., the depth that the scheme can correctly evaluate can be logarithmic in the lattice dimension, just like the depth of the decryption circuit, but the latter is greater than the former. In the final step, we show how to modify the scheme to reduce the depth of the decryption circuit, and thereby obtain a bootstrappable encryption scheme, without reducing the depth that the scheme can evaluate. Abstractly, we accomplish this by enabling the encrypter to start the decryption process, leaving less work for the decrypter, much like the server leaves less work for the decrypter in a server-aided cryptosystem.
5,770 citations
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
"Coverless Image Steganography using..." refers methods in this paper
...Such as in [10] a technique is proposed using “Difference Expansion” which is able to discover some additional spaces within the image....
[...]
...[10] Juan Tian,“Reversible Data Embedding Using a Difference Expansion,” IEEE Trans....
[...]
25 Jun 2000
TL;DR: It is shown that QIM is "provably good" against arbitrary bounded and fully informed attacks, and achieves provably better rate distortion-robustness tradeoffs than currently popular spread-spectrum and low-bit(s) modulation methods.
Abstract: We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing the information-embedding rate, minimizing the distortion between the host signal and composite signal, and maximizing the robustness of the embedding. We introduce new classes of embedding methods, termed quantization index modulation (QIM) and distortion-compensated QIM (DC-QIM), and develop convenient realizations in the form of what we refer to as dither modulation. Using deterministic models to evaluate digital watermarking methods, we show that QIM is "provably good" against arbitrary bounded and fully informed attacks, which arise in several copyright applications, and in particular it achieves provably better rate distortion-robustness tradeoffs than currently popular spread-spectrum and low-bit(s) modulation methods. Furthermore, we show that for some important classes of probabilistic models, DC-QIM is optimal (capacity-achieving) and regular QIM is near-optimal. These include both additive white Gaussian noise (AWGN) channels, which may be good models for hybrid transmission applications such as digital audio broadcasting, and mean-square-error-constrained attack channels that model private-key watermarking applications.
2,218 citations
"Coverless Image Steganography using..." refers methods in this paper
...Some other methods can also be taken into consideration which might be of somewhat more complex as compared to the previous two methods:[3] Difference Expansion, [4] prediction error, [5] histogram based approaches, [6] modulo operations, [7] quantization based, [8] redundant pattern coding, algorithms, transformation and many more....
[...]
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
"Coverless Image Steganography using..." refers methods in this paper
...For instance, the idea used in [14] was focusing on reversible digital watermarking using Tiam’s difference-expansion....
[...]
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
"Coverless Image Steganography using..." refers methods in this paper
...Some other methods can also be taken into consideration which might be of somewhat more complex as compared to the previous two methods:[3] Difference Expansion, [4] prediction error, [5] histogram based approaches, [6] modulo operations, [7] quantization based, [8] redundant pattern coding, algorithms, transformation and many more....
[...]