Secure Steganographic Methods for Palette Images
IH '99 Proceedings of the Third International Workshop on Information Hiding
A Secure Data Hiding Scheme for Two-Color Images
ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Constructing good covering codes for applications in steganography
Transactions on data hiding and multimedia security III
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
Analysis of parity assignment steganography in palette images
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
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
Inequalities for covering codes
IEEE Transactions on Information Theory - Part 1
Hi-index | 0.00 |
Color and binary images are popular subjects for data hiding. In this paper we propose a method to controlling quality of hiding secret data in binary images by using small blocks of 12 pixels with a restriction that in each block at most two pixels are changed to embed 6 secret bits in case it is successful. The method uses the Z2-module Z$_{\rm 2}^{\rm 6 }$of integers modulo 2 and this shows the way to overcome the limit (12,6)2 which can not reached by error correcting block codes approach. The method presents the way used secret keys for small blocks which remain high safety property of the scheme. The scheme can be modified to control high quality of stego palette images by combining with Optimal Parity Assignment (OPA) approach for hiding secret data in palette images, to prevent from steganalysis.