Information hiding: Arabic text steganography by using Unicode characters to hide secret data
by Allah Ditta; Cai Yongquan; Muhammad Azeem; Khurram Gulzar Rana; Haiyang Yu; Muhammad Qasim Memon
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 10, No. 1, 2018

Abstract: In recent years, information security has become a very important topic for researchers as well as military and government officials. For secure communication, it is necessary to develop novel ways to hide information. For this purpose, steganography is commonly used to send secret information to its destination using different techniques. In this article, our main focus is on text-based steganography. Hidden information in text files is difficult to discover as text data has low redundancy in comparison to other mediums of steganography. Hence, we use Arabic text to hide secret information using a combination of Unicode character's zero-width-character and zero-width-joiner in our proposed algorithm. The experimental results show hidden data capacity per word is significantly increased in comparison to the recently proposed algorithms. The major advantage of our proposed algorithm over previous research is the high visual similarity in both cover and stego-text that can reduce the attention of intruders.

Online publication date: Tue, 19-Dec-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email