Hiding Message in Map Along Pre-Hamiltonian Path

Hiding Message in Map Along Pre-Hamiltonian Path

Sunil Kumar Muttoo, Vinay Kumar
Copyright: © 2010 |Pages: 14
DOI: 10.4018/jisp.2010100102
(Individual Articles)
No Current Special Offers


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.
Article Preview

1. Introduction

The steganographic algorithm introduced in this paper uses a planar graph (Berge, 1962) as cover object. A planar graph is also called a map. Normal data structure used to represent a graph does not provide enough redundancy for hiding. Before discussing the details, background of the approach, motivation behind the paper and the contribution that this paper can provide to the computing world need to be discussed.

1.1 Background

Steganography is the art of hiding a secret message inside a cover (host) object. The purpose is to allow two parties to communicate surreptitiously, without raising suspicion from an eavesdropper. Steganography (Katzenbeisser & Petitcolas, 2000) and cryptography (Stallings, 1999) are two techniques used for secret communication. Cryptography attempts to hide the contents of a message while steganography attempts to hide the existence of a message (Anderson & Petitcolas, 1998). A digital cover object may be an image, audio, video or a graph –a vector data. The cover object with embedded secret message is called stego object i.e.

cover + secret message = stego

Stego object is the medium that carries the secret message (hidden data). Main requirement for any steganographic technique is undetectability, robustness, tamper resistance and embedding capacity (Cole, 2003; Johnson & Jajodia, 1998a). These properties of any steganographic algorithm are mainly influenced by following four factors:

  • The choice of the cover object,

  • The selection rule used to identify individual elements of the cover that could be modified (or used without any modification) during embedding,

  • The type of embedding operations that modifies the cover elements, and

  • The number of embedding changes.

The embedding capacity and robustness in steganographic algorithm are so diagonally opposite placed that it is difficult to achieve both simultaneously at the maximum level (Saloman, 2003; Kumar & Muttoo, 2008, 2009b). Thus, a steganographic algorithm achieves robustness at low embedding capacity. The placement of embedding changes in the cover is called a selection channel. A channel is kept secret by the communicating partners in the similar way a secret key is maintained in cryptography. After embedding, stego medium should maintain similarity with cover to avoid any detection of the hidden data. It is achieved by minimizing the distortion in the cover medium while embedding the hidden data (Anderson & Petitcolas, 1998).

The way a cover is stored in digital form plays an important role in minimizing distortion introduced in cover while embedding secret message. A cover is collection of some basic elements. Basic element in image is pixel while that in a graph is node and segment. A segment consists of many intermediate points (Kumar & Muttoo, in press). More is the amount of bits available to store one element of a cover medium, less is the visible distortion after embedding and vice versa.

Complete Article List

Search this Journal:
Volume 17: 1 Issue (2023)
Volume 16: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing