Improving success probability and embedding efficiency in code based steganography

For stegoschemes arising from error correcting codes, embedding depends on a decoding map for the corresponding code. As decoding maps are usually not complete, embedding can fail. We propose a method to ensure or increase the probability of embedding success for these stegoschemes. This method is based on puncturing codes. We show how the use of punctured codes may also increase the embedding efficiency of the obtained stegoschemes

Product Perfect Codes and Steganography

A new coding technique to be used in steganography is evaluated. The performance of this new technique is computed and comparisons with the well-known theoretical upper bound, Hamming upper bound and basic LSB are established

Introducing a New Evaluation Criteria for EMD-Base Steganography Method

Steganography is a technique to hide the presence of secret communication. When one of the communication elements is under the influence of the enemy, it can be used. The main measure to evaluate steganography methods in a certain capacity is security. Therefore, in a certain capacity, reducing the amount of changes in the cover media, creates a higher embedding efficiency and thus more security of an steganography method. Mostly, security and capacity are in conflict with each other, the increase of one lead to the decrease of the other. The presence of a single criterion that represents security and capacity at the same time be useful in comparing steganography methods. EMD and the relevant methods are a group of steganography techniques, which optimize the amount of changes resulting from embedding (security). The present paper is aimed to provide an evaluation criterion for this group of steganography methods. In this study, after a general review and comparison of EMD-based steganography techniques, we present a method to compare them exactly, from the perspective of embedding efficiency. First, a formula is presented to determine the value of embedding efficiency, which indicates the effect of one or more changes on one or more pixels. The results demonstrate that the proposed embedding efficiency formula shows the performance of the methods better when several changes are made on a pixel compared to the existing criteria. In the second step, we have obtained an upper bound, which determines the best efficiency for each certain capacity. Finally, based on the introduced bound, another evaluation criterion for a better comparison of the methods is presented

Advances in Syndrome Coding based on Stochastic and Deterministic Matrices for Steganography

Steganographie ist die Kunst der vertraulichen Kommunikation. Anders als in der Kryptographie, wo der Austausch vertraulicher Daten für Dritte offensichtlich ist, werden die vertraulichen Daten in einem steganographischen System in andere, unauffällige Coverdaten (z.B. Bilder) eingebettet und so an den Empfänger übertragen. Ziel eines steganographischen Algorithmus ist es, die Coverdaten nur geringfügig zu ändern, um deren statistische Merkmale zu erhalten, und möglichst in unauffälligen Teilen des Covers einzubetten. Um dieses Ziel zu erreichen, werden verschiedene Ansätze der so genannten minimum-embedding-impact Steganographie basierend auf Syndromkodierung vorgestellt. Es wird dabei zwischen Ansätzen basierend auf stochastischen und auf deterministischen Matrizen unterschieden. Anschließend werden die Algorithmen bewertet, um Vorteile der Anwendung von Syndromkodierung herauszustellen

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