Adaptive PVD Steganography Using Horizontal, Vertical, and Diagonal Edges in Six-Pixel Blocks

The traditional pixel value differencing (PVD) steganographical schemes are easily detected by pixel difference histogram (PDH) analysis. This problem could be addressed by adding two tricks: (i) utilizing horizontal, vertical, and diagonal edges and (ii) using adaptive quantization ranges. This paper presents an adaptive PVD technique using 6-pixel blocks. There are two variants. The proposed adaptive PVD for 2×3-pixel blocks is known as variant 1, and the proposed adaptive PVD for 3×2-pixel blocks is known as variant 2. For every block in variant 1, the four corner pixels are used to hide data bits using the middle column pixels for detecting the horizontal and diagonal edges. Similarly, for every block in variant 2, the four corner pixels are used to hide data bits using the middle row pixels for detecting the vertical and diagonal edges. The quantization ranges are adaptive and are calculated using the correlation of the two middle column/row pixels with the four corner pixels. The technique performs better as compared to the existing adaptive PVD techniques by possessing higher hiding capacity and lesser distortion. Furthermore, it has been proven that the PDH steganalysis and RS steganalysis cannot detect this proposed technique

Capacity Optimization On RGB Overlapping Block-Based Pixel Value Differencing Image Steganography With Adaptive Threshold

Pixel value differencing steganography is an image steganography that utilizes the difference of the image pixel value to embed the secret message bits. RGB overlapped block-based PVD was introduced by Prasad and Pal which uses the difference value in the pair of RGB color components of a pixel compared to using the difference value of two consecutive pixels. This approach has good performance at increasing capacity especially in images with low pixel variance values. The RGB overlapped block-based PVD algorithm uses a threshold that limits the amount of difference in the color component pairs that are allowed to embed the secret message bits. The use of a global threshold will reduce the potential for optimal capacity utilization of the container image. This study implements an adaptive threshold that uses two different types of thresholds that use the embedding bit limit and the RMSE difference of the pixels before and after the embedding process to the next pixel. This optimization is able to provide a better capacity increase with PSNR degradation from the previous algorithm which is quite low

Multi-Stage Protection Using Pixel Selection Technique for Enhancing Steganography

Steganography and data security are extremely important for all organizations. This research introduces a novel stenographic method called multi-stage protection using the pixel selection technique (MPPST). MPPST is developed based on the features of the pixel and analysis technique to extract the pixel's characteristics and distribution of cover-image. A pixel selection technique is proposed for hiding secret messages using the feature selection method. The secret file is distributed and embedded randomly into the stego-image to make the process of the steganalysis complicated.  The attackers not only need to deter which pixel values have been selected to carry the secret file, they also must rearrange the correct sequence of pixels. MPPST generates a complex key that indicates where the encrypted elements of the binary sequence of a secret file are. The analysis stage undergoes four stages, which are the calculation of the peak signal-to-noise ratio, mean squared error, histogram analysis, and relative entropy. These four stages are used to demonstrate the characteristics of the cover image. To evaluate the proposed method, MPPST is compared to the standard technique of Least Significant Bit (LSB) and other algorithms from the literature. The experimental results show that MPPST outperforms other algorithms for all instances and achieves a significant security enhancement

Using Quaternion Fourier Transform in Steganography Systems

steganography is the discipline of exchanging information messages in such way that no one, other than the intended recipient, suspects the existence of the message.  The transmitted message can be in textual or multimedia form (audio, image or video) and can be hidden within cover media. Moreover, the hidden message can be in either plain or cipher form.  In steganography, the majority of hiding techniques are implemented either in spatial domain or in frequency domain of the cover media.   The current contribution introduces a new a steganography technique for hiding a textual message within a cover image.   Both the message and the cover image is converted to quaternion form and then only the quaternion message is converted to the frequency domain using Quaternion Fast Fourier Discrete Transform (QFFDT) technique.  Simple quaternion mathematics are used to combine the message (in quaternion frequency domain) within the cover image (in quaternion form).  Conversely, the hidden message can be revealed at the receiver using simple quaternion mathematics in presence of the original cover image.  The proposed method allows hiding a huge amount of data and it is much complicated against steganalysis compared to the traditional methods. The method is assessed using the known performance metrics and the obtained results show that it is robust and more secure against steganalysis attacks without affecting the consumed bandwidth of the communication channel

An adaptive image steganography algorithm based on the use of non-cryptographic hash functions for data extraction

Рассматривается адаптивный алгоритм стеганографического скрытия информации, основанный на итеративном внесении малозначительных искажений в блоки полноцветных изображений-контейнеров и использующий быстродействующие некриптографические хеш-функции для последующего извлечения скрытых данных. Особенностью алгоритма является модификация минимального числа элементов контейнера по сравнению с длиной скрываемых в него фрагментов сообщений, что позволяет увеличить показатели скрытой пропускной способности и снизить визуальную и статистическую заметность скрытых данных. Проводится сравнение алгоритма с современными алгоритмами адаптивного пространственного стегоскрытия в части оценки уровня искажающих изменений контейнеров. Рассматривается вариант повышения пропускной способности алгоритма за счёт мультиплексирования скрытых каналов, использующих общее подмножество элементов контейнера при встраивании в них различных сообщений