Paper Details

This technology proposes a lossless, a reversible, and a joined information hiding plans for ciphertextpictures scrambled by open key cryptosystems with probabilistic and holomorphic properties. In the lossless plan, theciphertext pixels are supplanted with new values to insert the extra information into a few LSB-planes of ciphertext pixelsby different layer wet paper coding. Then, the embedded data can be directly extracted from the encrypted domain andthe data embedding operation does not affect the decryption of unique plaintext picture. In the reversible plan, apreprocessing is utilized to recoil the picture histogram before picture encryption, so that the change on encodedpictures for information implanting won t bring about any pixel oversaturation in plaintext area. Despite the fact that aslight twisting is presented, the inserted information can be extricated and the first picture can be recouped from thestraightforwardly decrypted image. Because of the similarity between the lossless and reversible plans, the informationimplanting operations in the two conduct can be at the same time performed in an encoded picture. With the joinedstrategy, a recipient might separate a piece of inserted information before unscrambling, and concentrate another pieceof installed information and recuperate the first plaintext picture after decoding.

Abhay suryawanshi, Pratik Bansode, Lakhan Patole, Sachin Patil, Prof.Vikas Mapari, “Lossless and Reversible Data Hiding in Encrypted Images with Public Key Cryptography”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 3, Issue 5, pp. 796-801, May 2016.