achieving searchable encryption scheme with search pattern hidden

1. Venkat Java Projects
Mobile:+91 9966499110 Visit:www.venkatjavaprojects.com
Email:venkatjavaprojects@gmail.com
Achieving Searchable Encryption Scheme with Search Pattern Hidden
Abstract:
Searchable Encryption (SE) enables a data owner to outsource encrypted data to an untrusted
server while preserving the keyword search functionality. Typically, the server learns whether or
not a query has been performed more than once, which is usually called the search pattern.
However, such kind of information leakage might be leveraged to break query privacy. To
further reduce such type of leakage and provide strong privacy guarantee, Wang et al. proposed a
novel SE scheme based on the Paillier encryption scheme in INFOCOM’15. Unfortunately, their
scheme cannot perform keyword search successfully, because the additive homomorphic
property is not sufficient for their construction. In this paper, we first show that why their scheme
fails to return the correct search result, and then propose a new SE scheme by adopting a special
additive homomorphic encryption scheme to achieve the multiplicative homomorphic property
efficiently. Furthermore, we enhance the security on the user side. Specifically, we use random
polynomials with an appropriate degree to guarantee that the user cannot learn anything other
than the desired search result. Finally, we present a formal security analysis and implement our
scheme on a real-world database, which demonstrates that our construction can achieve the
desired security properties with good performance.
Index Terms—Searchable encryption, Conjunctive keyword search, Search pattern, Additive
homomorphic encryption.
Existing System:
Searchable encryption enables the cloud server to perform keyword-based search over encrypted
data. Specifically, the data owner outsources his encrypted documents along with a search index
to the server, then the server performs search directly over the search index with the aid of search
token, and finally returns matched results to the user. After the invention of seminal SE scheme
proposed by Song et al. , a lot of progress has been made on improving the efficiency the
security and the expressiveness. Nevertheless, most known schemes with good performance
always suffer from important security limitations, namely, they leak search pattern and access
pattern. More precisely, the access pattern is defined as any information inferred from knowing
which document matches the query, while the search pattern is defined as any information
inferred from knowing whether two queries are for the same keyword or not. A recent line of

2. Venkat Java Projects
Mobile:+91 9966499110 Visit:www.venkatjavaprojects.com
Email:venkatjavaprojects@gmail.com
attacks have demonstrated that such access pattern and search pattern leakages can be used to
recover the content of queried keywords. Specifically, IKK attack and Count attack exploits
access pattern and the number of the search results respectively to recover the queries. Liu et al.
exploits the search pattern to launch the query recovery attack. The powerful file injection attack
uses both the search pattern and access pattern to recover the queried keywords. 1 A positive
way to protect the access pattern is to use the ORAM technique to retrieve the matched
documents for a response-hiding scheme . However, how to protect the search pattern is still a
challenge. The reason is that the search pattern not only comes from the deterministic search
token for the same query, but also could be inferred from other aspects such as the access pattern
and the number of search results.
Proposed System:
 We point out that Wang et al.’s SE scheme with search pattern guarantee cannot perform
search operation correctly at the server side. The main reason is that both additive and
multiplicative homomorphic properties of an encryption scheme are required. However,
the Paillier encryption scheme used in their construction only supports the additive
homomorphic property.
 We propose the first efficient SE scheme to hide the search pattern, while supporting
conjunctive keyword search. Specifically, we exploit a special additive homomorphic
encryption scheme and an auxiliary server to efficiently achieve the required properties,
and thus the search operation can be performed successfully at the server. Moreover, the
security of our scheme on the user side is enhanced by leveraging random polynomials.
Specifically, during the search progress, the server selects random polynomials with an
appropriate degree and exploits the additive homomorphic property to generate the result
polynomial, which ensures that nothing else other than the desired search results is leaked
from the result polynomial.
 We present a formal security analysis without the knowledge of search pattern, which
shows that our proposed scheme can provide a stronger security guarantee. Furthermore,
we provide a thorough implementation and the experiment results demonstrate that our

3. Venkat Java Projects
Mobile:+91 9966499110 Visit:www.venkatjavaprojects.com
Email:venkatjavaprojects@gmail.com
scheme enjoys a better search efficiency. In our scheme, the server can perform search in
a parallel way, which is independent of the whole search index.
System Architecture:
SYSTEM REQUIREMENTS:
HARDWARE REQUIREMENTS:
• PROCESSOR : I3.
• Hard Disk : 40 GB.
• Ram : 2 GB.
SOFTWARE REQUIREMENTS:
• Operating system : Windows.

4. Venkat Java Projects
Mobile:+91 9966499110 Visit:www.venkatjavaprojects.com
Email:venkatjavaprojects@gmail.com
• Coding Language : JAVA/J2EE
• Data Base : MYSQL
• IDE :Netbeans8.1