IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i9p1558-d411938.html
   My bibliography  Save this article

Novel Linguistic Steganography Based on Character-Level Text Generation

Author

Listed:
  • Lingyun Xiang

    (Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha 410114, China
    School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410114, China
    Hunan Provincial Key Laboratory of Smart Roadway and Cooperative Vehicle-Infrastructure Systems, Changsha University of Science and Technology, Changsha 410114, China)

  • Shuanghui Yang

    (School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410114, China)

  • Yuhang Liu

    (School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha 410114, China)

  • Qian Li

    (Faculty of Engineering and Information Technology, University of Technology Sydney, Ultimo, NSW 2007, Australia)

  • Chengzhang Zhu

    (Academy of Military Sciences, Beijing 100091, China)

Abstract

With the development of natural language processing, linguistic steganography has become a research hotspot in the field of information security. However, most existing linguistic steganographic methods may suffer from the low embedding capacity problem. Therefore, this paper proposes a character-level linguistic steganographic method (CLLS) to embed the secret information into characters instead of words by employing a long short-term memory (LSTM) based language model. First, the proposed method utilizes the LSTM model and large-scale corpus to construct and train a character-level text generation model. Through training, the best evaluated model is obtained as the prediction model of generating stego text. Then, we use the secret information as the control information to select the right character from predictions of the trained character-level text generation model. Thus, the secret information is hidden in the generated text as the predicted characters having different prediction probability values can be encoded into different secret bit values. For the same secret information, the generated stego texts vary with the starting strings of the text generation model, so we design a selection strategy to find the highest quality stego text from a number of candidate stego texts as the final stego text by changing the starting strings. The experimental results demonstrate that compared with other similar methods, the proposed method has the fastest running speed and highest embedding capacity. Moreover, extensive experiments are conducted to verify the effect of the number of candidate stego texts on the quality of the final stego text. The experimental results show that the quality of the final stego text increases with the number of candidate stego texts increasing, but the growth rate of the quality will slow down.

Suggested Citation

  • Lingyun Xiang & Shuanghui Yang & Yuhang Liu & Qian Li & Chengzhang Zhu, 2020. "Novel Linguistic Steganography Based on Character-Level Text Generation," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
  • Handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1558-:d:411938
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/9/1558/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/8/9/1558/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jie Wang & Chunfang Yang & Ping Wang & Xiaofeng Song & Jicang Lu, 2020. "Payload location for JPEG image steganography based on co-frequency sub-image filtering," International Journal of Distributed Sensor Networks, , vol. 16(1), pages 15501477198, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:9:p:1558-:d:411938. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.