New Scheme For Data Hiding Using N-Ary Tree Structure
Dil Kumar, N. Suma N. Suma · International Journal of Scientific Research · 2012
The information hiding deals with distortion reduction using steganography and security enhancement us- ing cryptography. Distortion reduction is done using Tree Based Parity Check which uses Majority vote strategy. The Tree Based Parity Check is very optimal for cloaking a message on image. The proposed majority vote strategy results in least distortion. The SHA-1 algorithm is implemented for security enhancement. The result obtained in proposed method works effectively even with large payload. I.I NTRODUCTION Stenography studies the scheme to hide secrets into the com- munication between the sender and the receive r such that no other people can detect the existence of the secrets. A steg- anographic method consists of an embedding algorithm and an extraction algorithm. The embedding algorithm describes how t o hide a message into the , cover object and the extrac- tion algorithm illustrates how to extract the message from the stego object. A commonly used strategy for steganography is to embed the message by slightly distorting the cove r object into the target stego object. If the distortion is sufficiently small, the stego object will be indistinguishable from the noisy cove r object. Therefore, reducing distortion is a crucial issue for steg- anographic methods. In this paper, we propose an efficient em- bedding scheme that uses the least number of changes over the tree-based parity check model. The idea of matrix embed- ding and defined the codes with the matrix as steganographic codes. For matrix embedding, finding the stego object with least distortion is difficult in general. In some special cases, there exist constructive and fast methods. LT codes to improve the computational complexity of wet paper codes derive d a hash function to efficiently obtain the stego ob- ject. Proposed a scheme called tree-based parity check.