A secured word by word Graph Steganography using Huffman encoding

Abstract

Graph Steganography (Graphstega) provides a method of covert communication by converting a message to plotted data in a graph. Due to numerous usages of graphs in our daily life, Graphstega can hide secret message communication without arising any suspicion. This paper proposes a secured Graphstega approach aiming at a secured method of information hiding that looks like innocent and unnoticeable to contemporary steganalytic attacks. Unlike other Graphstega approaches, proposed approach avoids letter by letter conversion. Instead, it converts the message to graph word by word using Huffman encoding. The numerical experiments demonstrate the integrity of the hidden message while encoding and decoding and strong durability of the proposed approach against steganalytic attacks.