INNOVATIVE DATA HIDING SECURITY MODEL USING FORENSIC AUDIO VIDEO CRYPTO-STEGANOGRAPHY

Secret information concealing using steganography is simple but to maintain its security, perceptibility, robustness, embedding capacity and good recovery of both cover as well as secret information are the major issues. In this paper we have applied Block Plane Coding Technique (BPCT) for concealing the secret data into the randomly obtained frames of video and Least Significant Bit (LSB) algorithm for audio of same video. We have obtained the key security parameters like Peak Signal to Noise Ratio (PSNR), Mean Square Error (MSE), Normalize Cross Correlation Factor (NCCF), Bit Error Rate (BER), histogram and spectrograph before embedding and after recovering the protected data from stego video using forensic technique to increase the data security. Moreover, the proposed scheme provides a large hiding capacity, more security for secret data and good visual recovery of both secret data and original video than any other existing methods. Through many attack during transmission on stego video, it is found that the suggested approach is more robust than any other existing methods

Comparison of high capacity steganography techniques

The objective of this paper is to implement the Bit Plane Complexity Segmentation (BPCS) algorithm and provide a comparison in terms of effectiveness and hiding capacity with the least significant bits algorithm (LSB) using 4 bits. The BPCS algorithm was chosen due to the effective high hiding capacity promised. The four LSB algorithm was selected as it promised a similar capacity. The motivation for the work was to explicitly examine the hypothesis that the BPCS algorithm would out perform the four LSB algorithm using low order attacks. Effectiveness of the algorithms was measured by visual attacks and basic first order statistical attacks on the stego-images produced. The outcome of the research showed that whilst the hiding capacity of the two algorithms were comparable (both equating to roughly 50%), the four LSB algorithm at the maximum capacity was ineffective. This was due to the fact that a visual attack sufficed to realise there was something hidden. In contrast, the BPCS algorithm provided a much more effective method for obtaining a 50% capacity since visual attacks did not suffice for detection