DMRS: an efficient dynamic multi-keyword ranked search over encrypted cloud data

DMRS: an efficient dynamic multi-keyword ranked search over encrypted cloud data With the rise of cloud computing, data owners outsource their data to public cloud servers while allowing users to search the data, aiming at greater flexibility and economic savings. For privacy considerations, private data must be encrypted before outsourcing, and this makes the method of plaintext keyword search infeasible. However, it is critical to enable encrypted data able to be searched. Considering the requirements of practical application scenarios, the function of efficient multi-keyword ranked search and similarity search based on relevance score is necessary for data users. There proposed a number of multi-keyword searchable encryption schemes to try to meet this demand. However, most existing schemes do not satisfy required dynamic update simultaneously. In this paper, a novel and efficient dynamic multi-keyword ranked search scheme improved from traditional secure kNN computation is proposed. The proposed scheme incorporates the similarity measure “coordinate matching” and “inner product similarity” to improve the relevance of search keywords to the relevant cloud files. A reverse data structure is introduced to allow users to perform dynamic operations on document collection, either inserting or deleting. The sparse matrix is used to replace the dense large-scale matrix in index encryption and query vector encryption to improve efficiency. Experiments show that the proposed scheme indeed reduces the overhead of computation and storage compared to MRSE scheme, concurrently guaranteeing privacy and efficiency. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Soft Computing Springer Journals

DMRS: an efficient dynamic multi-keyword ranked search over encrypted cloud data

Loading next page...
 
/lp/springer_journal/dmrs-an-efficient-dynamic-multi-keyword-ranked-search-over-encrypted-70PVqhYT0l
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2017 by Springer-Verlag GmbH Germany
Subject
Engineering; Computational Intelligence; Artificial Intelligence (incl. Robotics); Mathematical Logic and Foundations; Control, Robotics, Mechatronics
ISSN
1432-7643
eISSN
1433-7479
D.O.I.
10.1007/s00500-017-2684-6
Publisher site
See Article on Publisher Site

Abstract

With the rise of cloud computing, data owners outsource their data to public cloud servers while allowing users to search the data, aiming at greater flexibility and economic savings. For privacy considerations, private data must be encrypted before outsourcing, and this makes the method of plaintext keyword search infeasible. However, it is critical to enable encrypted data able to be searched. Considering the requirements of practical application scenarios, the function of efficient multi-keyword ranked search and similarity search based on relevance score is necessary for data users. There proposed a number of multi-keyword searchable encryption schemes to try to meet this demand. However, most existing schemes do not satisfy required dynamic update simultaneously. In this paper, a novel and efficient dynamic multi-keyword ranked search scheme improved from traditional secure kNN computation is proposed. The proposed scheme incorporates the similarity measure “coordinate matching” and “inner product similarity” to improve the relevance of search keywords to the relevant cloud files. A reverse data structure is introduced to allow users to perform dynamic operations on document collection, either inserting or deleting. The sparse matrix is used to replace the dense large-scale matrix in index encryption and query vector encryption to improve efficiency. Experiments show that the proposed scheme indeed reduces the overhead of computation and storage compared to MRSE scheme, concurrently guaranteeing privacy and efficiency.

Journal

Soft ComputingSpringer Journals

Published: Jun 22, 2017

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off