25-08-2017, 09:32 PM
A High Embedding Efficiency Steganography Scheme for Wet Paper Codes
A High Embedding Efficiency.docx (Size: 12.95 KB / Downloads: 31)
In this paper, a good data hiding scheme has been proposed. This scheme embeds messages into a still image based on (7,4) Hamming Codes oriented wet paper codes . It embeds a segment of three secret bits into a group of seven cover pixels at a time. The experimental results show that the proposed scheme achieves high embedding efficiency and acceptable capacity.
A Secure Steganography: Noisy Region Embedding
Generally, the steganographic algorithm randomly selects adequate pixels for data embedding, and the embedding distortion distributes uniformly in cover data. However, uniform embedding is not an ideal approach, because the modification in smooth regions (of an image) is more likely to be perceived than in noisy regions. In this paper, in order to achieve a higher level of security, we propose a novel steganographic scheme in which the embedding modification is carried out in noisy regions. The experiments in which we compare the novel scheme with some state-of-the-art steganographic algorithms support our argument. In addition, the proposed algorithm is computationally efficient for both encoding and decoding, and suitable for practical applications.
Audio steganography using bit modification
A method of embedding a covert audio message in a cover utterance for secure communication is presented. The covert message is represented in a compressed form with possibly encryption and/or encoding for added security. One bit in each of the samples of a given cover utterance is altered in accordance with the data bits and a key. The same key is used to retrieve the embedded bits at the receiver. The results, based on cover signals from a clean TIMIT utterance and a noisy aircraft cockpit utterance, show that the technique meets several major criteria for successful covert communication.
Anti-forensic Steganography Using Multi-bit Minimum Error Replacement with Flexible Bit Location
Multi-bit minimum error replacement (MER) is a method that can embed multi-bit logo/secret data into k least-significant bits (LSBs) of cover data only introduces minimum embedding error (MEE). However, k-LSBs MER suffers from weak anti-forensics. Moreover, it is unfortunate because no literature discusses the formulations and the properties of multi-bit MEE up to this day. Therefore, this work proposes an anti-forensic steganography system using multi-bit MERs with flexible bit location (multi-bit MER_FBL) to overcome the problem of forensics. This work also illustrates the formulations and properties of MEEs in the multi-bit MER_FBL. The embedding error can be easily and determinedly evaluated using the proposed formulations and properties. The proposed multi-bit MER_FBL embeds and hides multi-bit (k-bit, k>=1) logo/secret data into any adjoining (starting with the ith location) k-bit bibi-1¡Kbi-k+1 of cover data only introduces MEE in the range of 0 to +-(2^k-1)2^(i-k), moreover, its flexible bit location enhances the embedded security as security increases as embedding location increases. As the proposed multi-bit MER_FBL can embed multi-bit logo/secret data into any adjoining bits of cover data and has high embedding capacity and high embedding quality, this method was applied for data steganography. Finally, anti-forensics of the proposed steganography system is demonstrated using the statistical attack of Chi-square analysis.