Abstract

This paper proposes a multi-hider dual-image reversible data-hiding algorithm. Generating dual stego images, the proposed algorithm provides a high embedding capacity, exhibits high image quality, offers reversibility to restore the stego images, and suggests seven levels of secret message extraction. The message embedding in our algorithm contains two phases. In Phase-1, we embed an n-ary secret message vector followed by an m-ary secret message in each pixel using two distinct secret keys when rendering a new image from the source and target images using an optimal weighted color-transfer process. This phase produces a tentative stego image which exhibits a new color appearance, different from the input source image. In Phase-2, we introduce a weighted modulus operation to embed a k-ary secret message vector into a dual-pixel constructed from the tentative stego image. The message concealment is elaborately designed so that the hidden secret messages are intact. This phase produces dual stego images which carry three distinct secret messages. Using legitimate secret keys, an authorized receiver can extract one or parts of secret messages and recover the tentative stego color-transferred image without arousing any suspicion. The experimental results and analysis confirm that our scheme can resist RS and PVD steganalytic attacks. In addition, our algorithm provides both high embedding capacity and better image quality, outperforming its counterparts. To the best of our knowledge, our scheme is the first in the relevant literature that provides multi-hider reversible data hiding, thereby offering various levels of message extraction for secure data communication.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.