Autonomous Data hiding in an Encrypted Image using KM-DH Algorithm

  • et al.
Citations of this article
Mendeley users who have this article in their library.
Get full text


K Means Clustering (KM) based data hiding algorithm (KM-DH) is to perform cluster operation which means split pixels into chunks from already encrypted image. Under Consideration of splitted pixels find place to allocate information Authenticated person encrypt the image pixels with their key to prepare envelope image then flow goes by grouping the pixels to stuff the already encrypted image of lowest bits to generate place to allocate data using K means Clustering methods with the help of secret key it form split up matrix.In Receiver side after getting the encrypted data they can withdraw data and image separately without overlapping each other using data and image encryption key.At the same time receiver can also get both the image and data without any bug by dimensional link.




Janani*, S., Shalini, M., … Chandrasekar, A. (2019). Autonomous Data hiding in an Encrypted Image using KM-DH Algorithm. International Journal of Innovative Technology and Exploring Engineering, 9(2), 4950–4952.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free