Secure Steganographic Methods for Palette Images
IH '99 Proceedings of the Third International Workshop on Information Hiding
Cyber warfare: steganography vs. steganalysis
Communications of the ACM - Voting systems
Fast and near optimal parity assignment in palette images with enhanced CPT scheme
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Progressive exponential clustering-based steganography
EURASIP Journal on Advances in Signal Processing
On the maximality of secret data ratio in CPTE schemes
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
On fastest optimal parity assignments in palette images
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
A new data hiding scheme for small blocks of twelve pixels on binary images by module approach
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
Hi-index | 0.00 |
In 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.