Scribd
Upload
49 views

Efficient Data Security System For Data Sharing in Web Portal

This document proposes a secure multi-keyword ranked search scheme for encrypted cloud data that allows dynamic operations like deletion and insertion of documents. It combines the vector space model and TF-IDF model to construct a special tree-based index for efficient search. The scheme uses secure kNN algorithm to encrypt index and query vectors while ensuring accurate relevance scoring between them. Phantom terms are added to index vectors to resist statistical attacks. The tree-based index allows sub-linear search time and flexible handling of document updates.

Uploaded by

Chandan Athreya.S
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
49 views

Efficient Data Security System For Data Sharing in Web Portal

This document proposes a secure multi-keyword ranked search scheme for encrypted cloud data that allows dynamic operations like deletion and insertion of documents. It combines the vector space model and TF-IDF model to construct a special tree-based index for efficient search. The scheme uses secure kNN algorithm to encrypt index and query vectors while ensuring accurate relevance scoring between them. Phantom terms are added to index vectors to resist statistical attacks. The tree-based index allows sub-linear search time and flexible handling of document updates.

Uploaded by

Chandan Athreya.S
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Efficient Data Security System for

Data Sharing in Web Portal


Introduction:
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.

EXISTING SYSTEM:

 A general approach to protect the data confidentiality is to encrypt the data


before outsourcing.
 Searchable encryption schemes enable the client to store the encrypted data
to the cloud and execute keyword search over ciphertext domain. So far,
abundant works have been proposed under different threat models to achieve
various search functionality, such as single keyword search, similarity
search, multi-keyword boolean search, ranked search, multi-keyword ranked
search, etc. Among them, multi-keyword ranked search achieves more and
more attention for its practical applicability. Recently, some dynamic
schemes have been proposed to support inserting and deleting operations on
document collection. These are significant works as it is highly possible that
the data owners need to update their data on the cloud server.

ADVANTAGES OF PROPOSED SYSTEM:

 Due to the special structure of our tree-based index, the proposed search
scheme can flexibly achieve sub-linear search time and deal with the
deletion and insertion of documents.
 We design a searchable encryption scheme that supports both the accurate
multi-keyword ranked search and flexible dynamic operation on
document collection.
 Due to the special structure of our tree-based index, the search
complexity of the proposed scheme is fundamentally kept to logarithmic.
And in practice, the proposed scheme can achieve higher search
efficiency by executing our “Greedy Depth-first Search” algorithm.
Moreover, parallel search can be flexibly performed to further reduce the
time cost of search process.

SYSTEM ARCHITECTURE:
MODULE

 Data Owner Module


 Data User Module
 Cloud server and Encryption Module
 Rank Search Module

HARDWARE REQUIREMENTS:

 System : Pentium Dual Core.


 Hard Disk : 120 GB.
 Monitor : 15’’ LED
 Input Devices : Keyboard, Mouse
 Ram : 1GB.
SOFTWARE REQUIREMENTS:

 Operating system : Windows 7 and above


 Coding Language : JAVA/J2EE
 Tool : Netbeans 7.2.1
 Database : MYSQL

You might also like