Journals / IASC / Vol.29, No.3

Research Article


A Robust Text Coverless Information Hiding Based on Multi-Index Method

Lin Xiang1, Jiaohua Qin1,*, Xuyu Xiang1, Yun Tan1, Neal N. Xiong2
1 College of Computer Science and Information Technology, Central South University of Forestry and Technology, Changsha, 410004, China
2 Department of mathematics and computer science, Northeastern State University, OK, 74464, USA
* Corresponding Author: Jiaohua Qin. Email:


Recently, researchers have shown that coverless information hiding technology can effectively resist the existing steganalysis tools. However, the robustness of existing coverless text information hiding methods is generally poor. To solve this problem, we propose a robust text coverless information hiding method based on multi-index. Firstly, the sender segment the secret information into several keywords. Secondly, we transform keywords into keyword IDs by the word index table and introduce a random increment factor to control. Then, search all texts containing the keyword ID in the big data text, and use the robust text search algorithm to find multiple texts. Finally, these texts are converted into mixed indexes sent to the receiver. The receiver disassembles received indexes through the index construction protocol and uses the random increment factor to extract the secret information. Experimental results show that this method improves the concealment and security of secret information and has strong robustness compared with the state-of-the-art methods.


Coverless information hiding; random increment factor; multi- index; text coverless
  • 370


  • 228


  • 100


Share Link

WeChat scan