IBM Systems Journal
Cryptography and network security (2nd ed.): principles and practice
Cryptography and network security (2nd ed.): principles and practice
Information Hiding Techniques for Steganography and Digital Watermarking
Information Hiding Techniques for Steganography and Digital Watermarking
Digital Image Processing
Hiding in Plain Sight: Steganography and the Art of Covert Communication
Hiding in Plain Sight: Steganography and the Art of Covert Communication
International Journal of Communication Networks and Distributed Systems
Digital Watermarking and Steganography
Digital Watermarking and Steganography
A graph–theoretic approach to steganography
CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
Information transmission and steganography
IWDW'05 Proceedings of the 4th international conference on Digital Watermarking
On the limits of steganography
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
A Hamiltonian graph approach is presented in this paper to ensure privacy and secrecy of a crucial secret message that is normally short and precise. A short secret message is treated as stream of bits. Each bit is compared with a functional output of a portion of cover image. The cover is partitioned into as many portions as there are bits in the message. If the bit in the message is equal to the functional output of the corresponding portion of cover, then nothing needs to be done. In case of inequality, a node of graph is created. Then adjacency among nodes is found so that exchange of colour components of pixels according to the direction of traversal in a Hamiltonian cycle makes the functional output of the portion equal to the corresponding bit. Whenever a node is not found to be adjacent to any other node, then the corresponding bit is spread over in the portion in such a way that net effect on the colour components of pixel remains < 0.01. The approach helps in retaining vital statistics of the cover in the stego.