Abstract

Image-based data hiding methods have been used in the development of various applications in computer vision. At present, there are two main types of data hiding based on secret sharing, namely dual-image data hiding and multi-image data hiding. Dual-image data hiding is a kind of secret sharing-based data hiding in the extreme case. During the image transmission and storage process, the two shadow images are visually highly similar. Multi-image data hiding disassembles the cover image into multiple meaningless secret images through secret sharing. Both of the above two methods can easily attract attackers’ attention and cannot effectively guarantee the security of the secret message. In this paper, through the Shamir threshold scheme for secret sharing, the secret message is disassembled into multiple subsecrets that are embedded in the smooth blocks of multiple different images, by substituting the bitmap of block truncation coding. Thus, the shortcomings of the above two data hiding methods are effectively avoided. The proposed method embeds the secret messages in the compressed images, so it satisfactorily balances the visual quality and the embedding capacity. In our method, the shadow images make sense while they are not visually similar. The compression ratio is four, so the embedding capacity of our method has an obvious advantage under the same storage space.

Full Text
Published version (Free)

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