IJRECS @ Feb – Mar 2018, V-10, I-9
ISSN-2321-5485(Online)
A Novel Mechanism for Searching Keyword in Cloud by Using
Dual-Server Public-Key Encryption
P. Divya Kalyani1, P. Shravya2, K. Sahas3, B. Raj Kumar4, A. Ranga Pavani5
1,2,3,4
B.Tech, Dept of CSE, St. Martin’s Engineering College, Dhulapally, Hyderabad
5
Assistant Professor, Dept of CSE, St. Martin’s Engineering College, Dhulapally, Hyderabad
Abstract: Searchable encryption is of extending
enthusiasm for guaranteeing the data insurance in
secure searchable distributed storage. In this work, we
research the security of outstanding cryptographic
crude, to be particular Public Key Encryption with
Keyword Search (PEKS). In existing, Rongmao Chen
and Yi Mu formalized a Public Key Encryption with
Keyword Search (PEKS) structure named Dual Server
Public Key Encryption with Keyword Search
(DSPEKS) to address the security shortcoming of
PEKS. Lamentably, it has been shown that the said
work can't works splendidly on Query Complexity,
(for instance, encoded multi-keyword search) and
gives less security. To deal with the Query Complexity
issue, we proposed a novel Dual-Server Hybrid Key
Encryption with Multi Keyword Search Scheme for
secure disseminated stockpiling. For greater security,
we propose crossbreed encryption. Crossbreed
encryption is a technique for encryption that
associations no less than two encryption structures. It
combines a mix of digressed and symmetric
encryption to benefit by the characteristics of each
kind of encryption. These characteristics are
individually portrayed as speed and greater security.
To also improve the present tackles chasing, a basic
and main limit is to enable the multi-watchword look
with the broad method of reasoning activities, i.e., the
"AND", "OR" and "NO" tasks of catchphrases. This is
key for chase customers to prune the looking for space
and quickly perceive the desired data. By
examinations we show that proposed approach in
perspective of twofold server creamer key encryption
beats existing DSPEKS plot it terms of security and
straightforwardness of supporting multi watch word
look for.
Keywords: Multiple Keyword search, Hybrid
encryption.
I. INTRODUCTION
2936 www.ijrecs.com
ISSN-2321-5784 (Print)
Cloud stockpiling outsourcing has transformed into an
outstanding application for tries and relationship to
diminish the heaviness of keeping up colossal
information starting late. Regardless, truth be told, end
customers may not by any extend of the creative
ability trust the cloud limit servers and might need to
scramble their information some time as of late
exchanging them to the cloud server in order to secure
the information insurance. This when in doubt
influences the information to utilize more troublesome
than the customary storing where information is kept
in the nonappearance of encryption. One of the regular
game plans is the searchable encryption which allows
the customer to recuperate the mixed records that
contain the customer showed catchphrases, where
given the watchword trapdoor, the server can find the
information required by the customer without
unscrambling.
Searchable encryption can be recognized in either
symmetric then again amiss encryption setting. In [2],
Song et al. proposed watchword look for on
ciphertext, known as Searchable Symmetric
Encryption (SSE) and a brief span later a couple of
SSE designs [3], [4] were expected for changes.
Despite the way that SSE designs acknowledge high
profitability, they encounter the evil impacts of
convoluted secret key dissemination. Accurately,
customers need to securely share secret keys which are
used for information encryption. Else they are not
prepared to share the encoded information outsourced
to the cloud. To decide this issue, Boneh et al. [5]
introduced a more versatile crude, to be particular
Public Key Encryption with Keyword Search (PEKS)
that enables a customer to look encoded information in
the veered off encryption setting. In a PEKS structure,
using the recipient's open key, the sender annexes
some encoded watchwords (implied as PEKS figure
writings) with the encoded information. The authority
IJRECS @ Feb – Mar 2018, V-10, I-9
ISSN-2321-5485(Online)
by then sends the trapdoor of a to-be-looked
catchphrase to the server for information looking.
Given the trapdoor and the PEKS figure message, the
server can test whether the watchword shrouded the
PEKS figure content is equal to the one picked by the
gatherer. Given this is valid, the server sends the
planning mixed information to the authority.
Utilizing circulated computing, individuals can store
their information on remote servers and allow
information access to open customers through the
cloud servers. As the outsourced information are most
likely going to contain sensitive security information,
they are regularly encoded before exchanged to the
cloud. This, in any case, by and large limits the
usability of outsourced information in light of the
inconvenience of investigating the encoded
information. In this work, we investigate the security
of an exceptional cryptographic crude, specifically
Public Key Encryption with Keyword Search (PEKS)
which is to a great degree significant in various uses of
disseminated stockpiling. Tragically, it has been
shown that the regular PEKS framework encounters an
inalienable delicacy called inside Keyword Guessing
Attack (KGA) impelled by the poisonous server. To
address this security frailty, we require another PEKS
framework.
PEKS designs encounter the evil impacts of a
trademark vulnerability regarding the trapdoor
catchphrase security, to be particular inside Keyword
Guessing Attack (KGA). The reason provoking to
such a security frailty is, to the point that any
individual who knows gatherer's open key can deliver
the PEKS ciphertext of self-confident watchword
himself. In particular, given a trapdoor, the hostile
server can pick a theorizing watchword from the
catchphrase space and after that use the catchphrase to
deliver a PEKS ciphertext. The server at that point can
test whether the hypothesizing watchword is the one
essential the trapdoor. This guessing then-testing
technique can be reiterated until the point when the
correct catchphrase is found. Such a hypothesizing
ambush has furthermore been considered in various
mystery key based structures. In any case, the attack
can be moved more successfully against PEKS designs
since the watchword space is for the most part the
2937 www.ijrecs.com
ISSN-2321-5784 (Print)
same as a commonplace dictionary (e.g., all the
essential English words), which has a significantly
humbler size than a mystery word reference (e.g., each
one of the words containing 6 alphanumeric
characters). It is essential that in SSE designs, just
puzzle key holders can make the catchphrase
ciphertext and subsequently the not well arranged
server isn't prepared to dispatch inside KGA. As the
watchword reliably demonstrates the assurance of the
customer information, it is thusly of practical
criticalness to crush this security hazard for secure
searchable mixed information outsourcing.
Searchable encryption can be recognized in either
symmetric or astray encryption setting. Tune et al.
proposed watchword look for on ciphertext, known as
Searchable Symmetric Encryption (SSE) and a brief
timeframe later a couple of SSE designs were planned
for changes. Despite the fact that SSE designs
acknowledge high efficiency, they encounter the evil
impacts of ensnared secret key dissemination.
Effectively, customers need to securely share riddle
keys which are used for information encryption. Else
they are not prepared to share the encoded information
outsourced to the cloud. To determine this issue,
Boneh et al. displayed a more versatile crude, to be
particular Public Key Encryption with Keyword
Search (PEKS) that engages a customer to look for
mixed information in the hilter kilter encryption
setting. In a PEKS structure, using the beneficiary's
open key, the sender annexes some mixed
catchphrases (suggested as PEKS ciphertexts) with the
encoded information. The beneficiary at that point
sends the trapdoor of a to-be-chase watchword to the
server down information looking. Given the trapdoor
and the PEKS ciphertext, the server can test whether
the catchphrase crucial the PEKS ciphertxt is
proportionate to the one picked by the gatherer. Given
this is valid, the server sends the planning mixed
information to the beneficiary.
II. LITERATURE SURVEY
R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu [1], "An
investigation on Order-protecting encryption for
numeric information ", proposed On Cloud to secure
User's fragile information Encryption is outstanding
IJRECS @ Feb – Mar 2018, V-10, I-9
ISSN-2321-5485(Online)
amongst other framework. Regardless, performing
look for over such encoded database has constantly
been a trying task in composing. So Author's
accessible a demand securing encryption plan named
as OPES for numeric information that grants request
with relationship chairmen to be direct associated with
encoded numeric areas. Question happens neither
contain any false positive nor miss any answer tuple.
The predefined design handles updates easily without
initiating changes in the encryption of various
characteristics.
D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G.
Persiano [2] A Public key encryption with keyword
search has suggested that Searchable symmetric
encryption (SSE) allows a social event to outsource
the limit of his information to another get-together
privaty, while keeping up the ability to explicitly
investigate it. This issue has been the grouping of
dynamic research and a couple of security definitions
and improvements have been proposed. Regardless of
the way that SSE designs acknowledge high adequacy,
they encounter the evil impacts of confounded riddle
key dispersal. Unquestionably, customers need to
securely share puzzle keys which are used for
information encryption. Else they are not prepared to
share the mixed information outsourced to the cloud.
To decide this issue, Boneh l. exhibited a more
versatile crude, to be particular Public Key Encryption
with Keyword Search (PEKS) that engages a customer
to look mixed information in the upside down
encryption setting. In a PEKS system, using the
beneficiary's open key, the sender joins some mixed
watchwords (suggested as PEKS figure works) with
the encoded information. The authority at that point
sends the trapdoor of a to-be-chase watchword to the
server down information chasing. Given the trapdoor
and the PEKS figure message, the server can test
whether the catchphrase shrouded the PEKS figure
content is comparable to the one picked by the
authority. Expecting this is the situation, the server
sends the organizing encoded information to the
beneficiary.
M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T.
Kohno, T. Lange, J. Malone-Lee, G. Neven, P.
Paillier, and H. Shi et al., [3] proposed "A Searchable
2938 www.ijrecs.com
ISSN-2321-5784 (Print)
encryption returned to: Consistency properties,
connection to unknown ibe, and augmentations"
demonstrates Creator's formalized mysterious IBE
(AIBE) and showed a non particular advancement of
searchable encryption from AIBE. They in like
manner showed to trade a various leveled IBE (HIBE)
plot into an open key encryption with transitory
keyword search (PETKS) where the trapdoor is simply
real in a specific time between time.
J. Baek, R. Safavi-Naini, and W. Susilo [4], "A Public
key encryption with keyword search returned to ", It
recommends that The principal PEKS plot requires a
secured channel to transmit the trapdoors. To beat this
limitation, Author's proposed another PEKS plot
without requiring a sheltered channel, which is
implied as a safe sans channel PEKS (SCF-PEKS).
The musing is to incorporate the server's open/private
key join into a PEKS system. The catchphrase figure
substance and trapdoor are delivered using the server's
open key and along these lines only the server (doled
out analyzer) can play out the interest. New PEKS plot
determined as SCF-PEKS don't requires an ensured
channel to transmit trapdoor as in customary PEKS. In
this Mentioned plan the attacker is allowed to get the
connection between the non-challenge figure
compositions and the trapdoor. Outside enemies can
get the trapdoors sent in an open channel can reveal
the encoded watchwords through separated
catchphrase conjecturing attacks and they can perform
detached watchword theorizing ambushes against the
said (SCF-PEKS) plans.
According to R. Cramer and V. Shoup et al., [5] "A
Universal hash proofs and a worldview for versatile
picked ciphertext secure open key encryption" In this
paper Authors proposes smooth projective hash work
(SPHF). Numerous arrangement in composing ends up
being viable against adaptable Chosen figure content
attack however every one of them require a trusted
untouchable commitment amid the time spent
customer enlistment for both sender and beneficiary.
Makers at that point propose a practical plot that can
be exhibited secure against flexible picked figure
content strike under a sensible stubbornness
supposition is smooth projective hash work (SPHF)
that of Cramer and Shoup. This arrangement relies
IJRECS @ Feb – Mar 2018, V-10, I-9
ISSN-2321-5485(Online)
upon Paillier's Decision Composite Residuosity
(DCR) doubt [P], while another is arranged in the built
up Quadratic Residuosity (QR) assumption.
III. PROPOSED SYSTEM
Utilizing disseminated computing, individuals can
store their information on remote servers and allow
information access to open customers through the
cloud servers. As the outsourced information are most
likely going to contain delicate insurance information,
they are typically encoded before exchanged to the
cloud. This, in any case, inside and out limits the
usability of outsourced information as a result of the
inconvenience of investigating the encoded
information. In this work, we investigate the security
of an extraordinary cryptographic crude, specifically
Public Key Encryption with Keyword Search (PEKS)
which is to a great degree profitable in various uses of
conveyed stockpiling. Tragically, it has been shown
that the regular PEKS framework encounters a
characteristic feebleness called inside Keyword
Guessing Attack (KGA) impelled by the harmful
server. To address this security frailty, we require
another PEKS framework.
Searchable encryption can be recognized in either
symmetric or amiss encryption setting. Tune et al.
proposed watchword look for on figure content,
known as Searchable Symmetric Encryption (SSE)
and a brief span later a couple of SSE designs were
planned for changes. In spite of the fact that SSE
designs acknowledge high profitability, they encounter
the evil impacts of ensnared puzzle key flow.
Effectively, customers need to securely share secret
keys which are used for information encryption. Else
they are not prepared to share the encoded information
outsourced to the cloud. To determine this issue,
Boneh et al. displayed more versatile crude, to be
particular Public Key Encryption with Keyword
Search (PEKS) that engages a customer to look for
mixed information in the hilter kilter encryption
setting. In a PEKS system, using the beneficiary's
open key, the sender adds some mixed catchphrases
(suggested as PEKS figure writings) with the encoded
information. The beneficiary at that point sends the
trapdoor of a to-be-chase watchword to the server
2939 www.ijrecs.com
ISSN-2321-5784 (Print)
down information looking. Given the trapdoor and the
PEKS figure message, the server can test whether the
catchphrase central the PEKS figure content is
proportionate to the one picked by the authority. Given
this is valid, the server sends the organizing mixed
information to the beneficiary.
Figure.1. System Architecture
The information proprietor outsources her information
to the cloud for favorable and trustworthy information
access to the relating look customers. To guarantee the
information security, the information proprietor
encodes the main information through symmetric with
open key encryption at that point create a hash
signature using Smooth Projective Hash Functions
(SPHFs). To upgrade the chase efficiency, the
information proprietor makes a couple of watchwords
for each outsourced record. The looking at document
is then made by watchwords and a riddle key. From
that point onward, the information proprietor sends the
mixed files with hash imprints to back server and the
contrasting documents with the front server, and sends
the symmetric key, puzzle and private key to interest
customers. A chase customer request the outsourced
reports from the cloud server with taking after three
phases. In any case, the chase customer gets all the
symmetric key, puzzle key and private key from the
information proprietor. Second, according to the chase
catchphrases, the interest customer uses the riddle key
to create trapdoor and sends it to the front server.
Exactly when a request customer sends a watchword
trapdoor to the front server, it would isolate a social
event of organizing documents in light of particular
tasks. At last, she gets the organizing record gathering
IJRECS @ Feb – Mar 2018, V-10, I-9
ISSN-2321-5485(Online)
from the cloud server and deciphers them with the
symmetric and private keys. Finally it makes another
hash signature for decoded report. By then organized
both hash marks are proportional or not. If both are
identical, report is ensured. By and large are not
secured.
A. Design Considerations:
 Before requesting for upload owner must have
