Hiding Message in Map Along Pre-Hamiltonian Path

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.

[1]  David T. Green,et al.  A Strategy for Enterprise VoIP Security , 2009 .

[2]  J. B. Thompson,et al.  Ethical Elements of Security and Developments in Cyberspace that Should Promote Trust in Electronic Commerce , 2001 .

[3]  Touradj Ebrahimi,et al.  Steganography for Three-Dimensional Polygonal Meshes , 2002, SPIE Optics + Photonics.

[4]  Mari W. Buche,et al.  A Unified Information Security Management Plan , 2005 .

[5]  C. Berge.  The theory of graphs and its applications , 1963 .

[6]  Isaac Weiss,et al.  Geometric invariants and object recognition , 1993, International Journal of Computer 11263on.

[7]  Hamid R. Nemati.  Techniques and Applications for Advanced Information Privacy and Security: Emerging Organizational, Ethical, and Human Issues , 2009 .

[8]  Sunil Kumar Muttoo,et al.  Principle of Graph Theoretic Approach to Digital Steganography , 2009 .

[9]  Petra Mutzel,et al.  A Graph-Theoretic Approach to Steganography , 2005, Communications and Multimedia Security.

[10]  Ram Dantu,et al.  Spam Classification Based on E-Mail Path Analysis , 2008, Int. J. Inf. Secur. Priv..

[11]  Frank Rubin,et al.  A Search Procedure for Hamilton Paths and Circuits , 1974, JACM.

[12]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[13]  Hamid R. Nemati.  International Journal of Information Security and Privacy , 2007 .

[14]  Sushil Jajodia,et al.  Steganalysis of Images Created Using Current Steganography Software , 1998, Information Hiding.

[15]  Eric Cole,et al.  Hiding in Plain Sight: Steganography and the Art of Covert Communication , 2003 .

[16]  T.I. Fenner,et al.  On the existence of Hamiltonian cycles in a class of random graphs , 1983, Discret. Math..

[17]  Isaac Weiss,et al.  Review Geometric Invariants and Object Recognition , 1993 .

[18]  Sushil Jajodia,et al.  Exploring steganography: Seeing the unseen , 1998, Computer.

[19]  MAX J. EGENHOFER,et al.  Point Set Topological Relations , 1991, Int. J. Geogr. Inf. Sci..

[20]  Vandana Sharma,et al.  Overcoming 64kb data size limit in handling large spatial data in GISNIC while cleaning and building topology , 2006, Int. J. Inf. Technol. Manag..

[21]  Hamid R. Nemati,et al.  Information Security and Ethics: Concepts, Methodologies, Tools and Applications , 2008 .

[22]  Te-Shun Chou.  Information Assurance and Security Technologies for Risk Assessment and Threat Management: Advances , 2011 .

[23]  Vinay Kumar,et al.  Relevance of Steganography, in General, and Graph Theoretic Approach in Particular, in Indian Security Concern and Measure , 2008 .

[24]  Mohammad Jafar Tarokh,et al.  A New Soa Security Model to Protect Against Web Competitive Intelligence Attacks by Software Agents , 2009, Int. J. Inf. Secur. Priv..

[25]  Vinay Kumar,et al.  A data structure for graph to facilitate hiding of information in a graph's segments – a graph theoretic approach to steganography , 2009 .

[26]  Sushil K. Sharma,et al.  Handbook of Research on Information Security and Assurance , 2008 .

[27]  Haralambos Mouratidis,et al.  Information Systems Security: Cases of Network Administrator Threats , 2007, Int. J. Inf. Secur. Priv..

[28]  Stephan Katzenbeisser,et al.  Information Hiding Techniques for Steganography and Digital Watermaking , 1999 .

[29]  Vinay Kumar,et al.  Graph Theoretic Approach to Steganography to Secure Message Digest , 2010, Inf. Secur. J. A Glob. Perspect..

[30]  Ross J. Anderson,et al.  On the limits of steganography , 1998, IEEE J. Sel. Areas Commun..

[31]  Hugo Krawczyk,et al.  Strengthening Digital Signatures Via Randomized Hashing , 2006, CRYPTO.

[32]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[33]  David Salomon,et al.  Data Privacy and Security , 2003, Springer New York.

[34]  Hamid R. Nemati,et al.  Applied Cryptography for Cyber Security and Defense: Information Encryption and Cyphering , 2010 .

[35]  G. Dhillon.  Information Security Management: Global Challenges in the New Millennium , 2000 .

[36]  Béla Bollobás,et al.  Almost all Regular Graphs are Hamiltonian , 1983, European journal of combinatorics (Print).

[37]  Georg Disterer.  Attacks on IT Systems: Categories of Motives , 2012 .

[38]  Sunil Kumar Muttoo,et al.  A Graph Theoretic Approach to Sustainable Steganography , 2011 .

[39]  Ingemar J. Cox,et al.  Information Transmission and Steganography , 2005, IWDW.