<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Securing Digital Communications with AI-Enhanced Synonym Substitution in Text</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oleksandr Kuznetsov</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emanuele Frontoni</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kyrylo Chernov</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco Amesano</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Cristian Randieri</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Political Sciences, Communication and International Relations, University of Macerata</institution>
          ,
          <addr-line>Macerata</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Theoretical and Applied Sciences, eCampus University</institution>
          ,
          <addr-line>Novedrate (CO)</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>School of Computer Sciences, V. N. Karazin Kharkiv National University</institution>
          ,
          <addr-line>Kharkiv</addr-line>
          ,
          <country country="UA">Ukraine</country>
        </aff>
      </contrib-group>
      <fpage>116</fpage>
      <lpage>124</lpage>
      <abstract>
        <p>Linguistic steganography, the art of concealing secret messages within natural language text, has gained significant attention in recent years. However, existing approaches often suffer from limited embedding capacity, detectability, and lack of linguistic naturalness. In this paper, we propose a novel linguistic steganography framework that leverages the power of GPT-based language models to generate natural and undetectable stego texts. Our approach combines synonym substitution, semantic encoding, and adaptive embedding techniques to conceal secret messages within the generated text while preserving its linguistic integrity. Through extensive experiments, we demonstrate the effectiveness of our framework in achieving high embedding capacity, security, and resistance to steganalysis attacks. The comparative analysis against state-of-the-art techniques highlights the superiority of our approach in terms of embedding efficiency, linguistic quality, and robustness. Our framework opens up new avenues for secure and covert communication, contributing to the ongoing efforts in safeguarding sensitive information and enabling private communication in an increasingly connected world.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;linguistic steganography</kwd>
        <kwd>AI in cybersecurity</kwd>
        <kwd>digital communication</kwd>
        <kwd>text encoding</kwd>
        <kwd>GPT models</kwd>
        <kwd>secure communication</kwd>
        <kwd>information hiding1</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Steganography, the practice of hiding information
