Amrutvahini College Of Engineering, Sangamner

Department Of Information Technology

“ACCURATE AND EFFICIENT DYNAMIC MULTI-KEYWORD RANKED SEARCH SCHEME”

A PRESENTATION

ON

Group Members:Mr. Swain Dakshineshwar S.Mr. Chabukswar Akash J.Mr. Tayade Avinash T.Mr. Shermale Sachin S.

Guided By: Mr. R.N. Devikar

PROBLEM STATEMENT

• Accurate and Efficient Dynamic Multi-Keyword Ranked Search Scheme.

• How to achieve accurate result?

• How do we make our search scheme efficient?

ABSTRACT

• With the development of cloud computing, the sensitive information ofoutsourced data is at risk of unauthorized accesses.

• To protect data privacy, the sensitive data should be encrypted by the dataowner before outsourcing, which makes the traditional and efficientplaintext keyword search technique useless. Hence, it is an especiallyimportant thing to explore secure encrypted cloud data search service.

• We introduce a practically efficient and flexible searchable encryptedscheme which supports multi-keyword ranked search.

INTRODUCTION

• Cloud Computing is a new but increasingly mature model of enterprise ITinfrastructure that provides on-demand high quality applications andservices from a shared pool of configuration computing resources.

• Unauthorized operation on the outsourced data may exist on account ofcuriosity or profit.

• To protect the privacy of sensitive information, sensitive data (e.g., emails,photo albums, personal health records, financial records, etc.) should beencrypted by the data owner before outsourcing.

• We intoduce a practically efficient and flexible searchable encryptedscheme.

LITERATURE SURVEY

Sr.

No.

Reference Name

(IEEE/ACM/Spring

er/Any other

journal, etc. Paper

Title)

Work description Problems found Publication

year

1 K. Ren, C.Wang, Q.Wang etal., “Security challenges forthe public cloud,” IEEEInternet Computing, vol. 16,no. 1, pp. 69–73, 2012. [2]

This article is intended as a call for action to motivate further investigation of the many challenging security issuesthat will impact the public cloud’s future.

The existing system outlineseveral critical securitychallenges .

2012

2 D. Boneh, G. Di Crescenzo, R.Ostrovsky, and G. Persiano,“Publickey encryption with keywordsearch,” in Advances inCryptology-Eurocrypt 2004. Springer,2004, pp. 506–522. [3]

This paper constructs an efficient

system.

The problem of searching on data that is encrypted using a public key system.

2004

LITERATURE SURVEYSr.

No.

Reference Name

(IEEE/ACM/Springe

r/Any other journal,

etc. Paper Title)

Work description Problems found Publication

year

3 Jia Zhao, Kun Yang,“A Heuristic Clustering-Based Task Deployment Approach for Load Balancing Using Bayes Theorem in Cloud Environment”, 2016, pp. 50–67. [4]

The proposed approach has reduced the failure number of task deployment events obviously, improved the throughput, and optimized the external services performance of cloud data centers.

Doesn’t guarantee high

execution efficiency.

2016

4 D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on. IEEE, 2000, pp. 44–55. [5]

This paper proposes

cryptographic schemes for the problem of searching on encrypted data and provide proofs of security for the resulting crypto systems.

The problem of searching on data that is encrypted using a public key system.

2000

Methodology

Modules Splits-up

• Cloud Module

• User Module

• Data Owner Module

• Registration Module

Design/Algorithm

Login

Valid User

Get Information

Condition

Sign Up

Yes

False

AdminUser

Add File

Add Details

Search

Begin

End

Add informaiton

Add Source

Data Base

Proposed System

• A secure tree-based search scheme over the encrypted cloud data, whichsupports multi-keyword ranked search and dynamic operation on thedocument collection.

• To address multi-keyword search and result ranking, we use Vector SpaceModel (VSM) to build document index.

• To improve search efficiency, we construct a tree-based index structurebased on the document index vectors and propose a “Greedy Depth-firstSearch” algorithm based on this index tree.

• To rank the documents, we will be using TF-IDF scores.

• Our encryption scheme will meet the privacy requirements.

Software Tools/Technology

• Operating system : Windows 8.1

• Coding Language : JAVA/J2EE

• Databases : DriveHQ, MySql

• Server : Tomcat

• IDE : Eclipse Mars

Proposed Outcomes

• User will be able to use our searchable encryption scheme that supports accurate and efficient multi-keyword ranked search .

• They will be able to perform dynamic operation on document collection.

• They will be able to retrieve their documents within a fraction of seconds with accurate results.

REFERENCES1) Zhihua Xia, Member, IEEE, Xinhui Wang, Xingming Sun, Senior Member,

IEEE, and Qian Wang, Member, IEEE, “A Secure and Dynamic Multi-keyword Ranked Search Scheme over Encrypted Cloud Data”, IEEETRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2015.

2) K. Ren, C.Wang, Q.Wang et al., “Security challenges for the public cloud,” IEEE Internet Computing, vol. 16, no. 1, pp. 69–73, 2012.

3) D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public keyencryption with keyword search,” in Advances in Cryptology-Eurocrypt2004. Springer, 2004, pp. 506–522.

4) Jia Zhao, Kun Yang,“A Heuristic Clustering-Based Task DeploymentApproach for Load Balancing Using Bayes Theorem in CloudEnvironment”, 2016, pp. 50–67.

5) D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches onencrypted data,” in Security and Privacy, 2000. S&P 2000. Proceedings.2000 IEEE Symposium on. IEEE, 2000, pp. 44–55.

THANK YOU