{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:54:04Z","timestamp":1781106844296,"version":"3.54.1"},"reference-count":26,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,10,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/jisp.2010100102","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T16:03:28Z","timestamp":1297785808000},"page":"21-34","source":"Crossref","is-referenced-by-count":3,"title":["Hiding Message in Map Along Pre-Hamiltonian Path"],"prefix":"10.4018","volume":"4","author":[{"given":"Sunil Kumar","family":"Muttoo","sequence":"first","affiliation":[{"name":"University of Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinay","family":"Kumar","sequence":"additional","affiliation":[{"name":"National Informatics Centre, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jisp.2010100102-0","doi-asserted-by":"publisher","DOI":"10.1109\/49.668971"},{"key":"jisp.2010100102-1","doi-asserted-by":"crossref","unstructured":"Aspert, N., Drelie, E., Maret, Y., & Ebrahimi, T. (2002). Steganography for Three-Dimensional Polygonal Meshes. In Proceedings of SPIE, 47th Annual Meeting 2002 (pp. 705-708).","DOI":"10.1117\/12.455358"},{"key":"jisp.2010100102-2","author":"C.Berge","year":"1962","journal-title":"Theory of Graphs and its Application"},{"key":"jisp.2010100102-3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0195-6698(83)80039-0","article-title":"Almost all regular graphs are Hamiltonian.","volume":"4","author":"B.Bollobas","year":"1983","journal-title":"European Journal of Combinatorics"},{"key":"jisp.2010100102-4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","author":"J. A.Bondy","year":"1976","journal-title":"Graph Theory with Applications"},{"key":"jisp.2010100102-5","author":"E.Cole","year":"2003","journal-title":"Hiding in Plain Sight: Steganography and the Art of Covert Communication"},{"key":"jisp.2010100102-6","doi-asserted-by":"crossref","unstructured":"Cox, I. J., Kalkar, T., Pakura, G., & Scheel, M. (2005). Information Transmission and Steganography. In Digital Watermarking (LNCS 3710, pp. 15-29).","DOI":"10.1007\/11551492_2"},{"key":"jisp.2010100102-7","doi-asserted-by":"crossref","unstructured":"Cox, I. J., & Matthew, L. Miller, M. L., Bloom, J. A., Fridrich, J., & Kalkar, T. (2007). Digital Watermarking and Steganography. San Francisco: Morgan Kaufmann Publishers.","DOI":"10.1016\/B978-012372585-1.50015-2"},{"key":"jisp.2010100102-8","doi-asserted-by":"publisher","DOI":"10.1080\/02693799108927841"},{"key":"jisp.2010100102-9","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90046-8"},{"issue":"4","key":"jisp.2010100102-10","article-title":"A Search Procedure for Hamilton Paths and Circuits.","volume":"21","author":"R.Frank","year":"1974","journal-title":"Journal of the ACM"},{"key":"jisp.2010100102-11","doi-asserted-by":"crossref","unstructured":"Halevi, S., & Krawczyk, H. (2005, May). Strengthening Digital Signatures via Randomized Hashing. IETF.","DOI":"10.1007\/11818175_3"},{"key":"jisp.2010100102-12","doi-asserted-by":"crossref","unstructured":"Hetzl, S., & Mutzel, P. (2005). A Graph-Theoretic Approach to Steganography. In CMS (LNCS 3677, pp. 119-128).","DOI":"10.1007\/11552055_12"},{"key":"jisp.2010100102-13","doi-asserted-by":"crossref","unstructured":"Johnson, N.F., & Jajodia, S. (1998a). Exploring Steganography: Seeing the Unseen. IEEE Computer, 26-34.","DOI":"10.1109\/MC.1998.4655281"},{"key":"jisp.2010100102-14","doi-asserted-by":"crossref","unstructured":"Johnson, N. F., & Jajodia, S. (1998b, April). Steganalysis of Images Created Using Current Steganography Software. In Proceedings of the Second Information Hiding Workshop, Portland, OR.","DOI":"10.1007\/3-540-49380-8_19"},{"key":"jisp.2010100102-15","author":"S.Katzenbeisser","year":"2000","journal-title":"Information Hiding Techniques for Steganography and Digital Watermarking"},{"key":"jisp.2010100102-16","author":"V.Kumar","year":"2002","journal-title":"Discrete Mathematics"},{"key":"jisp.2010100102-17","unstructured":"Kumar, V., & Muttoo, S. K. (2008). Relevance of Steganography, in General, and Graph Theoretic Approach in particular, in Indian Security Concern and Measure. In Proceedings of the 2nd National Conference, INDIACom-2008 (pp. 183-188)."},{"key":"jisp.2010100102-18","doi-asserted-by":"publisher","DOI":"10.1504\/IJCNDS.2009.026879"},{"key":"jisp.2010100102-19","doi-asserted-by":"crossref","unstructured":"Kumar, V., & Muttoo, S. K. (2009b). Principle of Graph Theoretic Approach to Digital Steganography. In Proceedings of the 3rd National Conference, INDIACom-2009 (pp. 161-165).","DOI":"10.1504\/IJCNDS.2009.026879"},{"key":"jisp.2010100102-20","article-title":"A Graph Theoretic Approach to Sustainable Steganography.","author":"V.Kumar","journal-title":"International Journal of Information and Computer Security."},{"key":"jisp.2010100102-21","doi-asserted-by":"publisher","DOI":"10.1504\/IJITM.2006.008715"},{"key":"jisp.2010100102-22","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21707-9","author":"D.Saloman","year":"2003","journal-title":"Data Privacy and Security"},{"key":"jisp.2010100102-23","author":"W.Stallings","year":"1999","journal-title":"Cryptography & Network Security: Principles and Practice"},{"key":"jisp.2010100102-24","unstructured":"StegoArchive. (2001). Steganography Information, Software and News to enhance your Privacy. Retrieved from http:\/\/www.StegoArchive.com"},{"key":"jisp.2010100102-25","doi-asserted-by":"publisher","DOI":"10.1007\/BF01539536"}],"container-title":["International Journal of Information Security and Privacy"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=50495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T18:57:02Z","timestamp":1654109822000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jisp.2010100102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,10,1]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,10]]}},"URL":"https:\/\/doi.org\/10.4018\/jisp.2010100102","relation":{},"ISSN":["1930-1650","1930-1669"],"issn-type":[{"value":"1930-1650","type":"print"},{"value":"1930-1669","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,1]]}}}