A secure audio steganography approach

A wide range of steganography techniques has been described in this paper. Beside the evaluation of embedding parameters for the existing techniques, two problems -weaknesses- of substitution techniques are investigated which if they could be solved, the large capacity - strength- of substitution techniques would be practical. Furthermore, a novel, principled approach to resolve the problems is presented. Using the proposed genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness

Adopt an optimal location using a genetic algorithm for audio steganography

With the development of technologies, most of the users utilizing the Internet for transmitting information from one place to another place. The transmitted data may be affected because of the intermediate user. Therefore, the steganography approach is applied for managing the secret information. Here audio steganography is utilized to maintain the secret information by hiding the image into the audio files. In this work, discrete cosine transforms, and discrete wavelet transform is applied to perform the Steganalysis process. The optimal hiding location has been identified by using the optimization technique called a genetic algorithm. The method utilizes the selection, crossover and mutation operators for selecting the best location. The chosen locations are difficult to predict by unauthorized users because the embedded location is varied from information to information. Then the efficiency of the system ensures the high PSNR, structural similarity index (SSIM), minimum mean square error value and Jaccard, which is evaluated on the audio Steganalysis dataset

A genetic-algorithm-based approach for audio steganography

In this paper, we present a novel, principled approach to resolve the remained problems of substitution technique of audio steganography. Using the proposed genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness. The robustness specially would be increased against those intentional attacks which try to reveal the hidden message and also some unintentional attacks like noise addition as well

Data hiding techniques in steganography using fibonacci sequence and knight tour algorithm

The foremost priority in the information and communication technology era, is achieving an efficient and accurate steganography system for hiding information. The developed system of hiding the secret message must capable of not giving any clue to the adversaries about the hidden data. In this regard, enhancing the security and capacity by maintaining the Peak Signal-to-Noise Ratio (PSNR) of the steganography system is the main issue to be addressed. This study proposed an improved for embedding secret message into an image. This newly developed method is demonstrated to increase the security and capacity to resolve the existing problems. A binary text image is used to represent the secret message instead of normal text. Three stages implementations are used to select the pixel before random embedding to select block of (64 × 64) pixels, follows by the Knight Tour algorithm to select sub-block of (8 × 8) pixels, and finally by the random pixels selection. For secret embedding, Fibonacci sequence is implemented to decomposition pixel from 8 bitplane to 12 bitplane. The proposed method is distributed over the entire image to maintain high level of security against any kind of attack. Gray images from the standard dataset (USC-SIPI) including Lena, Peppers, Baboon, and Cameraman are implemented for benchmarking. The results show good PSNR value with high capacity and these findings verified the worthiness of the proposed method. High complexities of pixels distribution and replacement of bits will ensure better security and robust imperceptibility compared to the existing systems in the literature

A Study of Data Security on E-Governance using Steganographic Optimization Algorithms

Steganography has been used massively in numerous fields to maintain the privacy and integrity of messages transferred via the internet. The need to secure the information has augmented with the increase in e-governance usage. The wide adoption of e-governance services also opens the doors to cybercriminals for fraudulent activities in cyberspace. To deal with these cybercrimes we need optimized and advanced steganographic techniques. Various advanced optimization techniques can be applied to steganography to obtain better results for the security of information. Various optimization techniques like particle swarm optimization and genetic algorithms with cryptography can be used to protect information for e-governance services. In this study, a comprehensive review of steganographic algorithms using optimization techniques is presented. A new perspective on using this technique to protect the information for e-governance is also presented. Deep Learning might be the area that can be used to automate the steganography process in combination with other method

An enhanced method based on intermediate significant bit technique for watermark images

Intermediate Significant Bit digital watermarking technique (ISB) is a new approved technique of embedding a watermark by replacing the original image pixels with new pixels. This is done by ensuring a close connection between the new pixels and the original, and at the same time, the watermark data can be protected against possible damage. One of the most popular methods used in watermarking is the Least Significant Bit (LSB). It uses a spatial domain that includes the insertion of the watermark in the LSB of the image. The problem with this method is it is not resilient to common damage, and there is the possibility of image distortion after embedding a watermark. LSB may be used through replacing one bit, two bits, or three bits; this is done by changing the specific bits without any change in the other bits in the pixel. The objective of this thesis is to formulate new algorithms for digital image watermarking with enhanced image quality and robustness by embedding two bits of watermark data into each pixel of the original image based on ISB technique. However, to understand the opposite relationship between the image quality and robustness, a tradeoff between them has been done to create a balance and to acquire the best position for the two embedding bits. Dual Intermediate Significant Bits (DISB) technique has been proposed to solve the existing LSB problem. Trial results obtained from this technique are better compared with the LSB based on the Peak Signal to Noise Ratio (PSNR) and Normalized Cross Correlation (NCC). The work in this study also contributes new mathematical equations that can study the change on the other six bits in the pixel after embedding two bits

