<!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>An Innovative Crypto-Stego Technique for Secure and Privacy-Preserving on Reliable Transmission Data</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Harikrishna Bommala</string-name>
          <email>haribommala@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Seelam Sai Satyanarayana Reddy</string-name>
          <email>saisn90@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>KG Reddy College of Engineering &amp; Technology</institution>
          ,
          <addr-line>Moinabad, Hyderabad, Telangana</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <fpage>282</fpage>
      <lpage>290</lpage>
      <abstract>
        <p>In this day's data communication became too much risk factor that there are so many third-party persons are getting an unauthorized access to get the details of the communication, which will afect the security and privacy. Even though we are applying so many data security techniques and privacy techniques simultaneously the unauthorized access mechanism's also developing so secure and privacy communication became more concern and to achieve that previously vernal cipher method, it had a disadvantage that depending on number of input characters that much number of keys are need to generate. To overcome this method and to achieve the secure and privacy preserving communication without getting any unauthorized access that may lead to modification of data so we are proposed technique that provides modern methods inclusive of modified Zig-Zag, modified rail fence, crossover and XOR operations without key similarly, statistics is embedded in picture with none deformation the parameter evaluation along with MSC and PSNR displaying higher outcomes than existing algorithm. In the proposed work an eficient LSB primarily based photo steganography is provided. The proposed technique ensures there's no fundamental adjustments are done where secret message is embedded into cover adjustments.</p>
      </abstract>
      <kwd-group>
        <kwd>Reliable Transmission</kwd>
        <kwd>Data security</kwd>
        <kwd>zig-Zag</kwd>
        <kwd>RailFence</kwd>
        <kwd>cryptography</kwd>
        <kwd>data transmission</kwd>
        <kwd>stegnography</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        To prevent unauthorized parties from deciphering private communications, cryptography
