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
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 Information Technology and Management
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 |
In this paper, an algorithm to embed information in a map along Hamiltonian path is presented. A file based data structure in which a graph is treated as a composition of three components, node, segment and intermediate points that constitute a segment, is used to store a graph. In a map with N nodes, each node can represent ?log2N? bits from message bit strings. Any bits = 0 from message between bit strings represented by adjacent nodes are embedded in a segment. In the case of a multi graph, a segment is selected based on the last two bits in the nodes. A pre Hamiltonian path is determined in the map starting from node represented by the first ?log2N? bits from message string to the last bit string ?log2N?. The method is tested on different maps and messages of different sizes and robust results have been observed. Retrieval is based on the key S, |m|, ? and traversing along the pre Hamiltonian path starting from node S.