Wireless Personal Communications (2022) 123:2431–2448

https://doi.org/10.1007/s11277-021-09248-8

An Improved RSA Technique with Efficient Data Integrity

Verification for Outsourcing Database in Cloud

K. L. Neela1 · V. Kavitha2

Accepted: 19 October 2021 / Published online: 8 January 2022

© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021

Abstract
The Cloud Environment provides storage for files as well as sharing services for dissemi-
nated clients. This technology helps users in the cloud to outsource their data and get good
quality services from the cloud. Often, Data Integrity is a serious issue in Cloud Storage
because the service provider is a semi-trusted one. Consequently, a self-determining audit-
ing service is essential to check data integrity. In this paper, we developed a secure Cloud
Storage environment without a third-party system and proposed an Improved Rivest-
Shamir-Adleman Encryption Algorithm (IREA) along with the Flexible Capacity Cuckoo
Filter (FCCF) auditing technique without Third Party Auditing. In this proposed system,
the data owner encrypts the data using Improved RSA and stores it in the Cloud Service,
and users alone can decrypt the data with the knowledge of the data owner. Furthermore,
the FCCF ensures the integrity of the verification and secure data transactions can be pro-
vided by using the Two Level Quick Response (2LQR) code. The experimental results val-
idate that the proposed IREA-FCCF with the 2LQR technique for data security in a CE has
less time compared to that of the existing schemes in terms of encryption time, decryption
time, signature generation, signature verification, and cost of the dynamic records.

Keywords Cloud computing · Data security · Authentication · Fingerprint · Integrity

1 Introduction

Cloud Computing (CC) was built to convey computing services over the internet [1, 2, 3, 4] It
is based on outsourcing computing resources rather than relying on personal devices or local
servers [5, 6]. Outsourcing data is a main component for CC because Data Owner (DO) can
transmit resources to other services for sharing with organizations and users. However, they
should be concerned about the possibility of their data being updated or wiped without their
permission [7, 8]. To soften this risk, a DO must performances regular Data Integrity (DI)

* K. L. Neela
phd.klneela003@gmail.com
1
Department of Computer Science and Engineering, University College of Engineering,
Thirukkuvalai, Tamil Nadu, India
2
Department of Computer Science and Engineering, University College of Engineering,
Kancheepuram, Tamil Nadu, India

13
Vol.:(0123456789)
2432 K. L. Neela, V. Kavitha

checks to validate the information and identify any illegal entry [9, 10]. This makes the devel-
opment of a secure storage system challenging due to unauthorized data access. In organiza-
tions, CC is a centralized system that is very commonly used to store financial data, medical
data, personal data of employees, organization asset data, military, education, and collabora-
tion data, etc. The theft of this information can cause awful complications for organizations
or DO. Security is one of the most crucial topics to discuss when it comes to CC. It is critical
for service providers to guarantee that information is stored in a secure and safe manner. This
necessitates a greater level of cloud computing expertise and knowledge. Companies require
qualified experts who can guarantee security at all phases of cloud services. It is also criti-
cal for service providers to protect themselves from attacks. Even small companies that do
not place a high priority on security must improve their security. To overcome these security
issues, cryptographic techniques are being utilized by several researchers [11, 12, 13, 14].
Symmetric and asymmetric key-based algorithms are the two types of cryptographic
techniques. Some of the cryptographic algorithms that have been used in recent years, like
AES (Advanced Encryption Standard), ElGamal algorithm, RSA (Rivest-Shamir-Adleman),
RC4, DES (Data Encryption Standard), 3DES, and Blowfish [15, 16 17, 18] were proposed
to secure information. However, securing information communicated over the network is a
complex process. There are asymmetric key-based algorithms that have a higher level of secu-
rity than symmetric algorithms but are slower. It’s also challenging to efficiently and safely
manage such a large number of key-pairs. Adequately long keys and recent analysis of RSA
are viewed as safer to utilize [19, 20, 21]. The RSA Algorithm is public-key cryptography
and is considered to be one of the incredible advances in the field of public-key cryptography.
It is reasonable for encryption and more secure against various attacks. However, the RSA
algorithm is slow and unsuitable for the global framework. Moreover, the improvement of a
web application needs a safe cryptosystem for communication. It is appropriate to communi-
cate safely with a public-key cryptosystem. To obtain client fulfillment, high-speed algorithms
with improved security must be created. Due to the factorization attack in the RSA Algorithm,
it is very hard to factorize and get the original prime number. This makes the method less
secure and the time complexity increases. Therefore, we aim to improve the conventional RSA
Algorithm and propose an IREA algorithm for secure data transactions along with DI verifica-
tion using FCCF. Also, the 2LQR-code is used for secure data transactions. The contributions
to this work are listed below:

• The proposed IREA algorithm method improves security effectively. The proposed IREA
uses public key and modulus which enhances the security when compared with the origi-
nal RSA Algorithm.
• The privacy system preserves outsourced data verification using the FCCF wTPA. It sup-
ports dynamic record data, as well as the accuracy and completeness of the query result.
The 2LQR code serves to protect the transaction and data integrity.
• The proposed IREA-FCCF with the 2LQR technique for data security in a CE has less
time compared to that of the existing schemes in terms of encryption time, decryption
time, signature generation, signature verification, and cost of the dynamic records.

