With the rapid development of modern information technologies and systems, the number and complexity of threats aimed at breaching the security of confidential information transmitted secretly in multimedia files is increasing. At the same time, active attacks aimed at steganographic information protection systems are of great importance, as they differ from passive attacks in that the attacker not only tries to detect hidden information but can also modify the image to remove or distort it. Given the importance of this issue, the paper proposes to increase the resistance of hidden information in images to color gamutchanging attacks. To achieve this goal, the hiding algorithm has been improved based on the use of matrix filters to find the most suitable image areas and hide bits of information in them by correlating the average brightness of segments in blocks. The proposed algorithm includes many variable parameters, which makes it possible to adapt it to a wide range of images. In addition, flexible parameter settings enable improved information embedding and extraction accuracy. To validate the effectiveness of the enhanced algorithm, color-change attacks were conducted on an image containing embedded hidden information. Various steganalysis methods were also applied, including visual steganalysis, which reveals the least significant bit of the image; RS steganalysis, which estimates the approximate size of the hidden data; and a method analyzing the distribution of image elements on a plane to detect patterns, structures, or anomalies within the image. The obtained results demonstrate the robustness of the proposed method of information hiding to the selected steganalysis algorithms and to color gamut-changing attacks.
With the rapid advancement of technology and communications, it is becoming increasingly important to protect confidential information from unauthorized access. After all, transmitting a secret message over an unprotected network channel poses a serious threat to its security. Among the methods for solving this problem are steganographic methods, which involve the open transport of a secret message embedded in a container in advance [1]. However, there are many attacks aimed at breaking into steganographic systems, including attacks that focus on changing the color gamut in images, which can lead to the disclosure of hidden information, violation of its confidentiality and integrity. Therefore, this paper presents a study related to increasing the resistance of hidden information in images to these attacks. Thus, in this paper, based on the analysis of known steganographic methods, it is necessary to improve the algorithm for hiding information using matrix filters and test it to prove its resistance to steganalysis and color change attacks.
In recent years, numerous studies have been conducted on methods of hiding data in images based on the use of algorithms for finding acceptable zones for hiding information. For example, in their study [2], the authors developed the Bald Eagle Search Optimal Pixel Selection with Chaotic Encryption (BESOPS-CE) steganographic image method based on the method of searching for optimal pixels with chaotic encryption. The presented method effectively hides the secret image in encrypted form under the cover image. In this paper [3], a steganographic scheme based on graph wavelet transformation using graph signal processing (GSP) is proposed, which improves the visual quality of a stego image. The authors of the paper [4] presented a new steganographic approach in which the algorithm of an extreme learning machine is modified to create a supervised mathematical model. This algorithm is first trained on a part of the image and then tested in regression mode, which allows choosing the optimal place to embed a message with the best values of the predicted The next stage of the algorithm is to divide the resulting matrix and image into blocks of size х , with the number of blocks being . For each block of the matrix a set of pixel indices is defined by , exceeding the threshold value. This process begins by calculating the average value between the blocks: evaluation metrics. In this research [5], a new method was proposed to increase the possibility of embedding secret information in an image based on the edge region. The new approach combines the Kenny and Pruitt edge detection methods using a binary operation, and the secret message is hidden using the least significant bit (LSB) method.
An interesting idea is that of the authors of that paper [6], who proposed an algorithm for encrypting private images in combination with a new tent multi-dynamic piecewise connected mapping lattice (TMDPCML) for spatiotemporal chaotic systems. This algorithm extracts private image information and uses distributed nonlinear diffusion. Study [7] presents a method for detecting steganographic changes in images using convolutional neural networks. In [8], a new stenographic swarm optimization technique with encryption for digital image protection, called CSOES-DIS, was developed. The proposed model applies the method of double chaotic digital image encryption, and then the embedding process is implemented. The authors of this paper [9] proposed a new algorithm for encrypting and hiding triple images by combining a 2D chaotic system, compressive sensing (CS), and 3D discrete cosine transform (DCT).
Data hiding methods that use areas of rapid changes in an image to hide information have many advantages, including high capacity, adaptability to different types of images and data formats, and the ability to use both the spatial and frequency characteristics of an image. However, these methods are not very resistant to color gamut attacks, which limits their effectiveness. In this regard, the paper proposes an improvement that uses luminance correlation and matrix filters to effectively hide information in images while providing a high level of protection.
Most algorithms that use areas of rapid changes in the image to hide information use the method of hiding information in one or two last bits of pixels of different channels. These methods are called LSB and 2-LSB according to the number of least significant bits [10]. However, these algorithms cannot withstand color gamut attacks, so it is worth improving an algorithm that will use luminance correlation to embed bits of information in the image, which will help to
withstand color gamut attacks by using luminance in areas that are most difficult to change.
To increase the resistance to the above attacks, it is proposed to use matrix filters to detect areas of sharp transitions, which are expressed in the red and green channels, while information is hidden in the blue channel.
The proposed algorithm applies a filter using the discrete Laplace operator [11], which can be represented in two forms:
= ( + 1, ) + ( − 1, ) + + ( , + 1) + ( , − 1) − 4 ∗ ( , ), 0 1 0 1 1 −4 0 1 , 0 where , are indices in the cell of the selected pixel to determine ∇ . (1) (2) , = 1 … , = 1 … , = 1 … , where ℎ is ith block with the average value between the pixels of the blocks; ; is the size of the block.
is ith block from the red channel of the matrix is ith block from the green channel of the matrix ; Next, the set of indices is defined as follows :
= {( , )|ℎ ( , ) > }, where is threshold value.
= {( , ), ( , ), … , ( , )}, = 1 … ; is the length of the ith variable .
The next step is to split into indices corresponding to the lower and upper parts of the block: 2 2 2 (3) (4) (5) (6) (7) (8) = { [ ]| [ ][1] >
, = 1 … }, = { [ ]| [ ][1] ≤ , = 1 … }, where
= {( , ), ( , ), … , ( , )}, = 1 … —is the set of lowercase indices of the part of the block from ; = {( , ), ( , ), … , ( , )}, = 1 … is the set of upper indices of the part of the block from ; [ ] is value ,
from іth block, and [ ] [1] is value of from the set of indices from
іth block.
The last stage of preparation before embedding the information is to calculate the average brightness of the pixels in the blue channel of the image for the pixels with the lower and upper block indices: , , where
is the average brightness of the lower part of the іth block by indices ;
is the average brightness of the upper part of the іth block by indices ; [ ] is indices , , of the lower part of the іth block; [ ] is indices the upper part of the іth block; is a block from the blue image channel P, accordingly ( [ ]) and
( [ ]) are pixels from the top and bottom part of і-th block for the specified indices [ ] and [ ].
Thus, the preparation stage for hiding information in the image takes place.
Next, the embedding process is examined. Assuming a sequence of bits W exists, to hide one bit of information, the average brightness of the pixels at the calculated indices in the lower and upper parts of the blue channel block of the image must satisfy the conditions for embedding the bit. Moreover, the smaller the embedding dimension, the more intensively the pixel brightness will change, and vice versa.
Example of conditions for hiding a single bit:
If the condition for hiding a bit of information is not met, the total brightness is correlated by increasing or decreasing by a unit block of pixels whose indices belong to the lower or upper threshold of the blue channel block. This happens until the conditions for hiding the selected bit of information are met. This is how information in the image is hidden.
We will develop algorithms that implement an improved method of hiding information.
Fig. 1 shows a general algorithm for embedding one bit of information in one block.
After determining the luminance values, a check is performed to determine whether the bit has been embedded. If this condition is not met, then the correlation value for the lower and upper parts of the block is calculated, then the At the same time, the general algorithm for extracting a bit of information from a block is shown in Fig. 2. ( ∗ ) + ≤ (1 ∗ ) + ≤ (3 ∗ ) + ≤ ( ∗ ) + ≤ ≤ ( + 1 ) ∗ ≤ (1 + 1) ∗ − ∧, ≤ ( + 1 ) ∗ − , brightness for these parts of the block is correlated and the brightness value is calculated. This process is repeated cyclically until the desired values are selected and the condition is fully met. 3. Experimental research The security of the proposed algorithm was analyzed by performing color change attacks on the image in which the hidden information was embedded.
To determine the effectiveness of the algorithm’s protection against such attacks, the values of , are calculated, reflecting the correspondence between the embedded hidden information and the extracted hidden information ∗ obtained: = 100%, (9) where
is the number of equal bits in both messages; is the size of the hidden message in bits.
Value of
indicates the success of extracting hidden information from the image.
More than 100 different images were selected for the experiment, most of which are detailed full-color images with a sufficient number of contrast transitions and monotonous areas. attacks that altered the color scheme: making it brighter, more contrasted, and darker, closer to grayscale. Thus, minor changes in different image channels were detected, but these values cannot indicate the presence or absence of hidden information in the container or the original.
Let’s conduct additional testing of the algorithm, focusing on the analysis of the distribution of image elements on the plane (Fig. 7). If the points are randomly distributed over the entire area, the sequence elements are independent, which is typical for containers with embedded data. If the container is not filled, then an uneven distribution of points on the field will be observed. Since the container did not show a chaotic arrangement of points, this method was unable to recognize that the container contained hidden information.
Thus, according to the results of the study, it can be assumed that the proposed method of hiding information is resistant to the described steganalysis algorithms and to color change attacks.
In this work, the information-hiding algorithm is improved by using matrix filters to identify the most suitable areas in the image and embed information bits into them. This is achieved by varying the brightness of segments in image blocks, which are consistently changed to hide bits of information. The main feature of the proposed algorithm is its high resistance to color gamut attacks, achieved by embedding bits by changing the average brightness of the selected hiding zones. Due to the large number of variable parameters, another significant advantage of the improved algorithm can be identified, namely the flexibility of settings, which allows the algorithm to be adapted to different types of images.
In addition, the study presents the algorithm of the program in the form of flowcharts, which is an important step in testing the improved algorithm for resistance to active attacks. The results of the testing indicate high resistance to color gamut attacks on bright colors and above-average resistance to grey gamut attacks. Also, during the testing, resistance to steganalysis by visual methods, RS method, and the method of analyzing the distribution of the image on the plane was revealed.
Thus, based on the proposed improvement of the
algorithm, the steganographic resistance of hidden
information in images to active attacks was increased.
with Multi Dynamic Coupling Coefficient, Inf. Sci. 569
(2021) 217–240. doi: 10.1016/j.in