1. NCCU Academic Hub
  2. 學術產出
  3. Journals of NCCU
  4. Journal Articles
  5. Item

學術產出-Journal Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 A Graph Theoretic Approach to Sustainable Steganography
作者 Kumar, Vinay;Muttoo, Sunil Kumar
關鍵詞 Extra Bytes;Graph Theoretic Approach;Steganography;Information Hiding;Sustainable Embedding;Natural Embedding;Partial Embedding;Cross Embedding;Explicit Embedding
日期 2011-09
上傳時間 16-Aug-2016 15:46:02 (UTC+8)
摘要 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.
關聯 資管評論, 17(1), 19-37
MIS review
資料類型 article
dc.creator (作者) Kumar, Vinay;Muttoo, Sunil Kumar
dc.date (日期) 2011-09
dc.date.accessioned 16-Aug-2016 15:46:02 (UTC+8)-
dc.date.available 16-Aug-2016 15:46:02 (UTC+8)-
dc.date.issued (上傳時間) 16-Aug-2016 15:46:02 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/100293-
dc.description.abstract (摘要) 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.
dc.format.extent 1489576 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) 資管評論, 17(1), 19-37
dc.relation (關聯) MIS review
dc.subject (關鍵詞) Extra Bytes;Graph Theoretic Approach;Steganography;Information Hiding;Sustainable Embedding;Natural Embedding;Partial Embedding;Cross Embedding;Explicit Embedding
dc.title (題名) A Graph Theoretic Approach to Sustainable Steganography
dc.type (資料類型) article