Reversible Data Hiding Through Hamming Code Using Dual Image

In this paper, we propose a new dual-image based reversible data hiding scheme through Hamming code (RDHHC) using shared secret keys. We collect a block of seven pixels from cover image and copy it into two arrays. We then adjust redundant LSB bits using odd parity such that any error creation encountered are recovered at the receiver end. Before data embedding, we first complement bit at the position of shared secret key of the block. After that we embed secret message bit by error creation in any position of the block except key position. The receiver detects and corrects the error using Hamming error correcting code. Two shared secret keys kappa and xi help us to perform these data hiding and recovery operations. We distribute two stego pixel blocks among dual image based on the bit pattern of shared secret key xi of length 128 bits. Finally, we compare our scheme with other state-of-the-art methods and obtain reasonably better performance in terms of security and quality.