Ijcse V2i1p2
Ijcse V2i1p2
Ijcse V2i1p2
Abstract:
Due to the increasing popularity of cloud computing, more and more data owners are
motivated to outsource their data to cloud servers for great convenience and reduced cost in
data management. However, sensitive data should be encrypted before outsourcing for
privacy requirements, which obsoletes data utilization like keyword-based document
retrieval. In this paper, we present a secure multi-keyword ranked search scheme over
encrypted cloud data, which simultaneously supports dynamic update operations like deletion
and insertion of documents. Specifically, the vector space model and the widely-used
TF_IDF model are combined in the index construction and query generation. We construct a
special tree-based index structure and propose a “Greedy Depth-first Search” algorithm to
provide efficient multi-keyword ranked search. The secure kNN algorithm is utilized to
encrypt the index and query vectors, and meanwhile ensure accurate relevance score
calculation between encrypted index and query vectors. In order to resist statistical attacks,
phantom terms are added to the index vector for blinding search results. Due to the use of our
special tree-based index structure, the proposed scheme can achieve sub-linear search time
and deal with the deletion and insertion of documents flexibly. Extensive experiments are
conducted to demonstrate the efficiency of the proposed scheme.
computational overhead for both the cloud relevance score calculation between
sever and user. On the contrary, more encrypted index and query vectors. To
practical specialpurpose solutions, such as resist different attacks in different threat
searchable encryption (SE) schemes have models, we construct two secure search
made specific contributions in terms of schemes: the basic dynamic multi-keyword
efficiency, functionality and security. ranked search (BDMRS) scheme in the
Searchable encryption schemes enable the known cipher text model, and the
client to store the encrypted data to the enhanced dynamic multi-keyword ranked
cloud and execute keyword search over search (EDMRS) scheme in the known
ciphertext domain. So far, abundant works background model.
have been proposed under different threat
models to achieve various search Our contributions are summarized as
functionality, such as single keyword follows:
search, similarity search, multi-keyword 1) We design a searchable encryption
boolean search, ranked search, multi- scheme that supports both the accurate
keyword ranked search, etc. Among them, multi-keyword ranked search and flexible
multi keyword ranked search achieves dynamic operation on document
more and more attention for its practical collection.
applicability. Recently, some dynamic 2) Due to the special structure of our tree-
schemes have been proposed to support based index, the search complexity of the
inserting and deleting operations on proposed scheme is fundamentally kept to
document collection. These are significant logarithmic. And in practice, the proposed
works as it is highly possible that the data scheme can achieve higher search
owners need to update their data on the efficiency by executing our “Greedy
cloud server. But few of the dynamic Depth-first Search” algorithm. Moreover,
schemes support efficient multi keyword parallel search can be flexibly performed
ranked search. to further reduce the time cost of search
This paper proposes a secure tree-based process. The reminder of this paper is
search scheme over the encrypted cloud organized as follows.
data, which supports multi keyword Related work is discussed in Section 2,
ranked search and dynamic operation on and Section 3 gives a brief introduction to
the document collection. Specifically, the the system model, threat model, the design
vector space model and the widely-used goals, and the preliminaries. Section 4
“term frequency (TF) × inverse doc ument describes the schemes in detail. Section 5
frequency (IDF)” model are combined in presents the experiments and performance
the index construction and query analysis. And Section 6 covers the
generation to provide multikeyword conclusion.
ranked search. In order to obtain high
search efficiency, we construct a tree- 2. SYSTEM STUDY
based index structure and propose a 2.1 FEASIBILITY STUDY
“Greedy Depth-first Search” algorithm The feasibility of the project is analyzed in
based on this index tree. Due to the special this phase and business proposal is put
structure of our tree-based index, the forth with a very general plan for the
proposed search scheme can flexibly project and some cost estimates. During
achieve sub-linear search time and deal system analysis the feasibility study of the
with the deletion and insertion of proposed system is to be carried out. This
documents. The secure kNN algorithm is is to ensure that the proposed system is not
utilized to encrypt the index and query a burden to the company. For feasibility
vectors, and meanwhile ensure accurate analysis, some understanding of the major
ISSN: 2455-135X http://www.ijcsejournal.org Page 8
International Journal of Computer science engineering Techniques-– Volume 2 Issue 1, Nov - Dec 2016
two vectors one for storing TF weight and the challenge from the cloud server.
other to store IDF weight. Actually, there are many secure challenges
Result Analysis: in a multi-user scheme. Firstly, all the
The privacy preserved multi-keyword users usually keep the same secure key for
search based on the encrypted cloud data trapdoor generation in a symmetric SE
has been designed. The system model scheme. In this case, the revocation of the
presented has been developed on Visual user is big challenge. If it is needed to
Studio 2010 framework 4.0 with C#. The revoke a user in this scheme, we need to
overall system has been developed and rebuild the index and distribute the new
implemented with Microsoft Azure cloud secure keys to all the authorized users.
platform. Secondly, symmetric SE schemes usually
assume that all the data users are
5. CONCLUSION trustworthy.
In this paper, a secure, efficient and 6. Results
dynamic search scheme is proposed, which It is not practical and a dishonest data user
supports not only the accurate multi- will lead to many secure problems. For
keyword ranked search but also the example, a dishonest data user may search
dynamic deletion and insertion of the documents and distribute the decrypted
documents. We construct a special documents to the unauthorized ones. Even
keyword balanced binary tree as the index, more, a dishonest data user may distribute
and propose a “Greedy Depth-first Search” his/her secure keys to the unauthorized
algorithm to obtain better efficiency than ones. In the future works, we will try to
linear search. In addition, the parallel improve the SE scheme to handle these
search process can be carried out to further challenge problems.
reduce the time cost. The security of the
scheme is protected against two threat
models by using the secure kNN
algorithm. Experimental results
demonstrate the efficiency of our proposed
scheme. There are still many challenge
problems in symmetric SE schemes. In the
proposed scheme, the data owner is
responsible for generating updating
information and sending them to the cloud
server. Thus, the data owner needs to store Fig 6.1
the unencrypted index tree and the
information that are necessary to
recalculate the IDF values. Such an active
data owner may not be very suitable for
the cloud computing model. It could be a
meaningful but difficult future work to
design a dynamic searchable encryption
scheme whose updating operation can be
completed by cloud server only,
meanwhile reserving the ability to support Fig 6.2
multi-keyword ranked search. In addition,
as the most of works about searchable
encryption, our scheme mainly considers