View
221
Download
0
Category
Preview:
Citation preview
7/25/2019 IEEEE project
1/20
GENERATING SEARCHABLE PUBLIC-KEY CIPHERTEXTS WITH HIDDENSTRUCTURES FOR FAST KEYWORD SEARCH
BACHELOR OF TECHNOLOGYIN
COMPUTER SCIENCE AND ENGINEERING
Submitted by
P. Prasanthi (12BF1A0579)
S. Harshavardhan Reddy (12BF1A05A9)
R. Siddharth Ghosh (12BF1A0597)
P. Rajendra (12BF1A0684)
Under the esteemed guidance of
N P!"#$%"'
A*#$* P"+,-+"
SRI .EN/ATESARA COLLEGE OF ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
(A"+-% 3 AICTE' N- D-& A,,#*-% *+ NTUA' A$#$*#!")
O LIC T"#$$ C-$*-"' /#"#:#;3#% "+#%' T"!#*
7/25/2019 IEEEE project
2/20
ABSTRACT Existing secure public-key searchable encryption schemes
take time linear with the total number of the cipher texts.
Searchable Public-Key Cipher texts with Hidden StructuresSPCHS! for keyword search as fast as possible withouta"ecting the semantic security of the encrypted
keywords. #n SPCHS$ all keyword-searchable ciphertexts are
structured by hidden relations$ and with the searchtrapdoor corresponding to a keyword.
%e construct a SPCHS scheme from scratch in which thecipher texts ha&e a hidden star-like structure.
'he search complexity of our scheme is dependent on theactual number of the cipher texts containing the (ueriedkeyword$ rather than the number of all cipher texts.
7/25/2019 IEEEE project
3/20
EXISTINGSYSTEM
Search for encrypted keywords are as e)cient asthe search for unencrypted keywords.
#n existing scheme retrie&ing the cipher textcontaining a gi&en keyword can be time linearwith the total number of all cipher texts.
'his is reasonable because the encryptedkeywords can form a tree-like structure whenstored according to their binary &alues.
'his makes retrie&al from large-scale databasesalmost impossible.
7/25/2019 IEEEE project
4/20
DISADVANTA
GES Keyword pri&acy can be guaranteed only for
keywords that are a priori hard to guess.
*o Scalability
7/25/2019 IEEEE project
5/20
PROPOSEDSYSTEM
Searchable Public-Key Cipher texts with HiddenStructures SPCHS! for keyword search as fast aspossible without sacri+cing semantic security of the
encrypted keywords.
#n SPCHS$ all keyword-searchable cipher texts arestructured by hidden relations$ and with the searchtrapdoor corresponding to a keyword$ the minimuminformation of the relations is exposed to a search
algorithm as the guidance to +nd all matching
cipher texts e)ciently. Proposed to encrypt structured data and a secure
method to search these data.
7/25/2019 IEEEE project
6/20
ADVANTAG
ES Has the ad&antage that anyone who knows the
recei&er,s public key can upload keyword-searchable cipher texts to a ser&er.
ast and e)cient Searching ore secure.
7/25/2019 IEEEE project
7/20
Hardware & !"#ware re$%re'e(#
7/25/2019 IEEEE project
8/20
HARDWARE RE)UIREMENTS
Processor - #ntel #/
Speed - 0gh1 or higher
23 - 0gb or higher
Storage 4isk - 566 gb higher
7/25/2019 IEEEE project
9/20
SOFTWARE
RE)UIREMENTS Platform 7 %indows 8
Programming En&ironment 7 93:3$*etbeans
Ser&er side Script 7 9a&aSer&er Pages.
;ackend 7
7/25/2019 IEEEE project
10/20
CLASSDIAGRAM
Uer
=uid7 integer
=uname7 String
=eid7 String=address7 String
=sign#n!=signect#d7 integer
=class#d7 integer
=homomorphicEncryption!=sort!
=search!=crypt!
E+e'e(#
=element#d7 integer=url7 String=+le*ame7 String
=si1e7 integer
=keyword7 String
=upload!=read!
=&iew!
Re+a#&!(*&,
=(uery7 String=elements7 integer
=weights7 integer
)%er
=user7 String=session#d7 String=(uery7 String
=issue?uery!
C+a&./a#&!(
=keyword7 String
=url7 String
=score7 integer
=+nd!
=process!
=sort!=display!
=@
=0
@
=@
=0
7/25/2019 IEEEE project
11/20
OB0ECTDIAGRAM
Lee1 M&(2%
=ob>ect#d7 AAAA=class#d7 0000
Uer
=uid7 06B=uname7 syam=eid7 syamgmail.com=address7 tpt
Bae1 Ra(2!%(3
=element#d7 066=url7 http7DDlocalhost=+lename7 document=si1e7 6=keyword7 hai
0%(31 Y!!(#ae=(uery7 lllll=elements7 0666=weights7 06
K&'1 H%(!!=user7 xxxx=session#d7 06=(uery7 llll
K&'1 0 e!(3&+
=keyword7 hai=url7 http7FFlocalhost=score7 /
=0
@
=@
=0
=@
=0
GserHash'ree
Elements
?ueryClassi+cation
2elationships
7/25/2019 IEEEE project
12/20
USECASEDIAGRAM
Uer
&3(I(
e(/r,#E+e'e(#
e(/r,#Kew!rd
.(dKew!rdE+e'e(#Re+a#&!(*&,
/+a&./a#&!(
3&4e()%er
read)%erS#e'
.(dWe&3*#
re#r&e4eRe+a#&!(*&,
.(dS/!re
!r#&(3
.(dK-(eare#Ne&3*5!%r
re%+#
7/25/2019 IEEEE project
13/20
INTERACTION DIAGRAM
67 Se$%e(/e Da3ra'87 C!++a5!ra#!( Da3ra'
7/25/2019 IEEEE project
14/20
SE)UENCEDIAGRAM
Gser System Hash'ree 4ataect ?uery Classi+cation 2elationships
0 7 sign#n!
B 7 encryptElement!
5 7 encryptKeyword!
7 +ndKeywordElements2elationships!
/ 7 Classi+cation!
I 7 gi&en?uery!
8 7 read?uery!
A 7 +nd%eights!
7 retrie&e2elationships!
06 7 +ndScore!
00 7 sorting!
0B 7 +ndk-nearest*eighbour!
05 7 2esult!
7/25/2019 IEEEE project
15/20
COLLABORATION
DIAGRAM
Gser System
Hash'ree
2elationships
?uery
Classi+cation
0 7 sign#n!
B 7 encryptElement!
5 7 encryptKeyword!
7 +ndKeywordElement2elationships!
/ 7 classi+cation!
I 7 gi&en?uery!
8 7 read?uery!
A 7 +nd%eights!
7 retrie&e2elationships!
06 7 +ndScore!
00 7 +ndK-nearest*eighbour!0B 7 result!
7/25/2019 IEEEE project
16/20
ACTIVITY DIAGRAMGser System
sign#n
#nitial State
encrypt Element
encrypt Keyword
+nd Keyword and Element 2elationship
classi+cationgi&en (uery
read (uery
+nd weights
retrie&e relationships
+nd score
+nd sorting
+nd k-nearest neighbourresult
'ermination State
7/25/2019 IEEEE project
17/20
STATECHARTDIAGRAM
Gser Sign in
#nitial State
System encrypt keyword and element
+nd keyword and element relationships
classi+cation
user gi&en (uery
system read (uery
+nd weights
retrie&e relationships
+nd score
+nd sorting
+nd k-nearest neighbour
result
'ermination State
7/25/2019 IEEEE project
18/20
COMPONENT
DIAGRAMUer
JJcomponentKKHa*Tree
JJcomponetKK
E+e'e(#
JJcomponentKK
Re+a#&!(S*&,
JJcomponentKK
C+a&./a#&!(
JJcomponentKK
7/25/2019 IEEEE project
19/20
DEPLOYMENT
DIAGRAMUer Ha*Tree
E+e'e(# Re+a#&!(*&,C+a&./a#&!(
7/25/2019 IEEEE project
20/20
Recommended