generated Private Key.
 Trapdoor is generated using the secret key.
 Decrypt the document only if Keys provided
is satisfied with set of documents.
B. Description of the Proposed Algorithm:
Anonymization / encrypt and upload
Encrypt Document based on Symmetric Key (AES
Encryption) --> Cipher text and generate hash
signature using
Smooth Projective Hash Functions (SPHFs). Encrypt
that Cipher text once again based on Public Key (RSA
Encryption) --> Ciphertext1
Encrypt Keywords based on Secret Key --> index
Encrypt that index once again based on Data Owner
Identity (Identity Based Encryption) --> Encrypted
Index
Duplication check to reduce data on cloud storage
eliminating duplicate copies of repeating data
Search user:
Encrypt Search Keywords based on Secret Key -->
trapdoor
Encrypt that trapdoor once again based on Data Owner
Identity (Identity Based Encryption) --> Encrypted
trapdoor
Send Encrypted trapdoor with any one Operation
(AND, OR, NO) to front Server. Now front server
match the trapdoor to all indexes and find the matched
document
2940 www.ijrecs.com
ISSN-2321-5784 (Print)
Then Retrieve the matched encrypted document
collections with hash signature from back server and
forward to user.
Encrypted Documents (Ciphertext1) --> Decrypt that
C1 based on Private Key (RSA Decryption) --> Cipher
text
The information proprietor outsources her information
to the cloud for profitable and trustworthy information
access to the relating look customers. To guarantee the
information security, the information proprietor
encodes the main information through symmetric with
open key encryption at that point deliver a hash
signature using Smooth Projective Hash Functions
(SPHFs). To upgrade the chase profitability, the
information proprietor makes a couple of watchwords
for each outsourced record. The contrasting record is
then made by watchwords and a puzzle key. From that
point forward, the information proprietor sends the
mixed documents with hash imprints to back server
and the contrasting records with the front server, and
sends the symmetric key, secret and private key to
interest customers. A chase customer request the
outsourced reports from the cloud server with taking
after three phases. In any case, the chase customer gets
all the symmetric key, secret key and private key from
the information proprietor. Second, according to the
chase catchphrases, the interest customer uses the
riddle key to deliver trapdoor and sends it to the front
server. Exactly when a request customer sends a
watchword trapdoor to the front server, it would
isolate a social occasion of planning documents in
light of particular activities. Eventually, she gets the
planning record gathering from the cloud server and
translates them with the symmetric and private keys.
Finally it makes another hash signature for decoded
report. By then planned both hash marks are
proportionate or not. If both are proportional, report is
secured. For the most part are not ensured.
IV. PSEUDO CODE
The Pseudo code for the system is as follows:
Step 1) Register
Step 2) Login
IJRECS @ Feb – Mar 2018, V-10, I-9
ISSN-2321-5485(Online)
Step 3) Symmetric Key (AES), Secret Key (DES),
Public and Private Key Generation
Step 4) Enter Document name and contents of
Document
Step 5) Enter Some Keywords about Document
Step 6) Encrypt Document based on Symmetric Key
(AES Encryption) --> Ciphertext and generate hash
signature using Smooth Projective Hash Functions
(SPHFs). Encrypt that Ciphertext once again based on
Public Key (RSA Encryption) --> Ciphertext1
Step 7) Encrypt Keywords based on Secret Key -->
index. Encrypt that index once again based on Data
Owner Identity (Identity Based Encryption) -->
Encrypted Index
Step 8) Upload Ciphertext1 with hash signature to
back server and Encrypted Index to front Server
Step 9) Send Symmetric, Secret and Private Keys to
Authenticated Search Users
V. CONCLUSION
In this paper, we proposed another structure, Dual-
Server Hybrid Key Encryption with Multi Keyword
Search Scheme for secure cloud stockpiling
(DSPEKS), that can handle the Query Complexity
issue of existing DSPEKS system. We likewise
presented another Smooth Projective Hash Function
(SPHF) and utilized it to develop a bland DSPEKS
conspire. An effective instantiation of the new SPHF
in view of the Diffie-Hellman issue is additionally
displayed in the paper, which gives a productive DS-
PEKS plot without pairings. Our system planned right
now secures information transmission and enables
information proprietor to search utilizing numerous
keyword search utilizing different rationale tasks as
like AND, OR, NOT. In future we intend to address a
similar issue in to work for multi cloud condition.
REFERENCES
1. R. Chen, Y. Mu, G. Yang, F. Guo, and X. Wang, “A
new general framework for secure public key
2941 www.ijrecs.com
ISSN-2321-5784 (Print)
encryption with keyword search,” in Information
Security and Privacy - 20th Australasian Conference,
ACISP, pp. 59–76, 2015.
2. D. X. Song, D. Wagner, and A. Perrig, “Practical
techniques for searches on encrypted data,” in IEEE
Symposium on Security and Privacy, pp. 44–55, 2000.
3. R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu,
“Order-preserving encryption for numeric data,” in
Proceedings of the ACM SIGMOD International
Conference on Management of Data, pp. 563–574,
2004.
4. R. Curtmola, J. A. Garay, S. Kamara, and R.
Ostrovsky, “Searchable symmetric encryption:
improved definitions and efficient constructions,” in
Proceedings of the 13th ACM Conference on
Computer and Communications Security, CCS 2006,
pp. 79–88 , 2006.
5. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G.
Persiano, “Public key encryption with keyword
search,” in EUROCRYPT, pp. 506–522 , 2004.
6. R. Gennaro and Y. Lindell, “A framework for
password-based authenticated key exchange,” in
EUROCRYPT, pp. 524–543, 2003.
7. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T.
Kohno, T. Lange, J. Malone-Lee, G. Neven, P.
Paillier, and H. Shi, “Searchable encryption revisited:
Consistency properties, relation to anonymous ibe, and
extensions,” in CRYPTO, pp. 205–222, 2005.
8. D. Khader, “Public key encryption with keyword
search based on k-resilient IBE,” in Computational
Science and Its Applications - ICCSA, pp. 298–308,
2006.
9. P. Xu, H. Jin, Q. Wu, and W. Wang, “Public-key
encryption with fuzzy keyword search: A provably
secure scheme under keyword guessing attack,” IEEE
Trans. Computers, vol. 62, no. 11, pp. 2266– 2277,
2013.