A NEW lightweight symmetric

searchable Encryption scheme for

string identification

ABSTRACT PRESENTATION ON 26nd October

BY,
PRIYANKA PANDARINATH
13H1D5830

UNDER THE GUIDANCE OF

SHIVA SKANDAN SIR assistant ProfESSor
 AIM

 The idea of searching against a string, which allows the search to be more
specific. Searching for string is a multi keyword search where the ordering
of keywords is preserved.

The system proposes a non-adaptively secure SSE scheme for string search
which takes one round of communication, O(n) times of computation over n
documents, O(n) additional memory in the server side and no memory in the
client side.

 So in addition to the presence of all these keywords in a document, their

ordering and adjacency are to be taken care off while searching. So the
index table needs to be prepared in such a way that the adjacency
information of the words can be preserved.
 EXISTING SYSTEM

 SSE is feasible on very large databases. It was designed and implemented

dynamically as symmetric searchable encryption schemes that efficiently
and privately search server held encrypted databases with tens of billions
of record-keyword pairs.

 Their basic theoretical construction was for single-keyword searches and

which offers asymptotically optimal server index size, fully parallel
searching, And minimal leakage.
Thank You
00000