Security and imperceptibility improving of image steganography using pixel allocation and random function techniques

Information security is one of the main aspects of processes and methodologies in the technical age of information and communication. The security of information should be a key priority in the secret exchange of information between two parties. In order to ensure the security of information, there are some strategies that are used, and they include steganography and cryptography. An effective digital image-steganographic method based on odd/even pixel allocation and random function to increase the security and imperceptibility has been improved. This lately developed outline has been verified for increasing the security and imperceptibility to determine the existent problems. Huffman coding has been used to modify secret data prior embedding stage; this modified equivalent secret data that prevent the secret data from attackers to increase the secret data capacities. The main objective of our scheme is to boost the peak-signal-to-noise-ratio (PSNR) of the stego cover and stop against any attack. The size of the secret data also increases. The results confirm good PSNR values in addition of these findings confirmed the proposed method eligibility.

A combination of least significant bit and deflate compression for image steganography

Steganography is one of the cryptography techniques where secret information can be hidden through multimedia files such as images and videos. Steganography can offer a way of exchanging secret and encrypted information in an untypical mechanism where communicating parties can only interpret the secret message. The literature has shown a great interest in the least significant bit (LSB) technique which aims at embedding the secret message bits into the most insignificant bits of the image pixels. Although LSB showed a stable performance of image steganography yet, many works should be done on the message part. This paper aims to propose a combination of LSB and Deflate compression algorithm for image steganography. The proposed Deflate algorithm utilized both LZ77 and Huffman coding. After compressing the message text, LSB has been applied to embed the text within the cover image. Using benchmark images, the proposed method demonstrated an outperformance over the state of the art. This can proof the efficacy of using Deflate as a data compression prior to the LSB embedding.

Reference-free differential histogram-correlative detection of steganography: performance analysis

<span lang="EN-US">Recent <span>research has demonstrated the effectiveness of utilizing neural networks for detect tampering in images. However, because accessing a database is complex, which is needed in the classification process to detect tampering, reference-free steganalysis attracted attention. In recent work, an approach for least significant bit (LSB) steganalysis has been presented based on analyzing the derivatives of the histogram correlation. In this paper, we further examine this strategy for other steganographic methods. Detecting image tampering in the spatial domain, such as image steganography. It is found that the above approach could be applied successfully to other kinds of steganography with different orders of histogram-correlation derivatives. Also, the limits of the ratio stego-image to cover are considered, where very small ratios can escape this detection method unless </span> modified.</span>