Triple scheme based on image steganography to improve imperceptibility and security

A foremost priority in the information technology and communication era is achieving an effective and secure steganography scheme when considering information hiding. Commonly, the digital images are used as the cover for the steganography owing to their redundancy in the representation, making them hidden to the intruders. Nevertheless, any steganography system launched over the internet can be attacked upon recognizing the stego cover. Presently, the design and development of an effective image steganography system are facing several challenging issues including the low capacity, poor security, and imperceptibility. Towards overcoming the aforementioned issues, a new decomposition scheme was proposed for image steganography with a new approach known as a Triple Number Approach (TNA). In this study, three main stages were used to achieve objectives and overcome the issues of image steganography, beginning with image and text preparation, followed by embedding and culminating in extraction. Finally, the evaluation stage employed several evaluations in order to benchmark the results. Different contributions were presented with this study. The first contribution was a Triple Text Coding Method (TTCM), which was related to the preparation of secret messages prior to the embedding process. The second contribution was a Triple Embedding Method (TEM), which was related to the embedding process. The third contribution was related to security criteria which were based on a new partitioning of an image known as the Image Partitioning Method (IPM). The IPM proposed a random pixel selection, based on image partitioning into three phases with three iterations of the Hénon Map function. An enhanced Huffman coding algorithm was utilized to compress the secret message before TTCM process. A standard dataset from the Signal and Image Processing Institute (SIPI) containing color and grayscale images with 512 x 512 pixels were utilised in this study. Different parameters were used to test the performance of the proposed scheme based on security and imperceptibility (image quality). In image quality, four important measurements that were used are Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index (SSIM), Mean Square Error (MSE) and Histogram analysis. Whereas, two security measurements that were used are Human Visual System (HVS) and Chi-square (X2) attacks. In terms of PSNR and SSIM, the Lena grayscale image obtained results were 78.09 and 1 dB, respectively. Meanwhile, the HVS and X2 attacks obtained high results when compared to the existing scheme in the literature. Based on the findings, the proposed scheme give evidence to increase capacity, imperceptibility, and security to overcome existing issues

A forensics software toolkit for DNA steganalysis.

Recent advances in genetic engineering have allowed the insertion of artificial DNA strands into the living cells of organisms. Several methods have been developed to insert information into a DNA sequence for the purpose of data storage, watermarking, or communication of secret messages. The ability to detect, extract, and decode messages from DNA is important for forensic data collection and for data security. We have developed a software toolkit that is able to detect the presence of a hidden message within a DNA sequence, extract that message, and then decode it. The toolkit is able to detect, extract, and decode messages that have been encoded with a variety of different coding schemes. The goal of this project is to enable our software toolkit to determine with which coding scheme a message has been encoded in DNA and then to decode it. The software package is able to decode messages that have been encoded with every variation of most of the coding schemes described in this document. The software toolkit has two different options for decoding that can be selected by the user. The first is a frequency analysis approach that is very commonly used in cryptanalysis. This approach is very fast, but is unable to decode messages shorter than 200 words accurately. The second option is using a Genetic Algorithm (GA) in combination with a Wisdom of Artificial Crowds (WoAC) technique. This approach is very time consuming, but can decode shorter messages with much higher accuracy

Bit inverting map method for improved steganography scheme

Achieving an efficient and accurate steganography scheme for hiding information is the foremost priority in the information and communication technology era. The developed scheme of hiding the secret message must capable of not giving any clue to the adversaries about the hidden data. In this regard, enhancing the security and capacity by maintaining the Peak Signal-to-Noise Ratio (PSNR) of the steganography scheme is the main issue to be addressed. This study proposes an improved Bit Inverting Map (BIM) method and a new scheme for embedding secret message into an image. This newly developed scheme is demonstrated to increase the security and capacity to resolve the existing problems. A binary text image is used to represent the secret message instead of normal text. Three stages implementations are used to select pixels before random embedding to select block of (64 64) pixels, followed by the Knight Tour algorithm to select sub-block of (8 8) pixels, and finally by the random pixels selection. The proposed BIM is distributed over the entire image to maintain high level of security against any kind of attack. One-bit indicator is used to decide if the secret bits are inserted directly or inversely, which enhanced the complexity of embedding process. Color and gray images from the standard dataset (USC-SIPI) including Lena, Peppers, Baboon, and Cameraman are implemented for benchmarking. Self-captured images are used to test the efficacy of the proposed BIM method. The results show good PSNR values of 72.9 and these findings verified the worthiness of the proposed BIM method. High complexities of pixels distribution and replacement of bits will ensure better security and robust imperceptibility compared to the existing scheme in the literature