题名 |
A Graph Theoretic Approach to Sustainable Steganography |
DOI |
10.6131/MISR.201109_17(1).0002 |
作者 |
Vinay Kumar;Sunil Kumar Muttoo |
关键词 |
Extra Bytes ; Graph Theoretic Approach ; Steganography ; Information Hiding ; Sustainable Embedding ; Natural Embedding ; Partial Embedding ; Cross Embedding ; Explicit Embedding |
期刊名称 |
MIS REVIEW:An International Journal |
卷期/出版年月 |
17卷1期(2011 / 09 / 01) |
页次 |
19 - 37 |
内容语文 |
英文 |
英文摘要 |
An algorithm based on graph-theoretic approach is introduced in this paper. A bipartite graph is created from message and cover object. Message M is broken into units of x (= 2, 4, or 8) bits long. For each x, a matching with m number of such x bits from cover file is determined using the bipartite graph. Wherever a matching for a node in left side is found with a node in right side then this part of the message is treated as either naturally or cross embedded in that port of the cover. Nodes in left side correspond to bits in message and those in right side correspond to group of bits in cover. The matching relationship is then embedded in the extra bytes of cover, fully utilizing the available redundancy or alternatively the sequence of indices is compressed and sent through separate channel. The algorithm achieves almost 100% matching for message elements in cover elements. The embedding algorithm has been put through mathematical and statistical test to ensure that it not only retains visual similarity in stego with cover file but also leaves other statistics of cover undistorted after embedding. Therefore it achieves sustainability. In this paper, we have taken BMP file to implement the algorithm. |
主题分类 |
基礎與應用科學 >
資訊科學 社會科學 > 管理學 |
参考文献 |
|
被引用次数 |