involves the construction and analysis of secret procedures [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Steganography refers to the
process of secretly transmitting data by embedding it in another file, message, picture, or video.
The expanding capabilities of modern communications call for a fresh approach to security,
particularly in the realm of wireless laptop networks [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. Network protection is turning into
extra crucial as the amount of information being exchanged on the net is increasing safety
necessities are necessary both at the very last consumer level and at the organization degree,
mainly because of the massive utilization of non-public computer systems, networks, and the
internet with its worldwide availability [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Historically, people have prioritized the following
computational security features: privacy, identity, verification, no-repudiation, integrity, and
availability [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. As a consequence, the industry of secret document storage has developed
CEUR
Workshop
Proceedings
      </p>
      <p>ceur-ws.org
ISSN1613-0073
dramatically. A new approach to information concealment is also necessary because of the
rapid growth of the publishing and broadcasting generation.</p>
      <p>
        Unauthorized duplication of music, video, and other material that is only available in digital
form raises concerns about copyright protection [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. The music, film, book, and software
publishing businesses are particularly hard hit by the nuisance of unlawful copying. To get
around this problem, assessment remarks might be sent to the output record using hidden data
buried in the digital medium [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] no longer be easily removed unless a unique technique is
used [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Data security may be achieved in several ways [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] one is cryptography as shown in
ifg 1. The sender uses an encryption key [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] to scramble the message, the scrambled message
is broadcast via an unsecured public channel, and the unique, unencrypted message can be
reconstructed only if the recipient has the appropriate decryption key. The second method is
called steganography, and it involves concealing a message inside another message such that
its very existence is concealed [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. They adapt rapidly to varying levels of illumination in
photos of everyday scenes when it comes to size and variety, LPs just can’t be mistaken for
anything else in a photograph [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Few machine learning methods are proposed to detect
network attacks [
        <xref ref-type="bibr" rid="ref12 ref13">12, 13</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>
        Data security, confidentiality, information integrity, authentication, and non-repudiation are
all relevant to modern cryptography, which is the practice and study of techniques for secure
communication in the face of adversarial behavior [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] Present-day cryptography lies at the
crossroads of the fields of mathematics, computer technology, electrical engineering,
communication technology, and physics [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] packages of cryptography contain digital commerce,
chip-primarily based charge playing cards, virtual currencies, computer passwords, and military
communications [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] In times past, cryptography was almost identical with encryption, the
process by which data is transformed from a legible country into incomprehensible gibberish [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
to prevent unauthorized parties from reading encrypted messages, the sender only provides
the decryption method to the intended recipients. Alice (”A”) is the sender, Bob (”B”) is the
intended receiver, and Eve (”eavesdropper”) is the adversary, in the cryptography literature [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
The emergence of computers during World War II and the usage of rotor cipher machines
during World War I have both contributed to the complexity and breadth of cryptographic
techniques [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] as of late, cryptography has relied heavily on mathematical concepts and
computer technology exercises to develop cryptographic algorithms that are very dificult for
any opponent to crack in reality [? ] While it may be conceivable to disrupt a well-designed
system in theory, doing so in reality is very unlikely to succeed. This kind of system is called
”computationally cozy” if it is well-designed; nevertheless, theoretical developments (such as
improvements in integer factorization techniques) and faster computer technology need that
such designs be constantly reevaluated and, if necessary, updated. The only-time pad and other
statistically secure but computationally insecure systems are far more dificult to employ in
reality than the best theoretically breakable but computationally comfortable techniques [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]
The proliferation of cryptography has given rise to a slew of statistical age jail issues. Because
of its potential for use in espionage and sedition, several countries have treated cryptography
like a weapon, restricting or outright banning its use and export. Some countries have passed
legislation making [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] it possible for law enforcement to demand the surrender of encryption
keys for data relevant to an investigation. Digital media copyright infringement challenges
and online rights management both rely heavily on cryptography. Steganography technique as
shown in fig 2 is a means of hiding mystery info inside (or even on top of) an in any other case
commonplace, non-secret document or other medium to stay away from discovery.
      </p>
      <p>The fig 2 dispatches can use steganography to hide textual content, video, pics, or maybe
audio statistics. It’s a useful bit of know-how, limited handiest by the kind of medium and the
writer’s imagination.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Proposed System</title>
      <p>
        The proposed work that concentrates on techniques which are used to overcome the existing
disadvantages [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] the existing system that uses the symmetric key cryptography to transfer
the data [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] but in the proposed work there is no keys that are used to encrypt the clear text.
The proposed work as shown in fig. 3 that performs two main phases called data encryption
and embedding process for encryption and reverse process called decryption [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ].
      </p>
      <sec id="sec-3-1">
        <title>3.1. Data Encryption</title>
        <p>
          The goal of encryption in cryptography is to ensure that only authorized parties have access to a
message or piece of information. The only thing encryption does is make it so an eavesdropper
can’t understand what’s being said. The plaintext of a message or other piece of information
is encrypted using an encryption algorithm and a cipher to produce a version of the message
known as ciphertext [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] Both public-key and symmetric-key cryptography are not required to
encrypt documents. Instead, we suggest a scheme where the document is encrypted without
the usage of a key. If you want to ensure the highest level of security, you shouldn’t use the
same passphrase to guard your private key as you do the keyless procedure that drives the
keyless cipher [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ] When it is not necessary to share the password with anybody else, keyless
encryption is a great way to keep sensitive data safe. Encrypting a file using a keyless cipher
is possible by selecting this menu item. There were four stages of encryption and four stages
of decryption in the suggested technique for encrypting work files. The four-step encryption
procedure is a methodical, multi-stage scheme that employs four novel techniques. Z-scan, a
tweaked rail fence, a cross-over, and a xor operation are the new techniques.
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Modified Zig-Zag</title>
        <p>
          Scan In order to no uniformly quantize N*N DCT coeficients, zigzag scanning is used [
          <xref ref-type="bibr" rid="ref25">25</xref>
          ]. This
coding scheme is based on transforms. The energy is concentrated in the lower coeficients
and is dispersed in a radial pattern around the origin. The end result is a one-dimensional
sequence in which the vast majority of the coeficients are zero after a critical threshold is
passed. When encoding a non-zero coeficient, the category/run length encoding first counts
the number of consecutive zeroes in the scanned sequence. Both sym1 and sym2 are based on
the number of zeros before the nonzero coeficient, whereas sym1 is based on the magnitude of
the coded coeficient. Therefore, the DCT coeficients are ordered in an eficient fashion for the
category/run coding phase by use of zigzag scanning. The zigzag operation on binary integers
has been described up to this point.
        </p>
        <p>But in this proposed work actually perform on decimal numbers (ASCII of Plain text). The
system that uses this operation to make original text to somewhat disturbed text.Zig-zag scan
used because to group low frequency coeficients in top of vector. Zig-zag scan matrix range
that can defined in two ways such as 4*4 and 8*8 as shown in fig. 4. By performing this scan
method, it generates intermediate cipher text1. Maps 8*8 to a 1*64 vector Maps 4*4 to a 1*16
vector.
3.3. Modified Rail Fence
1. Data is organized just like as wave form, in this form there exist two levels of values.
2. Second level values are followed by first level values which creates first stage of
intermediate cipher2.
3. In the next step split the intermediate cipher into two parts and align them as rail fence
structure.</p>
        <p>4. Again, perform the actual rail fence process to get as usual original text.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.4. Modified Crossover</title>
        <p>Reproduction and genetic crossover are likened to the crossover operator. In this more than one
parent is chosen and one or more of-springs are generated utilizing the genetic material of the
parents. It’s important to keep in mind that the GA Designer has the option of implementing
a problem-specific crossover operator in addition to these fairly general ones. To convert
an original matrix into an intermediate cipher3, the proposed work ofers a novel crossover
technique as shown in fig. 6.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.5. XoR Operation</title>
        <p>The only two possible numbers in a computer are zero and one, hence all computations are
performed using the binary system. Everything on a computer, including numbers, letters,
pictures, and videos, is saved and displayed in this way.We shall restrict ourselves to integers
for this exercise. All computers first transform integers supplied by the user into a binary
representation of the number before carrying out any calculations. Fig. 7 shows the basic
encryption process to convert original message into cipher message.</p>
        <p>Encryption Algorithm
Step 1: Read the text file.</p>
        <p>Step 2: Convert each character in the file into corresponding ASCII value.</p>
        <p>Step 3: Construct the corresponding data into 4*4 matrices.</p>
        <p>Step 4: Each 4*4 block performs the following methods one by one
Step 4.1: Modified 4*4 Zig-Zag scan
Step 4.2: Modified Rail fence
Step 4.3: Crossover
Step 4.4: XOR operation
Step 5: Embed the result of XOR into individual RGB planes.</p>
      </sec>
      <sec id="sec-3-5">
        <title>3.6. Decryption Algorithm</title>
        <p>Step 1: Extract the RGB pixels from the stegoimage.</p>
        <p>Step 2: Convert each pixel into corresponding ASCII value.
Step 3: Construct the corresponding data into 4 x 4 matrices.
Step 4: Each 4 x 4 block performs the following methods one by one
Step 4.1: XOR operation
Step 4.2: Crossover
Step 4.3: Modified Rail fence
Step 4.4: Modified 4*4 Zig-Zag scan
Step 5: Decrypted plain.txt file will be created.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion</title>
      <p>In an eficient LSB based image steganography is presented. The planned method ensures there
is no major changes are accomplished where secret message is embedded into cover changes.
The secret message has been generated with innovative method such as 4*4 zig-zag, crossover
and modified rail fence. When compared with existing it is taking more time for embedding
the data. In the parameter analysis PSNR values are high when compared with existing, which
means there is no major changes in cover image. Further this work may be extended for audio
and video by keeping PSNR as higher values.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <article-title>Payload location for JPEG image steganography based on co-frequency sub-image filtering</article-title>
          ,
          <source>Int. J. Distrib. Sens. Netw</source>
          .
          <volume>16</volume>
          (
          <year>2020</year>
          )
          <fpage>155014771989956</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Alanizy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Alanizy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Baghoza</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>AlGhamdi, A</article-title>
          . Gutub, 3
          <article-title>-LAYER PC TEXT SECURITYVIA COMBININGCOMPRESSION, AES CRYPTOGRAPHY2LSB IMAGE STEGANOGRAPHY</article-title>
          , jreas
          <volume>03</volume>
          (
          <year>2018</year>
          )
          <fpage>118</fpage>
          -
          <lpage>124</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>R.</given-names>
            <surname>Biswas</surname>
          </string-name>
          , I. Mukherjee,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Bandyopadhyay</surname>
          </string-name>
          ,
          <article-title>Image feature based high capacity steganographic algorithm</article-title>
          ,
          <source>Multimed. Tools Appl</source>
          .
          <volume>78</volume>
          (
          <year>2019</year>
          )
          <fpage>20019</fpage>
          -
          <lpage>20036</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A. V.</given-names>
            <surname>Srinivas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. S. S.</given-names>
            <surname>Reddy</surname>
          </string-name>
          ,
          <article-title>A novel approach for excavating communication using taxonomy and outline mechanisms</article-title>
          ,
          <source>in: 2021 Sixth International Conference on Image Information Processing (ICIIP)</source>
          , IEEE,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Parah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. A.</given-names>
            <surname>Malik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rashid</surname>
          </string-name>
          ,
          <article-title>Secure data transmission in IoTs based on CLoG edge detection</article-title>
          ,
          <source>Future Gener. Comput. Syst</source>
          .
          <volume>121</volume>
          (
          <year>2021</year>
          )
          <fpage>59</fpage>
          -
          <lpage>73</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>W. Z.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Y.</given-names>
            <surname>Aalsalem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. K.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Arshad</surname>
          </string-name>
          ,
          <article-title>Data and privacy: Getting consumers to trust products enabled by the internet of things</article-title>
          ,
          <source>IEEE Consum. Electron. Mag</source>
          .
          <volume>8</volume>
          (
          <year>2019</year>
          )
          <fpage>35</fpage>
          -
          <lpage>38</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Alsaidi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Al-lehaibi</surname>
          </string-name>
          , H. Alzahrani,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>AlGhamdi, A</article-title>
          . Gutub,
          <article-title>Compression multi-level crypto stego security of texts utilizing colored email forwarding</article-title>
          ,
          <source>J. Comput. Sci. Comput</source>
          . Math. (
          <year>2018</year>
          )
          <fpage>33</fpage>
          -
          <lpage>42</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>K.</given-names>
            <surname>Hari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Bommala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. Venkata</given-names>
            <surname>Rao Yanamadni</surname>
          </string-name>
          ,
          <string-name>
            <surname>S. Dr,</surname>
          </string-name>
          <article-title>Survey on machine learning with cloud technology preserving privacy: Risks and keys</article-title>
          ,
          <source>Solid State Technology</source>
          <volume>64</volume>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>V.</given-names>
            <surname>Madaan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Sethi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Kaur</surname>
          </string-name>
          ,
          <article-title>Public network security by blufing the intruders through encryption over encryption using public key cryptography method</article-title>
          , in: Advanced Informatics for Computing Research: First International Conference, ICAICR 2017, Jalandhar, India, March
          <volume>17</volume>
          -18,
          <year>2017</year>
          , Revised Selected Papers, Springer,
          <year>2017</year>
          , pp.
          <fpage>249</fpage>
          -
          <lpage>257</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. Fister</given-names>
            <surname>Jr</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gupta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Debayle</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z. J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , M. Usman,
          <source>Artificial Intelligence and Data Science: First International Conference, ICAIDS</source>
          <year>2021</year>
          , Hyderabad, India,
          <source>December 17-18</source>
          ,
          <year>2021</year>
          , Revised Selected Papers, Springer Nature,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N. A.</given-names>
            <surname>Loan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. N.</given-names>
            <surname>Hurrah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Parah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Sheikh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Bhat</surname>
          </string-name>
          ,
          <article-title>Secure and robust digital image watermarking using coeficient diferencing and chaotic encryption</article-title>
          ,
          <source>IEEE Access 6</source>
          (
          <year>2018</year>
          )
          <fpage>19876</fpage>
          -
          <lpage>19897</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>R.</given-names>
            <surname>Shanker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Bhatt</surname>
          </string-name>
          ,
          <article-title>Framework for identifying network attacks through packet inspection using machine learning</article-title>
          ,
          <source>Nonlinear Engineering</source>
          <volume>12</volume>
          (
          <year>2023</year>
          )
          <fpage>20220297</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>R.</given-names>
            <surname>Shanker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Madaan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          , Fss-part:
          <article-title>Feature grouping subset model for predicting network attacks</article-title>
          ,
          <source>SN Computer Science</source>
          <volume>5</volume>
          (
          <year>2023</year>
          )
          <fpage>94</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>B. O.</given-names>
            <surname>Al-Roithy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gutub</surname>
          </string-name>
          ,
          <article-title>Remodeling randomness prioritization to boost-up security of RGB image encryption</article-title>
          ,
          <source>Multimed. Tools Appl</source>
          .
          <volume>80</volume>
          (
          <year>2021</year>
          )
          <fpage>28521</fpage>
          -
          <lpage>28581</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Jan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Parah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. A.</given-names>
            <surname>Malik</surname>
          </string-name>
          ,
          <article-title>A novel laplacian of gaussian (LoG) and chaotic encryption based image steganography technique</article-title>
          ,
          <source>in: 2020 International Conference for Emerging Technology (INCET)</source>
          , IEEE,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>A. K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Ghrera</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mohan</surname>
          </string-name>
          ,
          <article-title>Multiple watermarking technique for securing online social network contents using back propagation neural network, Future Gener</article-title>
          .
          <source>Comput. Syst</source>
          .
          <volume>86</volume>
          (
          <year>2018</year>
          )
          <fpage>926</fpage>
          -
          <lpage>939</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>K. A. K. Patro</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Acharya</surname>
          </string-name>
          ,
          <article-title>A novel multi-dimensional multiple image encryption technique, Multimed</article-title>
          .
          <source>Tools Appl</source>
          .
          <volume>79</volume>
          (
          <year>2020</year>
          )
          <fpage>12959</fpage>
          -
          <lpage>12994</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>N.</given-names>
            <surname>Ayub</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Selwal</surname>
          </string-name>
          ,
          <article-title>An improved image steganography technique using edge based data hiding in DCT domain</article-title>
          , J. Interdiscip. Math.
          <volume>23</volume>
          (
          <year>2020</year>
          )
          <fpage>357</fpage>
          -
          <lpage>366</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hussan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Parah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gull</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. J.</given-names>
            <surname>Qureshi</surname>
          </string-name>
          ,
          <article-title>Tamper detection and self-recovery of medical imagery for smart health</article-title>
          ,
          <source>Arab. J. Sci. Eng</source>
          .
          <volume>46</volume>
          (
          <year>2021</year>
          )
          <fpage>3465</fpage>
          -
          <lpage>3481</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>K.</given-names>
            <surname>Muhammad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sajjad</surname>
          </string-name>
          , I. Mehmood,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. W.</given-names>
            <surname>Baik</surname>
          </string-name>
          ,
          <article-title>Image steganography using uncorrelated color space and its application for security of visual contents in online social networks</article-title>
          ,
          <source>Future Gener. Comput. Syst</source>
          .
          <volume>86</volume>
          (
          <year>2018</year>
          )
          <fpage>951</fpage>
          -
          <lpage>960</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>F. S.</given-names>
            <surname>Hassan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gutub</surname>
          </string-name>
          ,
          <article-title>Novel embedding secrecy within images utilizing an improved interpolation-based reversible data hiding scheme</article-title>
          ,
          <source>J. King Saud Univ. - Comput. Inf. Sci</source>
          .
          <volume>34</volume>
          (
          <year>2022</year>
          )
          <fpage>2017</fpage>
          -
          <lpage>2030</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hussain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W. A.</given-names>
            <surname>Wahab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. I. B.</given-names>
            <surname>Idris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. T. S.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-H. Jung</surname>
          </string-name>
          ,
          <article-title>Image steganography in spatial domain: A survey, Signal Process</article-title>
          .
          <source>Image Commun</source>
          .
          <volume>65</volume>
          (
          <year>2018</year>
          )
          <fpage>46</fpage>
          -
          <lpage>66</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>K.</given-names>
            <surname>Muhammad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sajjad</surname>
          </string-name>
          , I. Mehmood,
          <string-name>
            <given-names>S.</given-names>
            <surname>Rho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. W.</given-names>
            <surname>Baik</surname>
          </string-name>
          ,
          <article-title>Image steganography using uncorrelated color space and its application for security of visual contents in online social networks</article-title>
          ,
          <source>Future Generation Computer Systems</source>
          <volume>86</volume>
          (
          <year>2018</year>
          )
          <fpage>951</fpage>
          -
          <lpage>960</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>F. S.</given-names>
            <surname>Hassan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gutub</surname>
          </string-name>
          ,
          <article-title>Novel embedding secrecy within images utilizing an improved interpolation-based reversible data hiding scheme</article-title>
          ,
          <source>Journal of King Saud UniversityComputer and Information Sciences</source>
          <volume>34</volume>
          (
          <year>2022</year>
          )
          <fpage>2017</fpage>
          -
          <lpage>2030</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hussain</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. W. A.</given-names>
            <surname>Wahab</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. I. B.</given-names>
            <surname>Idris</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. T.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.-H. Jung</surname>
          </string-name>
          ,
          <article-title>Image steganography in spatial domain: A survey</article-title>
          ,
          <source>Signal Processing: Image Communication</source>
          <volume>65</volume>
          (
          <year>2018</year>
          )
          <fpage>46</fpage>
          -
          <lpage>66</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Sai Satyanarayana Reddy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sowmya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. B.</given-names>
            <surname>Reddy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Kumar (Eds.),
          <article-title>Deep CNN Based Whale Optimization for Predicting the Rice Plant Disease in Real Time</article-title>
          , ????
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>