The document presents a project on developing an "accurate and efficient dynamic multi-keyword ranked search scheme". It aims to address issues with searching encrypted data outsourced to the cloud. The proposed system uses a tree-based index structure and "Greedy Depth-first Search" algorithm to improve search efficiency. It also utilizes TF-IDF scores to rank documents by relevance to search terms. The project aims to provide a searchable encryption scheme that supports accurate, efficient multi-keyword searches and dynamic operations on document collections.

1. 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

2. PROBLEM STATEMENT
• Accurate and Efficient Dynamic Multi-Keyword Ranked Search Scheme.
• How to achieve accurate result?
• How do we make our search scheme efficient?

3. ABSTRACT
• With the development of cloud computing, the sensitive information of
outsourced data is at risk of unauthorized accesses.
• To protect data privacy, the sensitive data should be encrypted by the data
owner before outsourcing, which makes the traditional and efficient
plaintext keyword search technique useless. Hence, it is an especially
important thing to explore secure encrypted cloud data search service.
• We introduce a practically efficient and flexible searchable encrypted
scheme which supports multi-keyword ranked search.

4. INTRODUCTION
• Cloud Computing is a new but increasingly mature model of enterprise IT
infrastructure that provides on-demand high quality applications and
services from a shared pool of configuration computing resources.
• Unauthorized operation on the outsourced data may exist on account of
curiosity or profit.
• To protect the privacy of sensitive information, sensitive data (e.g., emails,
photo albums, personal health records, financial records, etc.) should be
encrypted by the data owner before outsourcing.
• We intoduce a practically efficient and flexible searchable encrypted
scheme.

5. 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 et
al., “Security challenges for
the public cloud,” IEEE
Internet 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 issues
that will impact the public
cloud’s future.
The existing system outline
several critical security
challenges .
2012
2 D. Boneh, G. Di Crescenzo, R.
Ostrovsky, and G. Persiano,
“Public
key encryption with keyword
search,” in Advances in
Cryptology-
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

6. LITERATURE SURVEY
Sr.
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

7. Methodology

8. Modules Splits-up
• Cloud Module
• User Module
• Data Owner Module
• Registration Module

9. 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

10. Proposed System
• A secure tree-based search scheme over the encrypted cloud data, which
supports multi-keyword ranked search and dynamic operation on the
document collection.
• To address multi-keyword search and result ranking, we use Vector Space
Model (VSM) to build document index.
• To improve search efficiency, we construct a tree-based index structure
based on the document index vectors and propose a “Greedy Depth-first
Search” 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.

11. Software Tools/Technology
• Operating system : Windows 8.1
• Coding Language : JAVA/J2EE
• Databases : DriveHQ, MySql
• Server : Tomcat
• IDE : Eclipse Mars

12. 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.

13. REFERENCES
1) 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”, IEEE
TRANSACTIONS 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 key
encryption with keyword search,” in Advances in Cryptology-Eurocrypt
2004. Springer, 2004, pp. 506–522.
4) Jia Zhao, Kun Yang,“A Heuristic Clustering-Based Task Deployment
Approach for Load Balancing Using Bayes Theorem in Cloud
Environment”, 2016, pp. 50–67.
5) 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.

14. THANK YOU