Abstract

AbstractIn parity assignment-based steganography for palette images, all colors in a host image are divided into two subsets, and each pixel is used to carry one secret bit. This paper describes an analytic method against the parity assignment-based steganographic techniques. By finding the rule of color modifications, a steganalyst can attempt to recover the original histogram in a way that is a reverse of data embedding. Because of the abnormal colors in the original image, an excessive operation will cause some negative values in the recovered histogram. This provides a clue for revealing the presence of secret message and estimating the length of embedded bit sequence.

Full Text
Paper version not known

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.