<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">An Innovative Crypto-Stego Technique for Secure and Privacy-Preserving on Reliable Transmission Data</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author role="corresp">
							<persName><forename type="first">Harikrishna</forename><surname>Bommala</surname></persName>
							<email>haribommala@gmail.com</email>
							<affiliation key="aff0">
								<orgName type="department">of Engineering &amp; Technology</orgName>
								<orgName type="institution">KG Reddy College</orgName>
								<address>
									<settlement>Moinabad, Hyderabad</settlement>
									<region>Telangana</region>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Seelam</forename><surname>Sai</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">of Engineering &amp; Technology</orgName>
								<orgName type="institution">KG Reddy College</orgName>
								<address>
									<settlement>Moinabad, Hyderabad</settlement>
									<region>Telangana</region>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Satyanarayana</forename><surname>Reddy</surname></persName>
							<affiliation key="aff0">
								<orgName type="department">of Engineering &amp; Technology</orgName>
								<orgName type="institution">KG Reddy College</orgName>
								<address>
									<settlement>Moinabad, Hyderabad</settlement>
									<region>Telangana</region>
									<country key="IN">India</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">An Innovative Crypto-Stego Technique for Secure and Privacy-Preserving on Reliable Transmission Data</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">ECF2B5A8A47B8D5110A86E0B2A5AC0C7</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T17:46+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Data security</term>
					<term>zig-Zag</term>
					<term>RailFence</term>
					<term>cryptography</term>
					<term>data transmission</term>
					<term>stegnography Orcid 0000-0002-9932-6152 (H. Bommala); 0000-0002-2985-3555 (S. S. S. Reddy)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><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 affect 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 efficient 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></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>To prevent unauthorized parties from deciphering private communications, cryptography involves the construction and analysis of secret procedures <ref type="bibr" target="#b0">[1]</ref>. 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 <ref type="bibr" target="#b1">[2]</ref>. 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 <ref type="bibr" target="#b2">[3]</ref>. Historically, people have prioritized the following computational security features: privacy, identity, verification, no-repudiation, integrity, and availability <ref type="bibr" target="#b3">[4]</ref>. As a consequence, the industry of secret document storage has developed dramatically. A new approach to information concealment is also necessary because of the rapid growth of the publishing and broadcasting generation. Unauthorized duplication of music, video, and other material that is only available in digital form raises concerns about copyright protection <ref type="bibr" target="#b4">[5]</ref>. 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 <ref type="bibr" target="#b5">[6]</ref> no longer be easily removed unless a unique technique is used <ref type="bibr" target="#b6">[7]</ref>. Data security may be achieved in several ways <ref type="bibr" target="#b7">[8]</ref> one is cryptography as shown in fig <ref type="figure" target="#fig_0">1</ref>. The sender uses an encryption key <ref type="bibr" target="#b8">[9]</ref> 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 <ref type="bibr" target="#b9">[10]</ref>. 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 <ref type="bibr" target="#b10">[11]</ref>. Few machine learning methods are proposed to detect network attacks <ref type="bibr" target="#b11">[12,</ref><ref type="bibr" target="#b12">13]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related Work</head><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 <ref type="bibr" target="#b13">[14]</ref> Present-day cryptography lies at the crossroads of the fields of mathematics, computer technology, electrical engineering, communication technology, and physics <ref type="bibr" target="#b14">[15]</ref> packages of cryptography contain digital commerce, chip-primarily based charge playing cards, virtual currencies, computer passwords, and military communications <ref type="bibr" target="#b15">[16]</ref> In times past, cryptography was almost identical with encryption, the process by which data is transformed from a legible country into incomprehensible gibberish <ref type="bibr" target="#b16">[17]</ref> 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 <ref type="bibr" target="#b17">[18]</ref>. 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 <ref type="bibr" target="#b18">[19]</ref> as of late, cryptography has relied heavily on mathematical concepts and computer technology exercises to develop cryptographic algorithms that are very difficult 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 difficult to employ in reality than the best theoretically breakable but computationally comfortable techniques <ref type="bibr" target="#b19">[20]</ref> 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 <ref type="bibr" target="#b20">[21]</ref>   </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Proposed System</head><p>The proposed work that concentrates on techniques which are used to overcome the existing disadvantages <ref type="bibr" target="#b20">[21]</ref> the existing system that uses the symmetric key cryptography to transfer the data <ref type="bibr" target="#b21">[22]</ref> but in the proposed work there is no keys that are used to encrypt the clear text. The proposed work as shown in fig. <ref type="figure" target="#fig_3">3</ref> that performs two main phases called data encryption and embedding process for encryption and reverse process called decryption <ref type="bibr" target="#b22">[23]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1.">Data Encryption</head><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 <ref type="bibr" target="#b20">[21]</ref> 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 <ref type="bibr" target="#b23">[24]</ref> 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></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2.">Modified Zig-Zag</head><p>Scan In order to no uniformly quantize N*N DCT coefficients, zigzag scanning is used <ref type="bibr" target="#b24">[25]</ref>. This coding scheme is based on transforms. The energy is concentrated in the lower coefficients 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 coefficients are zero after a critical threshold is passed. When encoding a non-zero coefficient, 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 coefficient, whereas sym1 is based on the magnitude of the coded coefficient. Therefore, the DCT coefficients are ordered in an efficient 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 coefficients in top of vector. Zig-zag scan matrix range </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3.">Modified Rail Fence</head><p>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. 4. Again, perform the actual rail fence process to get as usual original text. Fig. <ref type="figure" target="#fig_5">5</ref> shows the basic approach of Rail Fence method. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.4.">Modified Crossover</head><p>Reproduction and genetic crossover are likened to the crossover operator. In this more than one parent is chosen and one or more off-springs are generated utilizing the genetic material of 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 offers a novel crossover technique as shown in fig. <ref type="figure" target="#fig_6">6</ref>. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.5.">XoR Operation</head><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. <ref type="figure" target="#fig_8">7</ref> shows the basic encryption process to convert original message into cipher message.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Encryption Algorithm</head><p>Step 1: Read the text file.</p><p>Step 2: Convert each character in the file into corresponding ASCII value.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.6.">Decryption Algorithm</head><p>Step 1: Extract the RGB pixels from the stegoimage.</p><p>Step 2: Convert each pixel into corresponding ASCII value.  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Conclusion</head><p>In an efficient 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.</p><p>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></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Basic flow diagram of cryptography technique</figDesc><graphic coords="2,169.54,123.25,256.20,65.40" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head></head><label></label><figDesc>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.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Basic process of steganography technique</figDesc><graphic coords="3,163.24,285.80,268.80,103.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_3"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Architecture of proposed system</figDesc><graphic coords="4,155.74,84.19,283.80,190.80" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_4"><head>Figure 4 :</head><label>4</label><figDesc>Figure 4: 8*8 zigzag scan matrix</figDesc><graphic coords="5,149.74,84.19,295.80,129.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_5"><head>Figure 5 :</head><label>5</label><figDesc>Figure 5: Modified Rail Fence</figDesc><graphic coords="5,112.39,458.01,370.50,150.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_6"><head>Figure 6 :</head><label>6</label><figDesc>Figure 6: 4 x 4 matrix Crossover</figDesc><graphic coords="6,146.74,198.02,301.80,112.20" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_7"><head>Step 3 :</head><label>3</label><figDesc>Construct the corresponding data into 4*4 matrices. 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.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_8"><head>Figure 7 :</head><label>7</label><figDesc>Figure 7: Original message (left) to Cipher message (right)</figDesc><graphic coords="7,99.64,84.19,396.00,117.00" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_9"><head>Step 3 :</head><label>3</label><figDesc>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.</figDesc></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc>Time complexity for existing and proposed</figDesc><table><row><cell cols="3">File size Existed Proposed</cell></row><row><cell>1KB</cell><cell>285</cell><cell>221</cell></row><row><cell>5KB</cell><cell>370</cell><cell>277</cell></row><row><cell>10KB</cell><cell>360</cell><cell>301</cell></row><row><cell>15KB</cell><cell>395</cell><cell>318</cell></row><row><cell>20KB</cell><cell>720</cell><cell>587</cell></row><row><cell>Table 2</cell><cell></cell><cell></cell></row><row><cell>PSNR values for existing and proposed</cell><cell></cell><cell></cell></row><row><cell cols="3">File size Existed Proposed</cell></row><row><cell>1KB</cell><cell>4.4881</cell><cell>7.297</cell></row><row><cell>5KB</cell><cell>4.856</cell><cell>7.8978</cell></row><row><cell>10KB</cell><cell>4.8787</cell><cell>7.6931</cell></row><row><cell>15KB</cell><cell>4.7568</cell><cell>7.6589</cell></row><row><cell>20KB</cell><cell>4.6564</cell><cell>7.6129</cell></row></table></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Payload location for JPEG image steganography based on co-frequency sub-image filtering</title>
		<author>
			<persName><forename type="first">J</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Yang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Lu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Int. J. Distrib. Sens. Netw</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="page">155014771989956</biblScope>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">3-LAYER PC TEXT SECURI-TYVIA COMBININGCOMPRESSION</title>
		<author>
			<persName><forename type="first">N</forename><surname>Alanizy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Alanizy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Baghoza</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Alghamdi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gutub</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">AES CRYPTOGRAPHY2LSB IMAGE STEGANOG-RAPHY</title>
		<imprint>
			<biblScope unit="volume">03</biblScope>
			<biblScope unit="page" from="118" to="124" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
	<note>jreas</note>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Image feature based high capacity steganographic algorithm</title>
		<author>
			<persName><forename type="first">R</forename><surname>Biswas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Mukherjee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">K</forename><surname>Bandyopadhyay</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Multimed. Tools Appl</title>
		<imprint>
			<biblScope unit="volume">78</biblScope>
			<biblScope unit="page" from="20019" to="20036" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">A novel approach for excavating communication using taxonomy and outline mechanisms</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">V</forename><surname>Srinivas</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">S S</forename><surname>Reddy</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Sixth International Conference on Image Information Processing (ICIIP)</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2021">2021. 2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Secure data transmission in IoTs based on CLoG edge detection</title>
		<author>
			<persName><forename type="first">A</forename><surname>Jan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Parah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">A</forename><surname>Malik</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Rashid</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Future Gener. Comput. Syst</title>
		<imprint>
			<biblScope unit="volume">121</biblScope>
			<biblScope unit="page" from="59" to="73" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Data and privacy: Getting consumers to trust products enabled by the internet of things</title>
		<author>
			<persName><forename type="first">W</forename><forename type="middle">Z</forename><surname>Khan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">Y</forename><surname>Aalsalem</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">K</forename><surname>Khan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Arshad</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Consum. Electron. Mag</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page" from="35" to="38" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Compression multi-level crypto stego security of texts utilizing colored email forwarding</title>
		<author>
			<persName><forename type="first">A</forename><surname>Alsaidi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Al-Lehaibi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Alzahrani</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Alghamdi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gutub</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J. Comput. Sci. Comput. Math</title>
		<imprint>
			<biblScope unit="page" from="33" to="42" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Survey on machine learning with cloud technology preserving privacy: Risks and keys</title>
		<author>
			<persName><forename type="first">K</forename><surname>Hari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bommala</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Venkata Rao Yanamadni</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Dr</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Solid State Technology</title>
		<imprint>
			<biblScope unit="volume">64</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Public network security by bluffing the intruders through encryption over encryption using public key cryptography method</title>
		<author>
			<persName><forename type="first">V</forename><surname>Madaan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Sethi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Agrawal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Jain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Kaur</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Advanced Informatics for Computing Research: First International Conference, ICAICR 2017</title>
				<meeting><address><addrLine>Jalandhar, India</addrLine></address></meeting>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2017">March 17-18, 2017. 2017</date>
			<biblScope unit="page" from="249" to="257" />
		</imprint>
	</monogr>
	<note>Revised Selected Papers</note>
