Coverless Text Steganography Based on Maximum Variable Bit Embedding Rules

Abstract

As a carrier of information hiding, text is difficult to hide secret because of its less redundancy. The robustness and security of some traditional methods based text are not high. Based on Markov chain model, a coverless text steganography algorithm was proposed in this paper. According to the characteristic and value of transition probability in the model, the algorithm used the maximum variable bit embedding instead of the usual fixed bit embedding. In order to verify the effectiveness of the algorithm, different datasets and algorithms were selected to test. By comparing with results, the proposed model had higher concealment and hidden capacity.