|Computers, Materials & Continua |
Text Analysis-Based Watermarking Approach for Tampering Detection of English Text
1Department of Computer Science, King Khalid University, Muhayel Aseer, Kingdom of Saudi Arabia
2Faculty of Computer and IT, Sana’a University, Sana’a, Yemen
*Corresponding Author: Fahd N. Al-Wesabi. Email: firstname.lastname@example.org
Received: 06 December 2020; Accepted: 11 January 2021
Abstract: Due to the rapid increase in the exchange of text information via internet networks, the security and the reliability of digital content have become a major research issue. The main challenges faced by researchers are authentication, integrity verification, and tampering detection of the digital contents. In this paper, text zero-watermarking and text feature-based approach is proposed to improve the tampering detection accuracy of English text contents. The proposed approach embeds and detects the watermark logically without altering the original English text document. Based on hidden Markov model (HMM), the fourth level order of the word mechanism is used to analyze the contents of the given English text to find the interrelationship between the contexts. The extracted features are used as watermark information and integrated with digital zero-watermarking techniques. To detect eventual tampering, the proposed approach has been implemented and validated with attacked English text. Experiments were performed using four standard datasets of varying lengths under multiple random locations of insertion, reorder, and deletion attacks. The experimental and simulation results prove the tampering detection accuracy of our method against all kinds of tampering attacks. Comparison results show that our proposed approach outperforms all the other baseline approaches in terms of tampering detection accuracy.
Keywords: Text analysis; English language processing; hidden Markov model; zero-watermarking; content authentication; tampering detection
For the research community, the reliability and security of exchanged text through the internet is the most promising and challenging field. In communication technologies, authentication of content and automated text verification of honesty in different languages and formats are of great significance. Numerous applications for instance; e-Banking and e-commerce render information transferred via the internet the most difficult. In terms of content, structure, grammar, and semantics, much of the digital media transferred over the internet is in text form and is very susceptible to online transmission. During the transfer process, malicious attackers can temper such digital content .
For information security, many algorithms and techniques are available such as the authentication of content, verification of integrity, detection of tampering, access control, and copyright protection. To overcome these issues, steganography and automated methods of watermarking are commonly used. A technique of digital watermarking (DWM) which can be inserted into digital material through various details such as text, binary pictures, audio, and video [2,3]. A fine-grained text watermarking procedure is proposed based on replacing the white spaces and Latin symbols with homoglyph characters .
Several conventional methods and solutions for text watermarking were proposed  and categorized into different classifications such as linguistic, structure, and image-based and format-based binary images . To insert the watermark information into the document, most of these solutions require certain upgrades or improvements to the original text in digital format material. Zero-watermarking without any alteration to the original digital material to embed the watermark information is a new technique with smart algorithms that can be used . Several techniques have been proposed to improve the capacity of coverless information hidden in digital media based on various techniques such as anime characters , to represent and convey confidential information using unmodified natural stego-carriers , and to map the relationships constructed between the inherent features of the images and the secret information .
Restricted research has centered on the appropriate solutions to verify the credibility of critical digital media online [9–11]. The verification of digital text and the identification of fraud in research earned great attention. Besides, text watermarking study has several researches concentrated on copyright protection in the last decade, but less interest and attention has been paid to integrity verification, identification of tampering, and authentication of content due to the existence of text content based on the natural language .
Proposing the most appropriate approaches and strategies for dissimilar formats and materials, especially in Arabic and English languages, is the most common challenge in this area [13,14]. Therefore, authentication of content, verification of honesty, and detection of sensitive text tampering are major issues in different systems that need critical solutions.
Some instances of such sensitive digital text content are Arabic interactive Holy Qur’an, online, eChecks, tests, and marks. Different Arabic alphabet characteristics such as diacritics lengthened letters and extra symbols of Arabic make it simple to modify the key meaning of the text material by making basic changes such as modifying diacritic arrangements [11,15]. The most popular soft computation and natural language processing (NLP) technique that supported the analysis of the text is HMM.
This paper presents a hybrid text analysis and zero-watermarking approach (HTAZWA) for content authentication and tampering detection of English text. The proposed technique combines the Markov model and zero-watermarking. The fourth-order of the word mechanism of the Markov model has been used for text analysis to extract the interrelationships between contents of the given English text which consequently generates the watermark key. The generated watermark is logically embedded in the original English context without modifying the original text. After text transmission, the embedded watermark is used to detect any tamper that occurred on the received English text and ensures its authenticity.
The primary objective of the HTAZWA strategy is to meet the high accuracy of content authentication and identification of sensitive tampering attacks of English text which is transmitted through the Internet. Therefore, the key contributions of the proposed HTAZWA can be presented as follows.
• For the identification of English text, a novel hybrid text watermarking with NLP technique has been suggested for tampering.
• Most modern information protection techniques combined NLP and tools of soft computing to enhance the robustness, sophistication, security issues of the watermark and to decrease the capability of the watermark and logically incorporate the watermark without making any modification to the original document.
• Any random tamper can be detected with varying amounts and characters.
• In terms of the scale, structure, and content documents of English-text, including character numbers, sets, and special symbols, the method was developed without prior assumptions.
• Watermark capability has been decreased and the existing watermark key is eliminated as a result of processing the text analysis.
The rest of the paper has five more sections. Section 2 provides a literature review of the related work. Section 3 presents HTAZWA. Section 4 describes the implementation, simulation, and experimental details. Section 5 describes the comparison and results discussion, and Section 6 offers conclusions.
2 Literature Review
Natural language is the foundation of linguistic text watermarking approaches. The mechanism of those methods embedding the watermark is based on changes applied to the semantic and syntactic essence of plain text .
To enhance the capability and imperceptibility of Arabic text, a method of text watermarking suggested room dependent on the accessible words . In this method, any word-space is used to mask the Boolean bit 0 or 1 that physically modifies the original text. A text steganography technique was proposed to hide information in the Arabic language . The step of this approach considers Harakat’s existence in Arabic diacritics such as Kasra, and Damma as well as reverses Fatha to cover the message.
Kashida-marks invisible method of watermarking , based on the features of frequent recurrence of document security and authentication characters, was proposed. The method is based on a predetermined watermark key with a Kashida placed for a bit 1 and a bit omitted. The method of steganography of the text was proposed to use Kashida extensions depending on the characters ‘moon’ and ‘sun’ to write digital contents of the Arabic language . Also, Kashida characters are seen alongside with characters from Arabic to decide which hidden secret bits are kept by specific characters. In this form, four instances are included in the kashida characters: Moon characters representing ‘00’; sun characters representing ‘01’; sun characters representing ‘10’; and moon characters representing ‘11’.
A text steganographic approach  based on multilingual Unicode characters has been suggested to cover details in English scripts for the use of the English Unicode alphabet in other languages. Thirteen letters of the English alphabet have been chosen for this approach. It is important to embed dual bits in a timeframe using ASCII code for embedding 00. However, multilingual ones were used by Unicode to embed between 01, and 10, as well as 11. The algorithm of text watermarking is used to secure textual contents from malicious attacks according to Unicode extended characters . The algorithm requires three main steps, the development, incorporation, and extraction of watermarks. The addition of watermarks is focused on the development of predefined coding tables. While scrambling strategies are often used in generation and removal, the watermarking key is safe.
The substitution attack method focused on preserving the position of words in the text document has been proposed . This method depends on manipulating word transitions in the text document. Authentication of Chinese text documents based on the combination of the properties of sentences and text-based watermarking approaches have been suggested [23,24]. The proposed method is presented as follows: A text of the Chinese language is split into a group of sentences, and for each word, the code of a semantic has been obtained. The distribution of semantic codes influences sentence entropy.
A zero-watermarking method has been proposed to preserve the privacy of a person who relies on the Hurst exponent and the nullity of the frames . For watermark embedding, the two steps are determined to evaluate the unvoiced frames. The process of the proposed approach is based on integrating an individual’s identity without notifying any distortion in the signals of medical expression.
A zero-watermarking method was proposed to resolve the security issues of English language text-documents, such as verification of content and copyright protection . A zero-watermarking approach has been suggested based on Markov-model authentication of the content of English text [27,28]. In this approach, to extract the safe watermark information, the probability characteristics of the English text are involved and stored to confirm the validity of the attacked text-document. The approach provides security against popular text attacks with a watermark distortion rate if, for all known attacks, it is greater than one. For the defense of English text copyright, based on the present rate of ASCII non-vowel letters and terms, the conventional watermark approach  has been suggested.
3 The Proposed Approach
This paper proposes a hybrid text analysis and the zero-watermarking approach by integrating zero-watermark technique and the Markov model as NLP technique in which there is no need to embed extra information such as a watermark key, or even to perform any modification on the original text.
The fourth-order of word mechanism of the Markov model has been used as NLP techniques to analyze the contents of the given English text and extract the interrelationships features of these text contents.
The following subsections explain in detail two main processes that should be performed in HTAZWA. The first process is called the watermark generation and embedding process, whereas, the second one is called the watermark extraction and detection process.
3.1 Watermark Generation and Embedding Process
The core sub-processes consist of pre-processing, watermark embedding, and watermark generation algorithms as well as text analysis as illustrated in Fig. 1.
3.1.1 Algorithm of Pre-Processing
The pre-processing of the original English text is one of the key steps in both the watermark generation and extraction processes to convert letter case from capital to small letter and remove extra spaces and newlines, and it will directly influence the tampering detection accuracy. The original English text (OET) is required as input for the Pre-processing process.
3.1.2 Algorithm of Watermark Generation
This algorithm involves the construction of the Markov matrix, the generation of watermarks, and the interpretation of the text.
⬛ Developing the Markov matrix is a core step in developing the HTAZWA approach. A Markov chain matrix must be constructed in this process to set up the Markov model environment and represent all available states and transitions. In this approach, each unique sequence of four words within a provided English-text represents a current state, and every single word corresponds to a conversion in the matrix of the Markov chain. When constructing the Markov chain matrix, zero values will be initialized for all states and transition positions. Those positions will be used later holding a record of the number of occurrences. Then, the ith unique sequence of four words is backed up through the jth single word and provided by English-text.
Pre-processing and building the Markov matrix algorithm is executed as presented in Algorithm 1.
Algorithm 1. Algorithm of building Markov matrix using HTAZWA
OET: is the original English text, OETP: is a pre-processed English text, ew4_mm: represents states and transitions matrix with zeros values for all cells, ps: refers to the current state, ns: refers to next state.
The length of matrix of HTAZWA is dynamic, in which the size of the rows is equal to the total number of unique sequences of four words within the given English text. However, the column size is equal to the total number of unique single words within the given English text.
⬛ Watermark generation-based text analysis process: The proposed algorithm is performed as the second step of this process to perform English text analysis and extract the features of the given text and produce watermark information. Also, in this algorithm, there are several appearances of potential conversions for every present state of unique sequences of four words that will be computed as transition probabilities by Eq. (1) below.
where, n: is total number of states, i: is ith current state of unique sequence of four words, and j: is jth next state transition.
This example of the English version demonstrates how this methodology was used to introduce the phase of transformation from the current state to the next state.
“The quick brown fox jumps over the brown fox who is slow jumps over the brown fox Who is dead.”
When using the fourth level order of word mechanism of the hidden Markov model, every unique sequence of four words is a present state. However, each unique single word is a present transition. Text analysis is processed as the text is read to obtain the interrelationship between the present state and the next states. Fig. 2. illustrates the available transitions and analysis results of the above sample of English text.
As shown in Fig. 2, and as a result of states and transitions representation of a given English text sample using HTAZWA, the author finds 12 unique states and 10 unique transitions. The author assumes “brown fox who is” is a present state, and the available next transition(s) is “slow” and “dead.” The author also observed that “who” transition appears twice in the case of “over the brown fox” state in the given English text sample. The algorithm of text analysis and watermark generation based on the fourth-level order of the word mechanism of the Markov model proceeds as illustrated in Fig. 3.
Text analysis and watermark generation algorithm is presented formally as illustrated in Algorithm 2.
Algorithm 2. Watermark generation algorithm of HTAZWA
where, psu4w: is a previous sequence of unique four words, csu4w: is a current sequence of unique four words, and TAM: is text analysis matrix.
3.1.3 Algorithm of Watermark Embedding
Watermark embedding has taken place logically in this method with no need to change the original text. The feature extraction of the given English-text is utilized as a watermark key and embedded logically by identifying all non-zero values in the Markov chain matrix. All these non-zero values are sequentially concatenated to form the original pattern of watermark , as defined in Eq. (2) and shown in Fig. 4.
The generated ew4_DWMO is stored in WM database beside information of the given English text.
The algorithm of watermark embedding based on the fourth-level order of the word mechanism of the Markov model is presented formally and executed as illustrated below in Algorithm 3.
Algorithm 3. Watermark embedding algorithm of HTAZWA
3.2 Algorithms of Watermark Extraction and Detection
Before the detection of the pre-proceed attacked English text (), attacked watermark patterns (ew4_) should be generated, and the matching rate of patterns and watermark distortion should be calculated by HTAZWA for detecting any tamper with the authentication of the given contents.
Two core algorithms are involved in this process, which are watermark extraction and watermark detection. However, ew4_ will be extracted from the received () and matched with ew4_ by the detection algorithm. should be provided as the input for the proposed watermark extraction algorithm. The same process of watermark generation algorithm should be performed to obtain the watermark pattern for () as illustrated in Fig. 5.
3.2.1 Algorithm of Watermark Extraction
is the main input required to run this algorithm. However, the output of this algorithm is ew4_. The watermark extraction algorithm is presented and executed as illustrated in Algorithm 4.
Algorithm 4. Algorithm of watermark extraction based HTAZWA
where, : pre-processed attacked English text and ew4_: Attacked digital watermark.
3.2.2 Algorithm of Watermark Detection
ew4_ and ew4_ are the main inputs required to run this algorithm, while the output of this algorithm is the notification English text status, which can be authentic or tampered. The detection process of an extracted watermark is achieved in two main phases:
• Primary matching is achieved for ew4_ and ew4_. If these two patterns appear identical, then an alert will appear as “English text is authentic, and no tampering occurred.” Otherwise, the notification will be “English text is tampered and not authentic,” and then it continues to the next step.
• Secondary matching is achieved by matching the transition of each state in the whole generated pattern. This means ew4_ of each state will be compared to the equivalent transition of ew4_ as given by Eqs. (3) and (4).
— ew4_TDA: represents tampering detection accuracy rate value in transition level, (0 < ew4_)
— : refers to original watermark value in transition level.
— : refers to attacked watermark value in transition level.
where, : is value of tampering detection accuracy rate in state level, (0 < ew4_).
After the tampering detection accuracy rate of every state has been produced; the weight of every state stored in the Markov matrix should be found as presented in Eq. (5).
— : is the total tampering detection accuracy rate in state level for each unique sequence of four words.
— is the count of all states in the given English text.
The final ew4_TDA of PETA and OETP are calculated by Eq. (6).
— : is the total tampering detection accuracy rate of a whole given text.
— N: represents the total number of non-zeros values in ew4_mm.
The rate of watermark distortion represents the amount of tampering attacks occurring on the contents of the attacked English context, which is denoted by ew4_WDR and calculated by Eq. (7).
The watermark detection algorithm is presented formally and executed as illustrated in Algorithm 5.
Algorithm 5. Algorithm of watermark detection using HTAZWA
where, ew4SW: refers to the weight value of states matched correctly and : refers to the value of watermark distortion rate ().
The results of the watermark extraction and detection process are illustrated in Fig. 6.
As shown in Fig. 6, TP1 represents 1st transition of non-zero in the given English text, TP2 represents 2nd transition, and so on. Some states have only one transition, which is shown in TP1. However, some states have more than one transition, which are represented in TP1, TP2, etc. such as “brown fox who is.”
4 Implementation and Simulation
A variety of implementation and simulation are conducted to test the accuracy of HTAZWA output and tampering detection. This section outlines the settings for implementation and experimentation, conditions for experiments, typical dataset experimental scenarios, and a discussion of outcomes.
4.1 Simulation and Implementation Environment
The self-developed software was developed to evaluate and assess the efficiency of HTAZWA. The HTAZWA implementing environment is: CPU: Intel Core i7-4650U/2.3 GHz, RAM: 8.0 GB, Windows 10–64 bit, PHP VS Code IDE programming language.
4.2 Simulation and Experimental Parameters
Tab. 1 shows the experimental and simulation parameters and their associated values that were used to perform the experiments of the proposed HTAZWA approach.
4.3 Performance Metrics
The tampering detection accuracy refers to the performance of HTAZWA which is evaluated by the metrics below:
• Precision for tampering identification (ew4_TDA) in all addressed assaults in all scenarios in English data size with many normal attack volumes of very low volume (5 percent), low volume (10 percent), medium volume (20 percent), and high volume (50 percent)
• Accuracy of tampering detection refers to the performance and watermark fragility which its desired value is close to 100.
• Diagnosis and outcome assessment of the influence of dataset size, the impact of attack types, and attack volume with the suggested HTAZWA method.
4.4 HTAZWA Simulation and Experiment Findings
In this portion, the author tests the accuracy of HTAZWA tampering detection. This dataset includes all English characters, numbers, spaces, and symbols. Experiments have been conducted with distinct dataset size and various kinds of frequency attacks as seen above in Tab. 1.
4.5 Evaluation of Tampering Detection Accuracy (All Volumes)
To evaluate the accuracy of tampering detection of HTAZWA, scenarios of many studies are performed as shown in Tab. 2 for all forms of attacks and their volumes.
The results shown in Tab. 2 and Fig. 7 show the insertion attack outperforms deletion and reorder attacks in all cases of attack volumes 5%, 10%, 20%, and 50%. Results show also deletion attack outperforms reorder attack in all cases of attack volumes. In other meaning, the low effect is detected under insertion and deletion attacks and the high effect is detected under reorder attack in all experimental scenarios under all attack volumes. This means that HTAZWA gives the best detection accuracy under insertion attack in all scenarios of attack volumes.
5 Comparison and Result Discussion
The tampering detection accuracy results were critically analysed. The study impact is investigated and comparisons between HTAZWA and baseline approaches ZWAFWMMM and HNLPZWA showed their effect under the major factors (i.e., dataset size, attack types, and volumes).
5.1 Baseline Approaches
The efficiency and accuracy of HTAZWA were contrasted with HNLPZWA (an intelligent hybrid of natural language processing and zero-watermarking approach)  and ZWAFWMM (zero watermark approach based on the fourth Markov model order and Arabic word mechanism) . Comparisons are made under all success indicators to assess which method has the best accuracy in the identification of tampering. The following sub-sections describe the basic methods and their operating parameters.
5.2 Comparison Results
This subdivision provides a comparison of HTAZWA, ZWAFWMMM and HNLPZWA approaches and analyses their results in conjunction with key affected variables i.e., scale of datasets, kinds of attacks, and volumes.
5.2.1 Comparison Results of Dataset Size Impact
The comparative results shown in Fig. 8 reflect the tampering detection accuracy of HTAZWA approach. The results show that in the proposed HTAZWA approach, the highest effects of dataset size that lead to the best tampering detection accuracy with insertion and deletion attacks systematically are ordered as ESST, ELST, EMST, and EHMST, respectively. However, it is differing in the case of reordering attacks. This means that the tampering detection accuracy increased with decreasing document size and decreased with increasing document size. On the other hand, results show that HTAZWA approach outperforms both ZWAFWMMM and HNLPZWA approaches in terms of tampering detection accuracy under all scenarios of mid and large dataset size (EMST, EHMST, and ELST) except in the case of small dataset size (ESST).
5.2.2 Comparison Results of Attack Type Impact
Fig. 9 shows how the tampering detection accuracy of HTAZWA, ZWAFWMMM, and HNLPZWA approaches are influenced by the type of tampering attacks. In all cases of insertion, deletion, and reorder attacks, HTAZWA outperforms ZWAFWMMM and HNLPZWA approaches with a high rate of tampering detection accuracy. This means that the proposed HTAZWA approach is strongly recommended and applicable for content authentication and tampering detection of English text under all attack types.
5.2.3 Comparison Results of Attack Volume Impact
Fig. 10 shows how the tampering detection accuracy is influenced by low, mid, and high attack volumes. In all cases of HTAZWA, ZWAFWMMM, and HNLPZWA approaches, it has been seen that if the attack volume increases, the tampering detection accuracy also increases. However, if the attack volume decreases, the tampering detection accuracy also decreases. In all cases of low, mid, and high attack volumes, it has been seen HTAZWA outperforms ZWAFWMMM and HNLPZWA approaches in terms of tampering detection accuracy in all scenarios of low, mid, and high volumes of all attacks. This means that HTAZWA approach is strongly recommended and applicable for content authentication and tampering detection of English text documents under all volumes of all attacks.
HTAZWA approach is implemented in PHP programming language using VS code IDE. The experiments are performed on various standard datasets under different volumes of insertion, deletion, and reorder attacks. HTAZWA has been compared with ZWAFWMMM and HNLPZWA approaches. The comparison results show that HTAZWA outperforms ZWAFWMMM and HNLPZWA approaches in terms of the accuracy of tampering detection. The results also show that HTAZWA applies to all English alphabetic letters, special characters, numbers, and spaces. For future work, the improvement of detection accuracy should be considered for all kinds of attacks.
Funding Statement: The author extends his appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under grant number (R. G. P. 2/55/40 /2019), Received by Fahd N. Al-Wesabi. www.kku.edu.sa.
Conflicts of Interest: The author declares that he has no conflicts of interest to report regarding the present study.
|This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.|