within non-secret, public media, is gaining
recognition as a potent tool for secure
communication [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Unlike cryptography, which
protects the content of a message by rendering it
unreadable, steganography conceals the existence of
the message itself, thus providing an additional layer
of security [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Recent advancements in
computational linguistics and artificial intelligence
have opened new avenues for textual steganography
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. These advancements allow for more
sophisticated methods of message concealment that
not only improve security but also ensure that the
alterations to the carrier medium remain
undetectable [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Among these methods,
synonym-based steganography presents a
particularly intriguing approach [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. By
substituting words in the text with their synonyms
according to a secret key, it is possible to encode
information seamlessly within the text, thereby
maintaining its readability and syntactic integrity.
This paper explores a novel synonym-based
steganography system that utilizes state-of-the-art
generative AI models, specifically GPT [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. These
models facilitate the generation of cover texts and
the dynamic selection of synonyms, tailoring them to
fit the contextual needs of the text. Our approach
enhances the traditional methods of steganography
by integrating the latest AI technologies, which help
in maintaining the natural flow of the text and
significantly complicating the task of steganalysis.
throughput, efficiency in message encoding, and
robustness against advanced steganalysis methods.
By comparing these metrics against traditional
linguistic steganography techniques, we aim to
demonstrate the superior capability of our system in
terms of both security and practicality. The
significance of this work lies in its potential to
revolutionize the field of secure digital
communication.
      </p>
      <p>As the landscape of global communication grows
increasingly complex and the demand for privacy and
security becomes more pressing, the development of
effective steganographic techniques becomes critical.
Furthermore, this research delves into the
performance of the proposed system, examining its
Through this paper, we present a comprehensive
analysis of how generative AI can be harnessed to
enhance the art of steganography, offering insights
that could shape future innovations in the field.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Literature Review</title>
      <p>
        Linguistic steganography has evolved rapidly with
the integration of deep learning approaches. Zhou et
al. (2022) [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] highlighted how traditional methods
suffer from exposure bias and embedding deviation,
proposing adaptive probability distribution to
enhance imperceptibility. Yang et al. (2024) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
demonstrated that semantic-preserving approaches
using pivot translation can maintain meaning while
achieving high embedding capacity.
      </p>
      <p>
        Recent innovations have focused on
generationbased methods. Ding et al. (2024) [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] introduced a
context-aware model using neural machine
translation with semantic fusion to improve control
over generated text. Wang et al. (2023) [
        <xref ref-type="bibr" rid="ref13">12</xref>
        ] developed
PNG-Stega, a non-autoregressive approach that
outperforms traditional left-to-right generation
methods in both imperceptibility and efficiency.
Synonym substitution remains a powerful technique.
Yi et al. (2022) [
        <xref ref-type="bibr" rid="ref14">13</xref>
        ] noted that while
modificationbased methods typically offer lower capacity than
generation-based approaches, they better preserve
semantic quality. Chang (2023) [
        <xref ref-type="bibr" rid="ref15">14</xref>
        ] addressed
distortion concerns by developing reversible
linguistic steganography using Bayesian masked
language modeling, allowing for the removal of
steganographic alterations after message extraction.
As steganographic methods improve, detection
techniques evolve correspondingly. Li et al. (2023)
[
        <xref ref-type="bibr" rid="ref16">15</xref>
        ] demonstrated effective detection of generative
steganography through explicit and latent word
relation mining. To counter such detection, Xiang et
al. (2023) [
        <xref ref-type="bibr" rid="ref18">16</xref>
        ] proposed causal perception guided
embedding that assesses word security before
modification, reducing semantic distortion and
improving anti-steganalysis capability.
      </p>
      <p>Despite significant progress, current linguistic
steganography methods face critical limitations.
Most approaches struggle to optimize the three
essential properties simultaneously: High embedding
capacity; Linguistic naturalness; Resistance to
advanced steganalysis. Generation-based methods
achieve high capacity but often produce semantic
inconsistencies that detection algorithms can exploit.
Modification-based approaches maintain better
linguistic quality but with limited capacity.
Additionally, existing methods typically rely on static
embedding patterns that sophisticated steganalysis
can identify. The potential of large language models
like GPT for dynamic synonym selection and
contextual adaptation remains largely unexplored.
Current approaches lack the flexibility to adapt to
different linguistic contexts while maintaining high
capacity and security.</p>
      <p>Our research addresses this gap by introducing an
AI-enhanced synonym substitution framework that
dynamically adapts to textual context while
providing robust security against state-of-the-art
steganalysis techniques.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Description of the Proposed</title>
    </sec>
    <sec id="sec-4">
      <title>Synonym-Based</title>
    </sec>
    <sec id="sec-5">
      <title>Steganographic System</title>
      <p>
        In our research, we employ a sophisticated
synonymbased method for the concealment of information
within textual data [
        <xref ref-type="bibr" rid="ref20">17</xref>
        ], [
        <xref ref-type="bibr" rid="ref21">18</xref>
        ]. This approach is rooted
in the rich synonymic versatility of the English
language and utilizes state-of-the-art language
models for its implementation.
3.1.
      </p>
      <sec id="sec-5-1">
        <title>Overview of the Linguistic</title>
      </sec>
      <sec id="sec-5-2">
        <title>Steganography Algorithm</title>
        <p>Our Decoding Procedure for Extracting Hidden
message son synonym substitution, and can be
outlined in the following steps:
•
•
•
•
•
•</p>
        <p>Message Binarization: Initially, the input
message is converted into a binary sequence.
For instance, the word "HELLO" would be
translated into binary using ASCII encoding,
where each character is represented by a
specific binary string.</p>
        <p>Container Generation: Leveraging the
capabilities of the GPT model, we generate a
plain text container. This text is crafted based
on a prompt that dictates the theme and the
desired word count, calculated as 1.5 times the
length of the binary message, ensuring
adequate space for synonym substitution.
Synonym Generation: For each word in the
container text, multiple synonyms are
generated. This step utilizes the GPT model to
ensure a selection of contextually appropriate
synonyms.</p>
        <p>Synonym Table Creation: A synonym table is
constructed,
assigning a unique binary code to each
synonym. For example, if the word "happy" has
four synonyms, each would be assigned a
binary code such as 00, 01, 10, or 11, facilitating
the embedding of the binary-encoded message.
Text and Synonym Table Sanitization: Given
the nature of AI generative models, their
outputs can occasionally vary. To minimize
model hallucinations and enhance reliability,
we incorporate several pre- and post-processing
steps.</p>
        <p>Word Substitution: Words in the original text
are replaced with their corresponding
synonyms based on the binary message. For
example, if the first two bits of the message are
"01", the first word of the original text would be
substituted with the synonym associated with
this code.
•</p>
        <p>Message Transmission: The modified text, now
containing the hidden message, is sent to the
recipient.
•</p>
        <p>Message Decoding: The recipient, equipped
with the synonym table and knowledge of the
encoding method, decodes the hidden
message by translating the synonyms back
into their respective binary codes and
subsequently reconstructing the original
message.
a. Systematic Structure of the</p>
        <p>Steganographic Encoding</p>
        <p>The structural schema of our steganographic
system is illustrated in Figure 1, which includes:
1.
2.
3.</p>
        <sec id="sec-5-2-1">
          <title>The user ("Bob"), who inputs the plaintext intended for steganographic encoding.</title>
        </sec>
        <sec id="sec-5-2-2">
          <title>The plaintext is used to generate a text container via a request to the OpenAI API, specifically using the GPT-3.5-turbo model for cost efficiency.</title>
        </sec>
        <sec id="sec-5-2-3">
          <title>The generated container text and the</title>
          <p>synonym table, which are crucial for the
concealment of information, are
processed through a request to the
OpenAI API utilizing the more advanced</p>
          <p>GPT-4 model.</p>
          <p>The overall scheme for the recovery of the hidden
message is depicted in Figure 2. The process involves
the recipient ("Alice") and the steganographic
decoding procedure, where the filled container (text
with the embedded message) and the synonym table
are used to extract and reconstruct the hidden
message.</p>
          <p>Our decision to employ GPT models for both text
generation and synonym table creation is predicated
on several factors:</p>
          <p>The GPT model's ability to select contextually
appropriate synonyms ensures seamless
integration into the text.</p>
          <p>The dynamic generation of synonym tables
allows for flexible adaptation to the textual
context of the container.</p>
          <p>The use of phrases and idioms by the GPT
model enriches the text, allowing for a more
natural and less detectable embedding of
information.</p>
          <p>This innovative use of linguistic steganography not
only enhances the security of transmitted
information but also maintains the readability and
naturalness of the cover text, making the detection of
the embedded message significantly more
challenging.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>4. Performance Evaluation of the</title>
    </sec>
    <sec id="sec-7">
      <title>Proposed Steganography</title>
    </sec>
    <sec id="sec-8">
      <title>System</title>
      <p>This section elucidates the outcomes derived from
an exhaustive testing regime aimed at gauging the
efficacy of our novel steganography system. Through
meticulous experimentation across a variety of
message lengths—specifically, 64, 128, and 256 bits—
and conducting 100 experiments for each category,
we meticulously evaluated the system across
multiple performance indicators. These indicators
include throughput, embedding and extraction
speeds, and the readability score, providing a holistic
view of the system's operational efficiency.</p>
      <p>The performance of our system is encapsulated in
the Table 1 and Figure 3, which aggregates the
findings across all tested parameters, offering a
comprehensive insight into the system's proficiency.
1.</p>
      <p>PERFORMANCE METRICS
Performance 64 Bits
Metric
Throughput 0.0127
Bit/Word 1.21
Encoded
Container 3.98 21.21
Generation
Speed (Seconds)
Readability 29.176 vs. 32.74
Score (Plain vs. 23.40 26.99
Encoded)
Throughput 0.0127</p>
      <p>Bit/Word Encoded: Reflects the system's
capability to encode a significant amount of
information per word, thereby ensuring a high
degree of data density without compromising
the container text's integrity or readability.
Container Generation and Decoding Speed:
Indicates the system's efficiency in generating
container texts and extracting embedded
messages. The observed speeds validate the
system's potential for real-time applications,
where rapid encoding and decoding are
paramount.</p>
      <p>Readability Score: The Flesch Reading Ease
test results affirm that the encoded texts
maintain a commendable level of readability,
thereby preserving the naturalness and
coherence of the cover text while securely
embedding the hidden messages.</p>
      <p>In conclusion, the performance evaluation of our
steganography system reveals a robust, efficient, and
economically viable solution for embedding hidden
messages within texts. The system exhibits a
commendable balance between embedding density
and readability, alongside rapid encoding and
decoding capabilities, making it a formidable tool in
the realm of secure communications. Through this
innovative approach, we significantly enhance the
state-of-the-art in steganography, paving the way for
new applications in secure data transmission and
digital privacy.</p>
    </sec>
    <sec id="sec-9">
      <title>5. Advanced Steganalysis</title>
      <p>In the rapidly evolving field of digital
communications, the art of concealing information
within seemingly innocuous texts, known as
steganography, has seen significant advancements.
Concurrently, the science of detecting these hidden
messages, or steganalysis, has become increasingly
crucial for ensuring the security and integrity of
information. This section delves into the
methodologies employed in our investigative journey
through the landscape of text steganography and
steganalysis. By rigorously comparing the
performance of existing steganographic methods
against our proposed model, we aim to shed light on
the intricacies of modern steganographic techniques
and the effectiveness of steganalysis in unearthing
concealed information. Our approach is grounded in
a comparative analysis, leveraging a newly curated
dataset and employing robust evaluation metrics to
discern the most effective steganalysis
methodologies currently available.
5.1.</p>
      <sec id="sec-9-1">
        <title>Experimental Methodology</title>
        <p>Our study embarked on a comprehensive
exploration of state-of-the-art text steganography
and steganalysis methods. To this end, we
meticulously compiled a dataset of both cover texts,
which serve as the innocuous vessels for hidden
information, and stego-texts, which contain the
embedded secret messages. This dataset comprises a
total of 8,662 samples, evenly split between clean
texts and those employing steganographic
techniques, resulting in 4,331 samples for each class.
Such a balanced dataset is pivotal for training
steganalysis models with high precision, ensuring an
e1q2u1itable representation of both steganographic and
non-steganographic texts.</p>
        <p>For the development and refinement of our
steganalysis models, we allocated the dataset into
distinct subsets: 80% for training, 10% for validation,
and the remaining 10% for testing. This distribution
aligns with standard practices in machine learning
and provides a robust framework for evaluating the
performance of our models across various stages of
the learning process.</p>
        <p>The hyperparameters for each model were
meticulously chosen in accordance with the
guidelines and recommendations delineated in their
respective foundational papers. This approach
ensures the fidelity of our experimental setup to
those of the original studies, allowing for a fair and
accurate comparison between our findings and those
documented in the literature.</p>
        <p>To benchmark the efficacy of our model against
existing methods, we focused on algorithms
achieving a throughput close to 1 bit/word,
considering this metric indicative of optimal
steganographic efficiency. In instances where
specific bit/word values were not provided within the
source literature, we proceeded with a comparison
devoid of this parameter. This selection criterion
facilitated a focused and relevant analysis of
contemporary steganographic and steganalysis
techniques.</p>
        <p>
          Our analysis includes a comparison with results from
established steganalysis models, particularly those
trained on the T-Steg dataset by Yang et al. [
          <xref ref-type="bibr" rid="ref23">19</xref>
          ], and
the natural steganographic texts dataset by Fang et
al. [
          <xref ref-type="bibr" rid="ref25">20</xref>
          ], which achieves a steganographic density of
1.000 bit/word. This juxtaposition not only
contextualizes our model's performance within the
broader landscape of steganalysis research but also
underscores the evolution and current state of the
field.
        </p>
        <p>Results Overview: Steganalysis Methods
Compared</p>
        <p>To evaluate the resilience of our proposed
steganographic method against various AI-based
steganalysis techniques, we conducted a
comprehensive comparative analysis. We
benchmarked our results against the most prominent
methods in each steganalysis category, aiming to
demonstrate the superior concealment capabilities of
our approach. The experimental findings indicate
that our method exhibits higher resistance to
detection compared to the state-of-the-art
techniques, thereby ensuring more reliable and
secure data hiding.</p>
        <p>
          Table 2 presents a comparison of our method with
the TS-CNN steganalysis approach [
          <xref ref-type="bibr" rid="ref26">21</xref>
          ]. We
evaluated the performance using accuracy (Acc) and
recall (R) metrics, considering different bit/word
capacities. Our method achieves significantly lower
detection rates, with an accuracy of 0.6351 and a
recall of 0.4503 for 1 bit/word and an accuracy of
0.6552 and a recall of 0.5415 with embedding size
increase we see a degradation in resistance to this
type of steganalysis, although it is still lower than
other compared to the CNN-based steganalysis,
which yields accuracies ranging from 0.665 to 0.911
and recalls from 0.718 to 0.952. These results
highlight the enhanced security provided by our
steganographic technique.
        </p>
        <p>
          In Table 3, we compare our method with TS-CSW
[
          <xref ref-type="bibr" rid="ref27">22</xref>
          ], BERT classifier [
          <xref ref-type="bibr" rid="ref28">23</xref>
          ], and R-BiLSTM-C [
          <xref ref-type="bibr" rid="ref29">24</xref>
          ]
steganalysis approaches:
•
•
•
        </p>
        <p>
          For the TS-CSW and BERT classifier, we
evaluate the performance on the "From
Symbolic Space to Semantic Space" dataset [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ].
Our method achieves a perfect concealment
with an accuracy of 0.5000 for 1 bit/word and
0.5000 for 4 bit/word, outperforming both
TSCSW (0.5163) and BERT classifier (0.5294).
        </p>
        <p>
          Similarly, when compared to R-BiLSTM-C on
the T-Lex [
          <xref ref-type="bibr" rid="ref30">25</xref>
          ] and Tina-Fang [
          <xref ref-type="bibr" rid="ref25">20</xref>
          ] datasets, our
method demonstrates superior resilience with
an accuracy of 0.5000, surpassing the 0.970 and
0.990 accuracies reported in the respective
papers.
        </p>
        <sec id="sec-9-1-1">
          <title>2. COMPARISON OF OUR STEGANOGRAPHIC</title>
          <p>METHOD WITH TS-CNN STEGANALYSIS</p>
          <p>
            APPROACH
Twitter [
            <xref ref-type="bibr" rid="ref23">19</xref>
            ] 0.786 0.992
0.914 0.997
0.744 0.992
Ours (GPT- 0.764 0.943
4-omni) 0.956 0.996
          </p>
          <p>0.554 0.893</p>
          <p>Our approach achieves a higher accuracy of
0.7644 on the Twitter dataset, indicating better
concealment compared to the 0.786 accuracy of
BERT-LSTM-Att. However, BERT-LSTM-Att exhibits
a slightly higher precision (0.914) compared to our
method (0.9562) on the Twitter dataset. Nonetheless,
our method demonstrates superior recall (0.5543)
compared to BERT-LSTM-Att (0.744) on the same
dataset. The 4 bit/word situation is different,
BERTLSTM-Att was able to find the optimal minima and
learn enough to detect 4 bit/word encoded text, still
our metrics are slightly better than compared.</p>
          <p>
            The comparison with Bi-LSTM-Dense
steganalysis [
            <xref ref-type="bibr" rid="ref34">29</xref>
            ] is presented in Table 5. Our method
achieves perfect concealment on all datasets, with an
accuracy of 0.5000 for 1 bit/word and 4 bit/word
encoding regimes, precision of 0.0, and recall of 0.0. It
is worth noting that our model did not converge
during training, indicating the challenges in
detecting our steganographic approach. In contrast,
Bi-LSTM-Dense achieves accuracies ranging from
0.783 to 0.917, precisions from 0.817 to 0.989, and
recalls from 0.714 to 0.87 on the News, and Twitter
datasets [
            <xref ref-type="bibr" rid="ref23">19</xref>
            ]. Lastly, Table 6 compares our method
with TS-BiRNN steganalysis [
            <xref ref-type="bibr" rid="ref19 ref35">30</xref>
            ] on various datasets,
including Tina-Fang's method + IMDB [
            <xref ref-type="bibr" rid="ref19 ref35">30</xref>
            ], FW [
            <xref ref-type="bibr" rid="ref36">31</xref>
            ],
and SW [
            <xref ref-type="bibr" rid="ref36">31</xref>
            ]. Our approach consistently
demonstrates lower detection rates, with an accuracy
of 0.6212 and a recall of 0.4942 for 1 bit/word
encoding. For 4 bit/word an accuracy of 0.5538 and
recall of 0.2134 demonstrate dominance of our
method compared to TS-BiRNN, which achieves
accuracies ranging from 0.739 to 0.9110 and recalls
from 0.727 to 0.8550 and totally loses when using 4
bit/word encoding.
          </p>
          <p>5. COMPARISON OF OUR STEGANOGRAPHIC
METHOD WITH BI-LSTM-DENSE</p>
          <p>STEGANALYSIS APPROACH</p>
        </sec>
        <sec id="sec-9-1-2">
          <title>Steganal Method</title>
          <p>
            ysis
Bi-LSTM- News [
            <xref ref-type="bibr" rid="ref23">19</xref>
            ]
Dense
[
            <xref ref-type="bibr" rid="ref34">29</xref>
            ]
0.917
0.922
0.910
Twitter [
            <xref ref-type="bibr" rid="ref23">19</xref>
            ] 0.783
0.817
0.714
Ours (GPT- 0.5000
4-omni) 0.0
(Model did
not
converge)
0.0
          </p>
        </sec>
        <sec id="sec-9-1-3">
          <title>COMPARISON OF OUR STEGANOGRAPHIC</title>
          <p>METHOD WITH BI-LSTM-DENSE
STEGANALYSIS APPROACH
1 bit/word</p>
          <p>4 bit/word</p>
        </sec>
        <sec id="sec-9-1-4">
          <title>Ours</title>
          <p>(GPT-4omni)</p>
          <p>
            The data underscores that our GPT-4 based
model, despite its novel approach and higher
bit/word ratio, exhibits lower accuracy in detecting
steganographic content compared to traditional
methods. This outcome is not indicative of a
deficiency in our model but rather highlights its
robustness and the complexity of its steganographic
mechanism. Where conventional techniques, such as
CNN-based RNN-Stega (HC) [
            <xref ref-type="bibr" rid="ref31">26</xref>
            ], VAE-Stega
(LSTM-LSTM) (HC), and VAE-Stega (BERT_LSTM)
(HC) [
            <xref ref-type="bibr" rid="ref32">27</xref>
            ], demonstrate higher accuracy in
identifying steganographic texts, our model
consistently evades detection with lower accuracy
scores from the steganalysis perspective.
          </p>
          <p>The key takeaway from this analysis is the superior
security and reliability of our steganography method.
The advanced AI-based steganalysis techniques that
have been applied to our model do not yield
significant results, underscoring the effectiveness of
our method in concealing information. This is
particularly evident in comparisons with other
methods, where the accuracy of detecting embedded
texts using our approach is consistently lower. This
lower detection rate speaks volumes about the
difficulty in uncovering steganographically hidden
information, thus asserting the enhanced reliability
and security of our method compared to those listed
in the table. This observation holds across all
considered steganalysis techniques.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>6. Discussion</title>
      <p>One of the notable strengths of our system is its
high performance, which is manifested in several
critical aspects. Firstly, the system exhibits
exceptional throughput, ensuring that a substantial
amount of information can be embedded within a
relatively small amount of text. This efficiency is
particularly important in environments where
bandwidth is limited or where stealthiness is
paramount. Additionally, the sophisticated use of
synonym substitution allows for a higher bit/word
ratio without compromising the natural flow and
readability of the text. This balance between density
of information and unobtrusiveness of the
modification is a significant improvement over
traditional methods, which often struggle to
maintain text coherence and subtlety.</p>
      <p>A critical advantage of our system is its
robustness against advanced detection methods. By
leveraging the latest developments in AI, specifically
through the use of GPT models for dynamic synonym
generation and text processing, our system offers a
level of randomness and contextual appropriateness
that significantly complicates the task of
steganalysis. Most conventional steganalysis
methods rely on detecting anomalies in text structure
or syntax that are indicative of encoding. However,
our approach minimizes such anomalies by ensuring
that synonyms are contextually suitable and
seamlessly integrated, thereby reducing the
likelihood of detection. This makes our system
particularly resistant to AI-driven steganalysis
technologies that analyze textual coherence and
stylistic consistency.</p>
      <p>When compared to other methods in linguistic
steganography, our system not only matches but, in
many cases, surpasses them in terms of both
performance and security. The use of AI-enhanced
synonym selection and the strategic generation of
text containers mean that the embedded messages
are deeply integrated into the text's fabric. This
integration provides a dual benefit: it maintains the
cover text's usability for legitimate communication
while protecting the embedded data from
interception and interpretation. Furthermore, the
ability to dynamically adjust synonym choices based
on the text context allows for a flexible adaptation to
various languages and dialects, broadening the
potential applications of our system.</p>
    </sec>
    <sec id="sec-11">
      <title>7. Conclusion</title>
      <p>This paper presented a novel steganography system
utilizing synonym-based encoding to enhance the
security and undetectability of hidden messages in
text. The system's use of advanced AI models,
specifically GPT, facilitates dynamic synonym
substitution that maintains the natural readability of
the host text while embedding substantial amounts
of concealed information. Our evaluations
demonstrated the system's high throughput and
robust resistance to modern steganalysis techniques,
including those leveraging the latest AI technologies.
This combination of high performance, efficiency,
and security positions our synonym-based
steganography system as a significant advancement
in the field of secure digital communication.
Declaration on Generative AI
During the preparation of this work, the authors used
AI tools in order for spelling check and rewording.
After using this tool/service, the authors reviewed
and edited the content as needed and takes full
responsibility for the publication’s content.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Fridrich</surname>
          </string-name>
          , Steganography in Digital Media: Principles, Algorithms, and Applications,
          <string-name>
            <given-names>Illustrated</given-names>
            <surname>Edition</surname>
          </string-name>
          . Cambridge ; New York: Cambridge University Press,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Yahya</surname>
          </string-name>
          , “
          <article-title>Steganography Techniques,” in Steganography Techniques for Digital Images, A</article-title>
          . Yahya, Ed., Cham: Springer International Publishing,
          <year>2019</year>
          , pp.
          <fpage>9</fpage>
          -
          <lpage>42</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -78597-
          <issue>4</issue>
          _
          <fpage>2</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>L.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Ou</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Zeng</surname>
          </string-name>
          , “Linguistic Steganography: Hiding Information in Syntax Space,
          <source>” IEEE Signal Processing Letters</source>
          , vol.
          <volume>31</volume>
          , pp.
          <fpage>261</fpage>
          -
          <lpage>265</lpage>
          ,
          <year>2024</year>
          , doi: 10.1109/LSP.
          <year>2023</year>
          .
          <volume>3347153</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>R.</given-names>
            <surname>Yan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and T. Song, “
          <article-title>A Secure and Disambiguating Approach for Generative Linguistic Steganography,”</article-title>
          <source>IEEE Signal Processing Letters</source>
          , vol.
          <volume>30</volume>
          , pp.
          <fpage>1047</fpage>
          -
          <lpage>1051</lpage>
          ,
          <year>2023</year>
          , doi: 10.1109/LSP.
          <year>2023</year>
          .
          <volume>3302749</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Yang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , “Linguistic Steganography: From Symbolic Space to Semantic Space,
          <source>” IEEE Signal Processing Letters</source>
          , vol.
          <volume>28</volume>
          , pp.
          <fpage>11</fpage>
          -
          <lpage>15</lpage>
          ,
          <year>2021</year>
          , doi: 10.1109/LSP.
          <year>2020</year>
          .
          <volume>3042413</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Sun</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , “
          <article-title>Linguistic Generative Steganography With Enhanced Cognitive-Imperceptibility,”</article-title>
          <source>IEEE Signal Processing Letters</source>
          , vol.
          <volume>28</volume>
          , pp.
          <fpage>409</fpage>
          -
          <lpage>413</lpage>
          ,
          <year>2021</year>
          , doi: 10.1109/LSP.
          <year>2021</year>
          .
          <volume>3058889</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M. L. Pérez</given-names>
            <surname>Gort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Olliaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cortesi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Feregrino Uribe</surname>
          </string-name>
          , “
          <article-title>Semantic-driven watermarking of relational textual databases</article-title>
          ,
          <source>” Expert Systems with Applications</source>
          , vol.
          <volume>167</volume>
          , p.
          <fpage>114013</fpage>
          ,
          <string-name>
            <surname>Apr</surname>
          </string-name>
          .
          <year>2021</year>
          , doi: 10.1016/j.eswa.
          <year>2020</year>
          .
          <volume>114013</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>“</surname>
            <given-names>GPT</given-names>
          </string-name>
          <source>-4.” Accessed: Apr. 14</source>
          ,
          <year>2024</year>
          . [Online]. Available: https://openai.com/research/gpt-4
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Peng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xue</surname>
          </string-name>
          , and
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhong</surname>
          </string-name>
          , “
          <source>Linguistic Steganography Based on Adaptive Probability Distribution,” IEEE Transactions on Dependable and Secure Computing</source>
          , vol.
          <volume>19</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>2982</fpage>
          -
          <lpage>2997</lpage>
          , Sep.
          <year>2022</year>
          , doi: 10.1109/TDSC.
          <year>2021</year>
          .
          <volume>3079957</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>T.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Yi</surname>
          </string-name>
          , G. Feng, and
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “
          <article-title>Semantic-Preserving Linguistic Steganography by Pivot Translation</article-title>
          and
          <string-name>
            <surname>Semantic-Aware Bins</surname>
            <given-names>Coding</given-names>
          </string-name>
          ,
          <source>” IEEE Transactions on Dependable and Secure Computing</source>
          , vol.
          <volume>21</volume>
          , no.
          <issue>1</issue>
          , pp.
          <fpage>139</fpage>
          -
          <lpage>152</lpage>
          , Jan.
          <year>2024</year>
          , doi: 10.1109/TDSC.
          <year>2023</year>
          .
          <volume>3247493</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Ding</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Fu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          , and
          <string-name>
            <surname>Y.</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Huang</surname>
          </string-name>
          , “Context-Aware
          <source>Linguistic Steganography Model Based on Neural Machine Translation,” IEEE/ACM Transactions on Audio, Speech, and Language Processing</source>
          , vol.
          <volume>32</volume>
          , pp.
          <fpage>868</fpage>
          -
          <lpage>878</lpage>
          ,
          <year>2024</year>
          , doi: 10.1109/TASLP.
          <year>2023</year>
          .
          <volume>3340601</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          , “
          <string-name>
            <surname>PNG-Stega: Progressive Non-Autoregressive Generative</surname>
          </string-name>
          Linguistic Steganography,
          <source>” IEEE Signal Processing Letters</source>
          , vol.
          <volume>30</volume>
          , pp.
          <fpage>528</fpage>
          -
          <lpage>532</lpage>
          ,
          <year>2023</year>
          , doi: 10.1109/LSP.
          <year>2023</year>
          .
          <volume>3272798</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>B.</given-names>
            <surname>Yi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wu</surname>
          </string-name>
          , G. Feng, and
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “
          <source>ALiSa: Acrostic Linguistic Steganography Based on BERT and Gibbs Sampling,” IEEE Signal Processing Letters</source>
          , vol.
          <volume>29</volume>
          , pp.
          <fpage>687</fpage>
          -
          <lpage>691</lpage>
          ,
          <year>2022</year>
          , doi: 10.1109/LSP.
          <year>2022</year>
          .
          <volume>3152126</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [14]
          <string-name>
            <surname>C.-C. Chang</surname>
          </string-name>
          , “
          <article-title>Reversible Linguistic Steganography With Bayesian Masked Language Modeling,”</article-title>
          <source>IEEE Transactions on Computational Social Systems</source>
          , vol.
          <volume>10</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>714</fpage>
          -
          <lpage>723</lpage>
          , Apr.
          <year>2023</year>
          , doi: 10.1109/TCSS.
          <year>2022</year>
          .
          <volume>3162233</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          , and P. Liu, “
          <article-title>Detection of Generative Linguistic Steganography Based on Explicit and Latent Text Word Relation Mining Using Deep Learning,”</article-title>
          <source>IEEE Transactions on Dependable and Secure Computing</source>
          , vol.
          <volume>20</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>1476</fpage>
          -
          <lpage>1487</lpage>
          , Mar.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          <year>2023</year>
          , doi: 10.1109/TDSC.
          <year>2022</year>
          .
          <volume>3156972</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>L.</given-names>
            <surname>Xiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gui</surname>
          </string-name>
          , “
          <article-title>CPG-LS: Causal Perception Guided Linguistic Steganography,”</article-title>
          <source>IEEE Signal Processing Letters</source>
          , vol.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          30, pp.
          <fpage>1762</fpage>
          -
          <lpage>1766</lpage>
          ,
          <year>2023</year>
          , doi: 10.1109/LSP.
          <year>2023</year>
          .
          <volume>3332298</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mahato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Khan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. K.</given-names>
            <surname>Yadav</surname>
          </string-name>
          , “
          <article-title>A modified approach to data hiding in Microsoft Word documents by change-tracking technique</article-title>
          ,
          <source>” Journal of King</source>
          Saud University - Computer and Information Sciences, vol.
          <volume>32</volume>
          , no.
          <issue>2</issue>
          , pp.
          <fpage>216</fpage>
          -
          <lpage>224</lpage>
          , Feb.
          <year>2020</year>
          , doi: 10.1016/j.jksuci.
          <year>2017</year>
          .
          <volume>08</volume>
          .004.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>S.</given-names>
            <surname>Mahato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. K.</given-names>
            <surname>Yadav</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Khan</surname>
          </string-name>
          , “
          <article-title>A novel information hiding scheme based on social networking site viewers' public comments</article-title>
          ,
          <source>” Journal of Information Security and Applications</source>
          , vol.
          <volume>47</volume>
          , pp.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          275-
          <fpage>283</fpage>
          , Aug.
          <year>2019</year>
          , doi: 10.1016/j.jisa.
          <year>2019</year>
          .
          <volume>05</volume>
          .013.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sheng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <surname>Y.</surname>
          </string-name>
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , “
          <article-title>TS-CNN: Text Steganalysis from Semantic Space Based on Convolutional Neural Network</article-title>
          ,” ArXiv, Oct.
          <year>2018</year>
          , Accessed: Mar.
          <volume>24</volume>
          ,
          <year>2024</year>
          . [Online].
          <fpage>123</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>T.</given-names>
            <surname>Fang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jaggi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Argyraki</surname>
          </string-name>
          , “
          <article-title>Generating Steganographic Text with LSTMs,”</article-title>
          <source>in Proceedings of ACL</source>
          <year>2017</year>
          , Student Research Workshop, A. Ettinger,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gella</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Labeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. O.</given-names>
            <surname>Alm</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Carpuat</surname>
          </string-name>
          , and M. Dredze, Eds., Vancouver, Canada: Association for Computational Linguistics, Jul.
          <year>2017</year>
          , pp.
          <fpage>100</fpage>
          -
          <lpage>106</lpage>
          . Accessed: Mar.
          <volume>24</volume>
          ,
          <year>2024</year>
          . [Online]. Available: https://aclanthology.org/P17-3017
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xue</surname>
          </string-name>
          , “
          <source>Convolutional Neural Network Based Text Steganalysis,” IEEE Signal Processing Letters</source>
          , vol.
          <volume>26</volume>
          , no.
          <issue>3</issue>
          , pp.
          <fpage>460</fpage>
          -
          <lpage>464</lpage>
          , Mar.
          <year>2019</year>
          , doi: 10.1109/LSP.
          <year>2019</year>
          .
          <volume>2895286</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.-J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “
          <article-title>TSCSW: text steganalysis and hidden capacity estimation based on convolutional sliding windows</article-title>
          ,
          <source>” Multimed Tools Appl</source>
          , vol.
          <volume>79</volume>
          , no.
          <issue>25</issue>
          , pp.
          <fpage>18293</fpage>
          -
          <lpage>18316</lpage>
          , Jul.
          <year>2020</year>
          , doi: 10.1007/s11042-020-08716-w.
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , BERT:
          <article-title>Pre-training of Deep Bidirectional Transformers for Language Understanding</article-title>
          .
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Niu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Wen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Zhong</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xue</surname>
          </string-name>
          , “
          <string-name>
            <surname>A Hybrid R-BILSTM-C Neural Network Based Text Steganalysis</surname>
          </string-name>
          ,
          <source>” IEEE Signal Processing Letters</source>
          , vol.
          <volume>26</volume>
          , no.
          <issue>12</issue>
          , pp.
          <fpage>1907</fpage>
          -
          <lpage>1911</lpage>
          , Dec.
          <year>2019</year>
          , doi: 10.1109/LSP.
          <year>2019</year>
          .
          <volume>2953953</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [25]
          <string-name>
            <surname>“T-Lex</surname>
            <given-names>Steganography</given-names>
          </string-name>
          ,” bitsofbinary.
          <source>Accessed: Mar. 24</source>
          ,
          <year>2024</year>
          . [Online]. Available: https://bitsofbinary.wordpress.com/category/t-lexsteganography/
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>Z.-L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.-Q.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.-M.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-F.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.-J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “RNN-Stega:
          <source>Linguistic Steganography Based on Recurrent Neural Networks,” IEEE Transactions on Information Forensics and Security</source>
          , vol.
          <volume>14</volume>
          , no.
          <issue>5</issue>
          , pp.
          <fpage>1280</fpage>
          -
          <lpage>1295</lpage>
          , May
          <year>2019</year>
          , doi: 10.1109/TIFS.
          <year>2018</year>
          .
          <volume>2871746</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>Z.-L.</given-names>
            <surname>Yang</surname>
          </string-name>
          , S.-Y. Zhang, Y.-
          <string-name>
            <given-names>T.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.-W.</given-names>
            <surname>Hu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.-F.</given-names>
            <surname>Huang</surname>
          </string-name>
          , “
          <article-title>VAE-Stega: Linguistic Steganography Based on Variational Auto-Encoder,”</article-title>
          <source>IEEE Transactions on Information Forensics and Security</source>
          , vol.
          <volume>16</volume>
          , pp.
          <fpage>880</fpage>
          -
          <lpage>895</lpage>
          ,
          <year>2021</year>
          , doi: 10.1109/TIFS.
          <year>2020</year>
          .
          <volume>3023279</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>J.</given-names>
            <surname>Zou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , S. ur Rehman, and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , “
          <article-title>High-Performance Linguistic Steganalysis, Capacity Estimation and Steganographic Positioning,” in Digital Forensics</article-title>
          and Watermarking,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.-Q.</given-names>
            <surname>Shi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Piva</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H. J.</given-names>
            <surname>Kim</surname>
          </string-name>
          , Eds., Cham: Springer International Publishing,
          <year>2021</year>
          , pp.
          <fpage>80</fpage>
          -
          <lpage>93</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -69449-
          <issue>4</issue>
          _
          <fpage>7</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          , S. Liu,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Jiao</surname>
          </string-name>
          , “
          <article-title>Linguistic Steganalysis via Densely Connected LSTM with Feature Pyramid,”</article-title>
          <source>in Proceedings of the 2020 ACM Workshop on Information Hiding and Multimedia Security</source>
          , in
          <string-name>
            <surname>IH</surname>
          </string-name>
          &amp;amp;MMSec '
          <fpage>20</fpage>
          . New York, NY, USA: Association for Computing Machinery, Jun.
          <year>2020</year>
          , pp.
          <fpage>5</fpage>
          -
          <lpage>10</lpage>
          . doi:
          <volume>10</volume>
          .1145/3369412.3395067.
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [30]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.-J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , “
          <source>TS-RNN: Text Steganalysis Based on Recurrent Neural Networks,” IEEE Signal Processing Letters</source>
          , vol.
          <volume>26</volume>
          , no.
          <issue>12</issue>
          , pp.
          <fpage>1743</fpage>
          -
          <lpage>1747</lpage>
          , Dec.
          <year>2019</year>
          , doi: 10.1109/LSP.
          <year>2019</year>
          .
          <volume>2920452</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Luo</surname>
          </string-name>
          and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Huang</surname>
          </string-name>
          , “
          <article-title>Text Steganography with High Embedding Rate: Using Recurrent Neural Networks to Generate Chinese Classic Poetry</article-title>
          ,”
          <source>in Proceedings of the 5th ACM Workshop on Information Hiding and Multimedia Security</source>
          , in
          <string-name>
            <surname>IH</surname>
          </string-name>
          &amp;amp;MMSec '
          <fpage>17</fpage>
          . New York, NY, USA: Association for Computing Machinery, Jun.
          <year>2017</year>
          , pp.
          <fpage>99</fpage>
          -
          <lpage>104</lpage>
          . doi:
          <volume>10</volume>
          .1145/3082031.3083240.
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [32]
          <string-name>
            <surname>Lo</surname>
            <given-names>Sciuto G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Russo</surname>
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Napoli</surname>
            <given-names>C.</given-names>
          </string-name>
          ,,
          <article-title>“A cloudbased flexible solution for psychometric tests validation, administration and evaluation</article-title>
          .,
          <source>” CEUR Workshop Proceedings</source>
          , vol.
          <volume>2468</volume>
          , pp.
          <fpage>16</fpage>
          -
          <lpage>21</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>