Novel steganalysis schemes for BPCS steganography

Abstract

The content of message can be protected by using cryptographic technology, and the encrypted message can be further hidden by information hiding technology. least significant bit (LSB) substitution is a popular steganographic technique in spatial domain and it becomes a trendy topic in studying of detecting the LSB substitution technique. Bitplane complexity segmentation (BPCS) steganography proposed by Kawaguchi and Eason increases the embedding capacity to 50% while the capacity of the tradition LSB substitution only 10% of the cover media. Some BPCS steganalysis schemes are proposed based on the statistical characteristics, in which messages are embedded into least significant bitplane using the BPCS steganography. In the case of the messages embedding bypasses the LSB or into one more bitplanes, the foregoing steganalysis technique will become invalid. In this paper, two novel BPCS steganalysis schemes are proposed to overcome these attacks and to enhance the detective ability of BPCS steganalysis. Experiment results show the feasibility and correctness of the proposed schemes.

Keywords:

• INFORMATION HIDING
• LEAST SIGNIFICANT BIT (LSB) SUBSTITUTION
• BITPLANE COMPLEXITY SEGMENTATION (BPCS) STEGANOGRAPHY
• X2 ATTACKS
• EXTEND X2 ATTACKS