ABSTRACT:
In this paper, we provide an efficient and easy-to-implement symmetric
searchable encryption scheme (SSE) for string search, which takes one round of
communication, O(n) times of computations over n documents. Unlike
previous schemes, we use hash-chaining instead of chain of encryption
operations for index generation, which makes it suitable for lightweight
applications. Unlike the previous SSE schemes for string search, with our
scheme, server learns nothing about the frequency and the relative positions of
the words being searched except what it can learn from the history. We are the
first to propose probabilistic trapdoors in SSE for string search. We provide
concrete proof of non-adaptive security of our scheme against
honest-but-curious server based on the definitions of [12]. We also introduce a
new notion of search pattern privacy, which gives a measure of security against
the leakage from trapdoor. We have shown that our scheme is secure under search
pattern indistinguishability definition. We show why
SSE scheme for string search cannot attain adaptive indistinguishability
criteria as mentioned in [12]. We also propose modifications of our scheme so
that the scheme can be used against active adversaries at the cost of more
rounds of communications and memory space. We validate our scheme against two
different commercial datasets.
SYSTEM
REQUIREMENTS:
HARDWARE
REQUIREMENTS:
·
System : Pentium Dual Core.
·
Hard Disk : 120 GB.
·
Monitor :
15’’ LED
·
Input
Devices : Keyboard, Mouse
·
Ram : 1
GB
SOFTWARE REQUIREMENTS:
·
Operating
system : Windows 7.
·
Coding
Language : JAVA/J2EE
·
Tool : Netbeans 7.2.1
·
Database
: MYSQL
REFERENCE:
Indranil Ghosh Ray, Yogachandran Rahulamathavan and Muttukrishnan Rajarajan, Senior Member, IEEE, “A New Lightweight
Symmetric Searchable Encryption Scheme for String Identification”, IEEE
Transactions on Cloud Computing, 2018.