</biblStruct>

<biblStruct xml:id="b9">
	<monogr>
		<author>
			<persName><forename type="first">A</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Fister</surname><genName>Jr</genName></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Gupta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Debayle</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><forename type="middle">J</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Usman</surname></persName>
		</author>
		<title level="m">Artificial Intelligence and Data Science: First International Conference, ICAIDS 2021</title>
				<meeting><address><addrLine>Hyderabad, India</addrLine></address></meeting>
		<imprint>
			<publisher>Springer Nature</publisher>
			<date type="published" when="2021">December 17-18, 2021. 2022</date>
		</imprint>
	</monogr>
	<note>Revised Selected Papers</note>
</biblStruct>

<biblStruct xml:id="b10">
	<analytic>
		<title level="a" type="main">Secure and robust digital image watermarking using coefficient differencing and chaotic encryption</title>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">A</forename><surname>Loan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><forename type="middle">N</forename><surname>Hurrah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Parah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">W</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Sheikh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">M</forename><surname>Bhat</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Access</title>
		<imprint>
			<biblScope unit="volume">6</biblScope>
			<biblScope unit="page" from="19876" to="19897" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Framework for identifying network attacks through packet inspection using machine learning</title>
		<author>
			<persName><forename type="first">R</forename><surname>Shanker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Agrawal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Singh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><forename type="middle">W</forename><surname>Bhatt</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Nonlinear Engineering</title>
		<imprint>
			<biblScope unit="volume">12</biblScope>
			<biblScope unit="page">20220297</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<analytic>
		<title level="a" type="main">Fss-part: Feature grouping subset model for predicting network attacks</title>
		<author>
			<persName><forename type="first">R</forename><surname>Shanker</surname></persName>
		</author>
		<author>
			<persName><forename type="first">V</forename><surname>Madaan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">SN Computer Science</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page">94</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Remodeling randomness prioritization to boost-up security of RGB image encryption</title>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">O</forename><surname>Al-Roithy</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gutub</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Multimed. Tools Appl</title>
		<imprint>
			<biblScope unit="volume">80</biblScope>
			<biblScope unit="page" from="28521" to="28581" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">A novel laplacian of gaussian (LoG) and chaotic encryption based image steganography technique</title>
		<author>
			<persName><forename type="first">A</forename><surname>Jan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Parah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><forename type="middle">A</forename><surname>Malik</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">2020 International Conference for Emerging Technology (INCET)</title>
				<imprint>
			<publisher>IEEE</publisher>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Multiple watermarking technique for securing online social network contents using back propagation neural network</title>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">K</forename><surname>Singh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">K</forename><surname>Singh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">P</forename><surname>Ghrera</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Mohan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Future Gener. Comput. Syst</title>
		<imprint>
			<biblScope unit="volume">86</biblScope>
			<biblScope unit="page" from="926" to="939" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">A novel multi-dimensional multiple image encryption technique</title>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">A K</forename><surname>Patro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Acharya</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Multimed. Tools Appl</title>
		<imprint>
			<biblScope unit="volume">79</biblScope>
			<biblScope unit="page" from="12959" to="12994" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">An improved image steganography technique using edge based data hiding in DCT domain</title>
		<author>
			<persName><forename type="first">N</forename><surname>Ayub</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Selwal</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J. Interdiscip. Math</title>
		<imprint>
			<biblScope unit="volume">23</biblScope>
			<biblScope unit="page" from="357" to="366" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Tamper detection and self-recovery of medical imagery for smart health</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hussan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">A</forename><surname>Parah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Gull</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">J</forename><surname>Qureshi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Arab. J. Sci. Eng</title>
		<imprint>
			<biblScope unit="volume">46</biblScope>
			<biblScope unit="page" from="3465" to="3481" />
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Image steganography using uncorrelated color space and its application for security of visual contents in online social networks</title>
		<author>
			<persName><forename type="first">K</forename><surname>Muhammad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sajjad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Mehmood</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Rho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">W</forename><surname>Baik</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Future Gener. Comput. Syst</title>
		<imprint>
			<biblScope unit="volume">86</biblScope>
			<biblScope unit="page" from="951" to="960" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">Novel embedding secrecy within images utilizing an improved interpolation-based reversible data hiding scheme</title>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">S</forename><surname>Hassan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gutub</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">J. King Saud Univ. -Comput. Inf. Sci</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page" from="2017" to="2030" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<analytic>
		<title level="a" type="main">Image steganography in spatial domain: A survey, Signal Process</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hussain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">W A</forename><surname>Wahab</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">I B</forename><surname>Idris</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">T S</forename><surname>Ho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K.-H</forename><surname>Jung</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Image Commun</title>
		<imprint>
			<biblScope unit="volume">65</biblScope>
			<biblScope unit="page" from="46" to="66" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Image steganography using uncorrelated color space and its application for security of visual contents in online social networks</title>
		<author>
			<persName><forename type="first">K</forename><surname>Muhammad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Sajjad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Mehmood</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Rho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><forename type="middle">W</forename><surname>Baik</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Future Generation Computer Systems</title>
		<imprint>
			<biblScope unit="volume">86</biblScope>
			<biblScope unit="page" from="951" to="960" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Novel embedding secrecy within images utilizing an improved interpolation-based reversible data hiding scheme</title>
		<author>
			<persName><forename type="first">F</forename><forename type="middle">S</forename><surname>Hassan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gutub</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of King Saud University-Computer and Information Sciences</title>
		<imprint>
			<biblScope unit="volume">34</biblScope>
			<biblScope unit="page" from="2017" to="2030" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Image steganography in spatial domain: A survey</title>
		<author>
			<persName><forename type="first">M</forename><surname>Hussain</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">W A</forename><surname>Wahab</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><forename type="middle">I B</forename><surname>Idris</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">T</forename><surname>Ho</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K.-H</forename><surname>Jung</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Signal Processing: Image Communication</title>
		<imprint>
			<biblScope unit="volume">65</biblScope>
			<biblScope unit="page" from="46" to="66" />
			<date type="published" when="2018">2018</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<monogr>
		<title level="m" type="main">Deep CNN Based Whale Optimization for Predicting the Rice Plant Disease in Real Time, ???</title>
		<editor>S. Sai Satyanarayana Reddy, G. Sowmya, V. B. Reddy, B. D. Kumar, A. Kumar</editor>
		<imprint/>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
