Lossless and Reversible Data Hiding in Encrypted Images with Public Key Cryptography


  • Suryawanshi Abhay Avinash -


reversible data hiding, lossless data hiding, image encryption


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



How to Cite

Suryawanshi Abhay Avinash, & ARVIND S. SORATHIYA. (2016). Lossless and Reversible Data Hiding in Encrypted Images with Public Key Cryptography. International Journal of Advance Engineering and Research Development (IJAERD), 3(5), 43–48. Retrieved from https://ijaerd.com/index.php/IJAERD/article/view/4765