2 Related Work

Some of the Recently Used Data Security (DS) in Cloud Research Work are Shown
Below

13
An Improved RSA Technique with Efficient Data Integrity… 2433

Goyal and Kant [22] designed an effective hybrid encryption technique in CC.to attain
cloud information safety. The proposed hybrid technique employs two distinct keys for
encryption and decryption. The information is transmitted from DO to to end user. Because
the cloud is a collection of unequal resources composed to provide services, a slew of sus-
ceptibilities may exist in a cloud setup, the consequences of which could be disastrous for
cloud data storage. Its principal security policy is encryption. Encoding is the process of
converting plain text into an encrypted version of ciphertext that can only be decrypted
and read by a lawful individual with a proper decryption key. A dishonest person cannot
decrypt and understand the ciphertext easily without decryption key. The proposed method
sends two protected keys for high security. However, it reduces the speed of the data while
using the OTP (One Time Password).
Lee et al. [23] implemented AES in the Heroku cloud platform for DS. The steps
involved in this AES algorithm are substituting bytes, shifting rows, mixing columns, and
the ADD round key. The Heroku platform supports programming languages [Heroku,
Available: https://​www.​heroku.​com/​home]. Heroku runs the Dyno app. The Dyno app
is the heart of the Heroku platform. Before uploading the data to the cloud, the data is
encrypted and, to download the data, the client should use the key to decrypt the data.
However, the speed of encryption is slow.
Yang et al. [24] proposed File Remotely Keyed Encryption & Data Protection (FREDP).
Here, it involves communication between the mobile terminal, private cloud, and public
cloud. In this method, the storage and computation load of the mobile terminal are reduced.
Private clouds receive massive amounts of data and computation tasks. This technique has
four phases. They are file remotely keyed encryption, ciphertext uploading, the storage
phase, and DI verification. This method is secure, but it is slow for file sharing.
Li et al. [25] proposed Extended File Hierarchy AES. Here, it saves the ciphertext stor-
age space and minimizes the computation encryption load. It can encrypt multiple files at
the same time. An extended Hierarchy access tree was adopted to access the structure to
implement the FH-ABE. Setting up, encrypting, keygen, and other steps are involved. Fur-
thermore, this method has been proven to be safe. But, the authority center in our scheme
is not trustworthy.
Sharma and Kalra [26] proposed an authentication pattern based on quantum distributed
keys for identity authentication in cloud computing. The suggested authentication meth-
odology is divided into four parts. During the first phase, registration, the server stores
the user’s authentication parameters. The second stage is the login phase, during which
the Cloud Storage (CS) services are provided. A request is sent to the server by the user.
The third stage is the authentication phase, in which the user and the CS are both authen-
ticated in the same way. The user will then be prompted to change their password. This
authentication technique involves two entities: a user who want to use cloud services and a
server operated by a service provider. When talking with or using a network, the server is a
trusted, authenticated authority, and the user’s identity needs to be validated. This method
has a high level of security, but its computational complexity is high.
Wu et al. [27] introduced secure searchable public-key encryption with private protec-
tion (SPE-PP). The secret key is generated using Diffie-Hellmen. This system has four
entries: DO, Cloud Services Provider (CSP), certificate authority, and data user. This tech-
nique makes use of four algorithms are setup, Keygen, SPE PP, and the trapdoor. This,
requires a secret key for the generation of ciphertext. Its performance is better in terms of
security. However, the time taken for encryption is quite high and the system is complex.
Sharma et al. [28] proposed a Hybrid Cryptographic approach for File Storage Mech-
anisms in Cloud computing. This proposed hybrid encryption method consist of RC4

13
2434 K. L. Neela, V. Kavitha

(Rivest Cipher), AES, and DES algorithms. The file is divided into three sections and sent
to the AES, DES, and RC4 algorithms. The generated ciphertext is merged. These cipher-
text are downloaded from the cloud and decrypted. Decryption is a reversal of the encryp-
tion process. It gives better execution times. However, security is quite low.
Khedr et al. [29] proposed a cryptographic-accumulator provable data possession
(CAPDP) based scheme for DI in cloud storage. This suggested CAPDP is separated into
two stages: setup and proof generation-verification (PGV). It is based on a modified ver-
sion of RSA cryptography. A block generation technique is used to generate and store each
segment on the DO’s side. The DO challenges the CSP to use the proof generation tech-
nique to verify the integrity of outsourced data. They are then returned to the DO, who
uses them to run the block verification process to ensure the data’s integrity. This basic
CAPDP approach is used by all three algorithms for both static and dynamic data. Fur-
thermore, while the system reduces the stress and cost of the verification procedure on the
DO’s end, its efficiency is low.
Yu et al. [30] proposed quality-based cloud information to address the intricate key
administration in cloud information integrity checking. Initially, the clients transfer records
to the cloud through an attribute set and are checked by some specific auditor’s set of the
outsourced data. In this, a cloud client forwards his/her quality set to the key generation
community, KGC, to demand his/her private key. The cloud client preprocesses the docu-
ment by creating metadata for the record with his/her private key. Then, it transfers the
document along with the related metadata to the cloud, and erases the local copy of the
record. After accepting the review request, TPA and the cloud worker execute a response
protocol and, finally, check the stored file.
Li et al. [31] proposed an Integrity Chain protocol (ICP) based on a blockchain. The
suggested method is made up of two models: the system and security. In this system para-
digm, the DO keeps files on a blockchain network and periodically verifies the integrity
of the outsourced information. In the security model, the data stored on the peers in the
decentralized storage is checked and validated by a verifiable data possession protocol that
the real file is stored on. The host will be penalized if they DO want to retrieve the files
before the release transaction. When a host decides that it no longer wishes to outsource
storage space, it executes a deregistration transaction to deregister storage that is no longer
rented by a DO. This procedure is trustworthy and reliable.
From the literature review, it is concluded that with existing methods, an unauthorized
user can easily edit the data in the cloud without the knowledge of the DO and it takes
more computation time for the cryptography process. Furthermore, it is hard to create a
secure system in the cloud due to unauthorized users. Normally, the organization stores
sensitive data on the CS, which is managed by an untrusted third party because security
and privacy are the major problems in a CS environment. Even though CS is secured using
a third-party medium, there are possibilities of unsolved security issues. For authentica-
tion of data transactions in the barcode, OTP schemes are used, and in the barcode, the
memory is not enough to store user data. It is quite difficult to send OTP in offline mode,
which slows down the process. However, some trusted third-party organizations face data
processing issues, and once the trust is controlled by the hacker, the user will undoubtedly
suffer some loss. Due to these issues, it is necessary to develop a new security scheme that
provides both data confidentiality and data integrity.

13
An Improved RSA Technique with Efficient Data Integrity… 2435

3 Proposed IREA‑FCCF with 2LQR Scheme

The architecture of the proposed model is shown in Fig. 1. Storing data in a CE should
be secure and reliable; otherwise, confidentiality has to be compromised. It is a major
challenging task to construct a secure CS system. The user who needs to utilize the
Cloud Environment (CE) must enroll his fingerprint, username, password, and E-mail
ID. The biometric method is used for authentication. The authenticated client can
upload the encrypted file to the CSP. The client can retrieve the file with the knowl-
edge of the DO. The data encryption file is selected and encrypted using IREA. This
increases the security level, and also reduces the encryption time as well as decryp-
tion time over various file sizes compared to existing algorithms. Moreover, to enhance
authentication, a secure transaction 2LQR code is used. The data stored in the cloud by
the user should have DI and security, so we built an FCCF that allows the DO to Insert,
Delete, and Update (IDU) the records in the encrypted database utilzing the IDU algo-
rithm. Here, the DO alone decides whether to provide or reject the data for the client,
without the interference of the third-party system. This provides high security against
data loss caused by a hacker.

3.1 Registration Phase

In the registration phase, the biometric system is used for accessing the public cloud to
avoid unauthorized users. The fingerprint authentication method is used in the pro-
posed system for the authentication mechanism. The fingerprints are scanned using a

Registration Phase

ENCRYPTION User Authentication

(IRSA)

Data Confidentiality
User Authentication CSP

Data
Transaction
DATA OWNER

2LQR 2LQR

DECRYPTION
(IRSA)

CLIENT

Fig. 1  The architecture of the proposed IREA-FCCF with 2LQR scheme

13
2436 K. L. Neela, V. Kavitha

digital fingerprint scanner. This fingerprint is utilized in the CE to outsource the data. Even
though the fingerprint is the mechanism for authentication, the proposed system stores the
username, password, and e-mail ID of every customer along with the fingerprint. This is
an effective system with more security because only the authorized user can access the
CE. For uploading the file to the cloud, the fingerprint scanner scans the fingerprint of the
owner and transforms it into a hash value, and forwards it to the CSP for verification. The
CSP verifies these fingerprints with the previously stored hash value in the database. If it is
valid, then it allows the DO to upload the file. To avoid unauthorized access, the DO hides
the decryption key along with the hash code of the document in the 2LQR-code.

3.2 Improved RSA Encryption Algorithm (IREA) for Data Confidentiality

The input plain text messages are given to IREA. The problem is that the factorization
attack on the RSA Algorithm is based on e and j, which are the public keys used for encryp-
tion. So, the proposed IREA modifies the integer (e) and modulus (j) values for more secu-
rity. The original e & j value is hidden by the new public key (a, p). The key generation is
shown in Algorithm 1. Encryption and decryption are performed using the updated private
key. Algorithms 2 and 3 show the process of generating encryption and decryption. In the
decryption process, the ciphertext is decrypted using IREA. The final message is the origi-
nal input as entered by the DO.

Algorithm 1: IREA Key Generation Algorithm

IREA key generation

INPUT: Select two random prime numbers
OUTPUT: Find public and private keys
Begin procedure (b, v, j, p, and d)
Generate two large prime numbers, b and v
Compute modulus j,
j = b*v
Find j, φj . Evaluate phi φj = (b − 1) * (v − 1)

Select an integer e value as, b<e< φj and coprime φj and j

Calculate p=(e*2)+1
Select d value as the relation, demod j=1
Calculate a=j-1
The public key is {p, a}. The private key is {d, a }
End Procedure

In Algorithm 1, the two prime numbers are generated in the first step. Then, compute the
modulus and evaluate the values of phi j in steps 2 and 3. After that, select the e and d values
from steps 4 to 6. Next, calculate the values a using the modulus. In the final step, private and
public keys are generated.

13
An Improved RSA Technique with Efficient Data Integrity… 2437

Algorithm 2: IREA Encryption

INPUT: Public key, plain text, and modulus
OUTPUT: Cipher text
Begin Procedure (p, E, M, and a)
( p −1)
Encrypt , E = M 2 mod(a + 1)
End Procedure

In algorithm 2, the modified encryption key is generated. During the encryption process,
plain text is changed into encrypted text. Finally, the data is encrypted.

Algorithm 3: IREA Decryption Key

INPUT: Cipher text, public key and modulus
OUTPUT: Plain text
Begin procedure (D, E, d, and a)

Decrypt, D = E d mod(a + 1)
End procedure

In algorithm 3, the modified decrypted key is generated. The cipher text is converted
into plain text in decryption process. Finally, the data is decrypted. In the decryption pro-
cess, the ciphertext is decrypted using IREA. The final message is the original input as
entered by the DO. The IREA algorithm based on the public key and modulus is compared
with the RSA algorithm. This algorithm is also tested for encryption and decryption times
for various file sizes.

3.2.1 Numerical Example for IREA

Select two large prime numbers, b and v.

b = 5 and v = 11.
Then, compute the value of j and 𝜑j.
The value of j is computed by j = b ∗ v.
Now calculate the value of 𝜑j = (b − 1) ∗ (v − 1)
ϕj=4*10=40
Select an integer e value as, b < e < 𝜑j.
e = 13.
Now, evaluate the value of p = (e*2) + 1.
p = (13*2) + 1 = 27.

13
2438 K. L. Neela, V. Kavitha

Now calculate the d value using the relation (d *e) mod j = 1.

(d*13) mod 55 = 1.
d = 17.
Calculate a = j-1 = 54.
Send public key = {p, a} = {27, 54} and private key = {d, a} = {17, 54}.

3.2.1.1 Encryption Process Before sending the data, the sender encrypts the data using the
public key.
Let, m = 4

Encryption, E =M 13 mod ( 55)

= 413 mod ( 55) = 9

3.2.1.2 Decryption Process Now the receiver receives the data and performs the decryption
process using

Decryption, D =Ed mod (a + 1)

D = 917 mod (55) = 4

3.3 Flexible Capacity Cuckoo Filter for Data Integrity

Securing the data in the CE is critical. Hence, to protect the data items, verification of own-
ership is crucial. Here, we proposed the FCCF which verifies whether the element belongs
to the set or not. One Hash Table (HT) and two hash functions which are assumed as f1 (a)
& f2 (a) in this cuckoo filter. For instance, we consider the data as ‘a’ and index of the buck-
ets is calculated using Eq. (1) and Eq. (2).
f1 (a) = hash(a) (1)

f2 (a) = f1 (a) ⊕ hash(fingerprint) (2)

When a file is stored in the CE, the storage server in the cloud initializes the FCCF
along with the fingerprint of the data item. The fingerprint is stored in the HT of the
cuckoo according to the insertion algorithm that is shown in Algorithm 4. We can demon-
strate how it inserts the fingerprint into the HT. Consider that the HT has 2 buckets. If one
of the buckets is free, insert them in the other bucket. Otherwise, the item is removed from
the bucket and replaced with the pull-out item. The suggested filter’s key advantage is that
it avoids the false-positive ratio issue by allocating 2 double-sized HTs. These two tables
are denoted as fT0 and fT1. The size of these tables is given as N = fT . The FCCF for DI
consists of three phases. In the first phase, it computes fingerprints recognized in two ways
for verification and identification. Then it stores the fingerprints in an empty bucket. In the
process of verifying the fingerprint, an input fingerprint is compared with the registered
fingerprint of the particular user to find out whether they are the same finger match and
identified as the original. Next, in the lookup phase, verify the fingerprint with the existing
fingerprint. If it matches, it returns success or else failure. Then, in phase three, using the
private key, the signature is computed.

13
An Improved RSA Technique with Efficient Data Integrity… 2439

After initializing the FCCF, when the user tries to access the file, the CSP requests the
user to surrender the hash code of the particular file. Then it verifies it with the values in
the HT. Later, CSP dares users by requesting them to submit the tokens randomly to pro-
vide proof of the ownership of the file. Whenever a client needs to store a record, the hash
estimation of the document is assessed and sent to the server. The server states an FCCF of
a certain size. The fingerprints of the information item are determined based on the hash
of the information item. The two candidate buckets are distinguished and fingerprints are
put away in these candidate buckets. Besides other things, if there are crashes, the infor-
mation things put away in these areas are compelled to their substitute areas. The tradi-
tional cuckoo filter will not be able to avoid the CSP’s dishonesty. Often, the HTs occupy
more fingerprints and a few of them are kicked out one by one. So the False Positive Ratio
gets increased and there is a probability of kicking out one existing item, but the proposed
FCCF allocates two HTs which reduce the False Positive Ratio. Since the proposed method
has flexible capacity, when a collision occurs, the existing item is kicked out and the size of

13
2440 K. L. Neela, V. Kavitha

the HTs is doubled to store the item. As a result, the CSP is unable to respond to an unau-
thorized user.
In order to ensure proper verification, you must first enter the signatures of each record
into a database. Create an FCCF for each attribute to ensure the completeness of the CSP
verification. The DO records the encrypted databases R = (AV1 , AV2 , … AVn ) and then out-
sources them to the cloud. Each record uses Signature Generation (SG) for correctness
verification and to support completeness verification of each attribute built into the FCCF
(BF). The SG consists of the ciphertext and the signature of each element. The two HTs of
the FCCF data store each applicant bucket into two parts: The fingerprint f and the support
information (ctk0 ), (ctk1 ), (ctk2 ) by random number rk0 + rk1 − rk2 hold Eq. (3).

dec(ctk0 ) + dec(ctk1 ) − dec(ctk2 ) = ||nk (a)|| (3)

where nj (a) denoted total number of record attributes value, i.e., AVj = a belongs to the ith
record (1 ≤ i ≤ m) and to build FCCF, FCj for jth attributes is (1 ≤ j ≤ n). The DO encrypts
each record separately. Finally, the DO outsources the SG and build FCCF data is uploaded
to the CSP. In data retrieval, each authentication user sends the query to the CSP. The user
verifies the integrity of the CSP query result using correctness and completeness. The user
verifies the correctness of the query result using Eq. 4. If the outcomes are true, the user
decrypts the message and responds with a success or failure.
( n ) ( n
)
∑ ∑
e tagk , gen2 = e gen2 , dc hash1 (FP , fni , ctk1 , ctk2 , rc,k (4)
k=1 k=1

where gen1 and gen2 are the key generation of IREA to obtain public (a) and private key
(d), and fni is the file that is uploads to the cloud, and tagk is the tag of the ciphertext (ctk1,
ctk2). If that is correct, the result validates the query result’s completeness. For complete
verification, the fingerprint exists in the HT to generate auxiliary information by selecting
3 random numbers rk0, rk1, rk2. Verify that rk0 + rk1 − rk2 = |I|, The user decrypts and responds
as a success if the outcomes are right; otherwise, the user responds as a failure. Where, I
is the subgroup of M (i = 1, 2, 3… M), M is not query by an opponent. The IDU from the
encrypted database algorithm is stored in the DO flexible records. Algorithms 5 shows the
IDU record database.

13
An Improved RSA Technique with Efficient Data Integrity… 2441

Algorithm 5: IDU record database

// Insert a recorded database
for j=1: n do, 1 ≤ j ≤ n

(Cp j σ j , f j ) σj
Insert //The DO 1st Compute cipher text Cpi and signature , then calculate fingerprint

fj
Then, insert them into the SG and BF to update them.
End for
// Delete a recorded database
for j=1: n do, 1 ≤ j ≤ n

(Cp j σ j , f j ) σ fj
Delete //The DO 1st Compute Cp i and j , then calculate

Then, insert them into the SG and BF to update them.

End for
// Update a recorded database
For j=1: n do, 1 ≤ j ≤ n

(C j σ j , fj) σj 1
Update //The DO 1st Compute Cp i and , then calculate the new record f j .

1
After, the DO compute f j the old record, which is then send to the CSP

Then, insert them into the SG and BF to update them.

End for

3.4 Secure Data Transaction

A data transaction is granted by distributing the data to the authorized user, since the cloud
provider does not force the cloud user to fully trust the CSP. If the full charge of the out-
sourced data is controlled by the CSP, then they have to compromise data confidentiality,
so that in the proposed system, the user sends the request to the CSP but the DO has to
decide whether the data can be sent to the particular user or not. It does not depend on any
third-party service. This is accomplished by using the 2LQR code. It consists of two levels
of storage to avoid memorizing usernames and passwords, and can be utilized for data
authentication. It increases the security of users’ information and has the ability to correct
errors. The 2LQR code comprises timing examples, arrangement designs, and forms like
the QR code.. However, instead of black and white modules, the QR code has textured
modules, while the 2LQR code has textured modules. The process of reading QR codes is
not hampered by the substitution of black modules with textured modules. However, it ena-
bles us to have a 2nd storage level that is hidden from the QR code reader. On the 2nd
level, a private message is encoded utilizing a q-ary code (q ≥ 2) by error correcting capa-
bility. These textured patterns have unique characteristics and are used to store secret mes-
sages via the 2LQR code. The public message is given as input using the IREA algorithm

13
2442 K. L. Neela, V. Kavitha

that converts plain text information into ciphertext. Then the QR code for that text will be
generated. Then encoded private data (d, p) using IREA is represented in a polynomial
form. The polynomial form of form of the code word cp (x) = mp (x)g(x) is calculated and
denotes the code word c0(x). where, mp (x) is the messages are polynomial in form and g(x) is
p
the Polynomial factor is xn − 1. After that code words, c0(x) are generated and then scram-
p
bled using key K using cp = c0 , c1 , … cn−1. In the 2LQR code, the textures patterns are set
p p p

in position tags for private message sharing. Also, the position tag keeps unchanged black
modules for data authentication. Finally, the 2LQR code will be generated. Once the user
receives the 2LQR-code sent by the DO, the client uses the decryption key present in the
2LQR-code to decrypt the file for his usage. Hence, it provides efficient transaction mecha-
nisms in the CE.

4 Evaluating the Performance

In this section, we presented the performance assessment of our suggested approach

regarding communication costs, and the results are discussed. Before sending the files to
the CS, DO encrypt the files into ciphertext and signature. Then both the ciphertext and
signatures are sent to the CS. These ciphertext and signatures are verified and stored by
the CS. Later, for integrity and probabilistic verification, the DI auditing scheme, FCCF, is
used. The files are stored in the CSs using IDU processes, then the auditor chooses blocks
to verify the integrity without a third party. The average time for encryption, decryption,
SG, signature verification, and cost of data dynamics are evaluated and compared with the
traditional schemes such as RSA, ICP [22], 2PRDIC [12], CAPDP [20], VEA [11], and
EFH-CP-ABE [16].

4.1 Experimental Setup

To assess the efficacy of our proposed strategy, we utilized MATLAB, a free toolkit for
arbitrary programming, to run it on an Intel Core i7 processor with 4 GB of RAM. On the
Linux operating system, the test was conducted. We stimulate the cloud server by running
16.04 Ubuntu Server with 4 GB memory on an i7-6700 3.4 GHz CPU. We utilized 12.04
Ubuntu Desktop with 512 MB of RAM on a Virtual CPU running at 2.4 GHz for the client.
The file sizes vary from 256 and 8196 megabytes.

4.2 Comparison of IREA Algorithm

The IREA dependent on the public key and modulus contrasted with the RSA is shown in
Table 1.
The Table1 shows the results of RSA and IREA based on the modulus and the pub-
lic key. The IREA scheme showed that the proposed technique provides high security as
compared to existing RSA scheme. However, during the encryption stage, the factorization
attack may happen. This type of attack is the weakness of the RSA based on e & j. Due to
this characteristics, the RSA is less secure and has high time complexity. But the proposed
IREA modifies the original e & j value which is hidden by the new public key (a, p) for
more security. Therefore, the IREA will increase the security level and also reduces the
encryption and decryption time compared to RSA algorithm.

13
An Improved RSA Technique with Efficient Data Integrity… 2443

4.3 Comparison of Encryption Time and Decryption Time

The encryption and decryption times of different file sizes of the proposed IREA algo-
rithm compared to RSA, ICP [22], 2PRDIC [12], CAPDP [20], VEA [11], and EFH-
CP-ABE [16] are shown in Figs. 2 and 3. The time complexity of the proposed tech-
nique reveals how quickly it can encrypt and decrypt texts. The proposed method is
superior to the existing algorithms.
Figure 2 shows a graphical comparison of the suggested encryption time computed
against other algorithms in terms of time, demonstrating that our proposed scheme’s per-
formance is good. It also demonstrates that when the file size is large, the ICP scheme uses
more resources. We concluded that the proposed approach takes less time to encrypt than
other algorithms after comparing the various strategies.
Figure 3 shows that the proposed method takes a short time to encrypt data when com-
pared to RSA. Similarly, ICP, 2PRDIC, CAPDP, VEA, and EFH-CP-ABE schemes take
longer time to encrypt than RSA. But RSA takes longer time for encryption when com-
pared to IRSA. After examining the various methodologies, we have determined that IRSA
has the slowest decryption time when compared to other algorithms.

4.4 Signature Generation Verification

We use the signature to identify element retrieval in our scheme, which implies that the
retrieved elements are returned from the CSP and the signatures are checked using the
FCCF verification algorithm. The records in the database are encrypted by the DO one by
one, and then signatures are generated for each record by using SigGen. Their exactness
and fullness are efficiently verified by using SigGen. The proposed SG and verification
are compared with the existing schemes such as ICP [22], CAPDP [20], and VEA [11] are
shown in Figs. 4, 5.
The proposed signature generation and verification with their probabilistic on various
file sizes ranging from 0 to 1 GB with an increment of 256 MB and a fixed block size of
8 KB. By We determined that, as shown in Figs. 4 and 5, the existing scheme’s evidence
creation and verification time is much longer than the proposed scheme’s, as a result of
comparing findings for these different file sizes. Our scheme’s signature generation and
verification saves a significant amount of computational time.

4.5 Cost of Data Dynamics Records

In this research, we assessed the IDU tuple’s data dynamics records and compared them
to the ICP [22], 2PRDIC [12], CAPDP [20], and VEA [11] schemes. The graph plots the
types of data dynamics and the data dynamics time. Here, the tuple is a fixed number of 29.
Figure 6 depicts the IDU of our work’s cost in a dynamic data record. From the figure, we
analysis that the proposed method of IDU time of data dynamic is less compared to exist-
ing schemes.

13
2444 K. L. Neela, V. Kavitha

Table 1  Comparison result of modulus and public key

Prime num- RSA (n modulus) IREA (n-1 modulus) RSA (public key) IREA (public key)
bers/ Factori-
zation
a b

853 257 219,221 219,220 108,877 217,755

307 11 3377 3376 1493 2987
487 349 169,963 169,963 84,551 169,103
181 709 128,329 128,328 112,583 127,055
3077 3221 9,911,017 9,911,016 4,952,231 9,904,463

5 Conclusion

In this paper, we proposed the IREA with the FCCF auditing technique WTPA for a secure
CS environment without the use of a third-party system. In this proposed system, the DO
encrypts the data using IRSA and stores it in the CSP. It cannot retrieve the data from the
client without the knowledge of the DO. Furthermore, the FCCF ensures that its integrity
is verified. Secure data transactions can be provided by using the 2LQR code. The fin-
gerprint verification method is used between the sender and receiver to authenticate the
legitimate user to make the cloud environment more secure and safe. Furthermore, our pro-
posed scheme satisfies the requirements for correctness, completeness, privacy, verifica-
tion, dynamics, and security. The experimental results validate that the proposed IREA-
FCCF with the 2LQR technique for DS in a CE has less communication time compared to
that of the existing schemes. In the future, we will increase security and prevent attacks by
third parties.

Fig. 2  Encryption time com-

parison between proposed and
existing encryption schemes

13
An Improved RSA Technique with Efficient Data Integrity… 2445

Fig. 3  Decryption time com-

parison between proposed and
existing decryption schemes

Fig. 4  SG time comparison

13
2446 K. L. Neela, V. Kavitha

Fig. 5  Signature verification time

comparison

Fig. 6  Cost of data dynamics

records

Author Contributions All the authors have participated in writing the manuscript and have revised the final
version. All authors read and approved the final manuscript.

Funding There is no funding for this study.

Declarations
Conflict of interest Authors declare that they have no conflict of interest.

Ethical Approval This article does not contain any studies with human participants and/or animals performed
by any of the authors.

Informed Consent There is no informed consent for this study.

13
An Improved RSA Technique with Efficient Data Integrity… 2447

References
1. Garg, N., Bawa, S., & Kumar, N. (2020). An efficient data integrity auditing protocol for cloud com-
puting. Future Generation Computer Systems., 1(109), 306–316.
2. Chinnasamy, P., Padmavathi, S., Swathy, R., & Rakesh, S. (2021). Efficient data security using hybrid
cryptography on cloud computing. In G. Ranganathan, J. Chen, & Á. Rocha (Eds.), InInventive com-
munication and computational technologies (pp. 537–547). Springer.
3. Alsmadi, D., & Prybutok, V. (2018). Sharing and storage behavior via cloud computing: Security and
privacy in research and practice. Computers in Human Behavior, 85, 218–226.
4. Wei, P., Wang, D., Zhao, Y., Tyagi, S. K., & Kumar, N. (2020). Blockchain data-based cloud data
integrity protection mechanism. Future Generation Computer Systems., 1(102), 902–911.
5. Malik, A., & Om, H. (2018). Cloud computing and internet of things integration: architecture, applica-
tions, issues, and challenges. In W. Rivera (Ed.), Sustainable cloud and energy services (pp. 1–24).
Springer International Publishing.
6. Cheng, L., van Dongen, B. F., & van der Aalst, W. M. (2019). Scalable discovery of hybrid pro-
cess models in a cloud computing environment. IEEE Transactions on Services Computing, 13(2),
368–380.
7. Zhou, L., Li, X., Yeh, K. H., Su, C., & Chiu, W. (2019). Lightweight IoT-based authentication scheme
in cloud computing circumstance. Future Generation Computer Systems, 91, 244–251.
8. Amin, R., Kumar, N., Biswas, G. P., Iqbal, R., & Chang, V. (2018). A light weight authentication
protocol for IoT-enabled devices in distributed cloud computing environment. Future Generation Com-
puter Systems, 78, 1005–1019.
9. Ghallab, A., Saif, M. H., Mohsen, A. (2021). Data integrity and security in distributed cloud comput-
ing—a review. In: Proceedings of international conference on recent trends in machine learning, IOT,
smart cities and applications 2021 (pp. 767–784). Springer.
10. Megouache, L., Zitouni, A., & Djoudi, M. (2020). Ensuring user authentication and data integrity in
multi-cloud environment. Human-Centric Computing and Information Sciences, 10(1), 1–20.
11. Wang, Y., Miao, M., Shen, J., & Wang, J. (2019). Towards efficient privacy-preserving encrypted
image search in cloud computing. Soft Computing, 23(6), 2101–2112.
12. Namasudra, S., Devi, D., Kadry, S., Sundarasekar, R., & Shanthini, A. (2020). Towards DNA based
data security in the cloud computing environment. Computer Communications, 151, 539–547.
13. Tahir, M., Sardaraz, M., Mehmood, Z., & Muhammad, S. (2021). CryptoGA: A cryptosystem based on
genetic algorithm for cloud data security. Cluster Computing, 24(2), 739–752.
14. Akande, N. O., Abikoye, C. O., Adebiyi, M. O., Kayode, A. A., Adegun, A. A., & Ogundokun, R.
O. (2019). Electronic medical information encryption using modified blowfish algorithm. In: Interna-
tional conference on computational science and its applications, pp. 166–179.
15. Abroshan, H. (2021). A hybrid encryption solution to improve cloud computing security using sym-
metric and asymmetric cryptography algorithms. International Journal of Advanced Computer Sci-
ence and Applications. https://​doi.​org/​10.​14569/​IJACSA.​2021.​01206​04
16. Prakash, R., Chithaluru, P., Sharma, D., Srikanth, P. (2019). Implementation of trapdoor functionality
to two-layer encryption and decryption by using RSA-AES cryptography algorithms. In: Nanoelec-
tronics, circuits and communication systems, pp. 89-95.
17. Xiang, T., Li, X., Chen, F., Yang, Y., & Zhang, S. (2018). Achieving verifiable, dynamic and effi-
cient auditing for outsourced database in cloud. Journal of Parallel and Distributed Computing, 112,
97–107.
18. Zhao, Q., Chen, S., Liu, Z., Baker, T., & Zhang, Y. (2020). Blockchain-based privacy-preserving
remote data integrity checking scheme for IoT information systems. Information Processing & Man-
agement, 57(6), 102355.
19. Kumar, S., Karnani, G., Gaur, MS., Mishra, A. (2021). Cloud security using hybrid cryptography algo-
rithms. In: 2021 2nd International conference on intelligent engineering and management (ICIEM)
2021 Apr 28 (pp. 599–604). IEEE.
20. Dhamodaran, M., Punarselvam, E., Varshan, S. D., Kumar, P. D., Saravanan, C., Prathap, K. (2021).
Security and privacy of sensitive data in cloud computing using RSA. International Journal of Scien-
tific Research in Science and Technology, 657–661.
21. Abid, R., Iwendi, C., Javed, A. R., Rizwan, M., Jalil, Z., Anajemba, J. H., & Biamba, C. (2021). An
optimised homomorphic CRT-RSA algorithm for secure and efficient communication. Personal and
Ubiquitous Computing., 1, 1–4.
22 Goyal, V., & Kant, C. (2018). An effective hybrid encryption algorithm for ensuring cloud data
security. In V. B. Aggarwal, V. Bhatnagar, & D. K. Mishra (Eds.), Big data analytics (pp. 195–210).
Springer.

13
2448 K. L. Neela, V. Kavitha

23. Lee, B. H., Dewi, E. K., & Wajdi, M. F. (2018). Data security in cloud computing using AES under
HEROKU cloud. In: 2018 27th wireless and optical communication conference (WOCC), pp. 1–5.
24. Yang, Y., Chen, X., Chen, H., & Du, X. (2018). Improving privacy and security in decentralizing
multi-authority attribute-based encryption in cloud computing. IEEE Access, 6, 18009–18021.
25. Li, J., Chen, N., & Zhang, Y. (2019). Extended file hierarchy access control scheme with attribute
based encryption in cloud computing. IEEE Transactions on Emerging Topics in Computing.
26. Sharma, G., & Kalra, S. (2018). Identity based secure authentication scheme based on quantum key
distribution for cloud computing. Peer-to-Peer networking and applications, 11(2), 220–234.
27. Wu, L., Chen, B., Zeadally, S., & He, D. (2018). An efficient and secure searchable public key encryp-
tion scheme with privacy protection for cloud storage. Soft Computing, 22(23), 7685–7696.
28. Sharma, S., Singla, K., Rathee, G., & Saini, H. (2020). A hybrid cryptographic technique for file stor-
age mechanism over cloud. In: First international conference on sustainable technologies for computa-
tional intelligence (pp. 241–256).
29. Khedr, W. I., Khater, H. M., & Mohamed, E. R. (2019). Cryptographic accumulator-based scheme for
critical data integrity verification in cloud storage. IEEE Access, 7, 65635–65651.
30. Yu, Y., Li, Y., Yang, B., Susilo, W., Yang, G., & Bai, J. (2017). Attribute-based cloud data integrity
auditing for secure outsourced storage. IEEE Transactions on Emerging Topics in Computing, 8(2),
377–390.
31. Li, Y., Yu, Y., Chen, R., Du, X., & Guizani, M. (2020). integritychain: Provable data possession for
decentralized storage. IEEE Journal on Selected Areas in Communications, 38(6), 1205–1217.

Publisher’s Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and
institutional affiliations.

K. L. Neela received her B.E. degree in Computer Science and Engi-

neering in 2006 from the Oxford Engineering College, Trichy and
Master’s degree in Computer Science and Engineering in 2008 from
J.J. college of Engineering and Technology, Trichy. She received Ph.D.
degree in Computer Science and Engineering from Anna University,
Chennai. Presently, she is working as Assistant Professor in University
College of Engineering, Thirukkuvalai, Tamil Nadu, India. She has
more than 10 years of teaching experience. She has published more
than 10 International journals in areas such as Network Security and
Cloud Computing. She has attended 5 different FDP to enrich her
career.

V. Kavitha obtained her B.E degree in Computer Science and Engi-

neering in 1996 from the Norrul Islam College of and ME degree in
Computer Science and Engineering in 2000 from Mepco Schlenk
Engineering College. She received Ph.D. degree in Computer Science
and Engineering from Anna University, Chennai in the year 2009.
Right from 1996, she is in the Department of Computer Science &
Engineering under various designations.Presently she is working as
Associate Prof in the Department of CSE at University College of
Engineering, Kancheepuram, Tamil Nadu, India. Currently, under her
guidance twelve research scholars are pursuing Ph.D. as full time and
part time. Her research interests are Wireless networks, Mobile Com-
puting, Network Security, Wireless Sensor Networks, Image Process-
ing; Cloud Computing. She has published 5 National journal and 30
International journals in areas such as Network security, Mobile Com-
puting, wireless network security, and Cloud Computing.

13
Wireless Personal Communications is a copyright of Springer, 2022. All Rights Reserved.