count extendible characters before/after dotted
characters for p and those before/after un-dotted
characters for q. The last column assumes equal-
probability of (p+r) and q.
Table 1: Comparing Kashida with dots approaches.
Approach P q r (p+r+q)/2
Dots
0.2764 0.4313 0.0300 0.3689
Kashidah-Before
0.2757 0.4296 0.0298 0.3676
Kashidah-After
0.1880 0.2204 0.0028 0.2056
The figures in Table 1 are quite near. As pointed
out previously, the dots approach is actually the
ideal unpractical case for our Kashida method. The
program was also tested under various formats and
results are reported in Table 2. It produced an
average capacity of 1.22%.
Table 2: Kashida experiments for different file-types.
6 CONCLUSION
This paper presents a watermarking scheme useful
for Arabic language electronic writing. It benefits
from the feature of having points within more than
half the text letters. We use pointed letters to hold
secret information bit ‘one’ and the un-pointed
letters to hold secret bit ‘zero’. Not all letters are
holding secret bits since the secret information needs
to fit in accordance to the cover-text letters.
Redundant Arabic Kashida (extension character) is
used beside the letters to note the specific letters
holding the hidden secret bits. The nice thing about
Kashida is that it doesn’t have any affect to the
writing content.
This method featured security, capacity, and
robustness, the three needed aspects of data hiding
and watermarking. Our proposed method is
evaluated and compared to a previous method
showing similar performance but with the advantage
of using standard fonts. This Arabic text
watermarking technique is also useful to other
languages having similar texts fonts structure such
as Persian and Urdu scripts, the official languages of
Iran and Pakistan, respectively. These characteristics
and features promises that this Arabic text
watermarking method using Kashida joint to pointed
letters is attractive in the information security field.
It should be noted, at the end, that this research
idea is not restricted only for the Arabic, Persian and
Urdu scripts. Most of the Semitic languages can use
some features in one form or another, and the
proposed approach can be slightly modified to suit
other languages requirements.
ACKNOWLEDEGMENTS
Thanks to King Fahd University of Petroleum and
Minerals (KFUPM), Dhahran, Saudi Arabia, for its
support of all research work. Thanks to the COE 509
students of the Applied Cryptography course for all
their inputs, feedback, and comments.
REFERENCES
Al-Sulaiti, L., 2004. Designing and Developing a Corpus
of Contemporary Arabic, MS Thesis, The University of
Leeds.
Chandramouli, R., and Memon, N., 2001. Analysis of LSB
based image steganography techniques, Proceedings
of the International Conference on Image Processing,
Vol. 3, pp. 1019 – 1022.
Chen, B., and Wornell, G., 2001. Quantization Index
Modulation: A Class of Provably Good Methods for
Digital Watermarking and Information Embedding,
IEEE Trans. Information Theory, Vol. 47, No. 4, pp.
1423-1443.
Doërr, G., and Dugelay, J., 2003. A Guide Tour of Video
Watermarking”, Signal Processing: Image
Communication, Vol. 18, No 4, pp. 263-282.
Gopalan, K., 2003. Audio steganography using bit
modification, Proceedings of the IEEE International
Conference on Acoustics, Speech, and Signal
Processing, (ICASSP '03), Vol. 2, pp. 421-424.
Gutub, A., and Fattani, M., 2007. A Novel Arabic Text
Steganography Method Using Letter Points and
Extensions, WASET International Conference on
Computer, Information and Systems Science and
Engineering (ICCISSE), Vienna, Austria.
Provos, N., and Honeyman, P., 2003. Hide and Seek: An
Introduction to Steganography, IEEE Security &
Privacy, pp. 32-44.
Shirali-Shahreza, M., and Shirali-Shahreza, S., 2005. A
Robust Page Segmentation Method for Persian/Arabic
Document, WSEAS Transactions on Computers, vol.
4, Issue 11, pp. 1692-1698.
Shirali-Shahreza, et. al., 2006. A New Approach to
Persian/Arabic Text Steganography, 5th IEEE/ACIS
International Conference on Computer and
Information Science (ICIS-COMSAR 06), pp. 310-
315.
SECRYPT 2007 - International Conference on Security and Cryptography
332