Multi-User Multi-Keyword Rank Search Over Encrypted Data in Arbitrary Language

Multi-keyword rank searchable encryption (MRSE) returns the top-<inline-formula><tex-math notation="LaTeX">k</tex-math> <mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq1-2787588.gif"/> </inline-formula&...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on dependable and secure computing Ročník 17; číslo 2; s. 320 - 334
Hlavní autoři: Yang, Yang, Liu, Ximeng, Deng, Robert H.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Washington IEEE 01.03.2020
IEEE Computer Society
Témata:
Algorithm design and analysis
Algorithms
Cloud computing
Cybersecurity
Data search
Data storage
Encryption
Indexes
Keywords
multiple keyword
Privacy
privacy-preserving
rank
Searchable encryption
Servers
Storage systems
top-<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> k</tex-math> <mml:math> <mml:mi>k</mml:mi> </mml:math> <inline-graphic xlink:href="yang-ieq4-2787588.gif" xlink:type="simple"/> </inline-formula>
ISSN:1545-5971, 1941-0018
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Multi-keyword rank searchable encryption (MRSE) returns the top-<inline-formula><tex-math notation="LaTeX">k</tex-math> <mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq1-2787588.gif"/> </inline-formula> results in response to a data user's request of multi-keyword search over encrypted data, and hence provides an efficient way for preserving data privacy in cloud storage systems while without loss of data usability. Many existing MRSE systems are constructed based on an algorithm which we term as <inline-formula><tex-math notation="LaTeX">k</tex-math> <mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq2-2787588.gif"/> </inline-formula>-nearest neighbor for searchable encryption (KNN-SE). Unfortunately, KNN-SE has a number of shortcomings, which limit its practical applications. In this paper, we propose a new MRSE system which overcomes almost all the defects of the KNN-SE based MRSE systems. Specifically, our new system does not require a predefined keyword set and supports keywords in arbitrary languages, is a multi-user system which supports flexible search authorization and time-controlled revocation, and it achieves better data privacy protection since even the cloud server is not able to tell which documents are the top-<inline-formula><tex-math notation="LaTeX">k</tex-math> <mml:math><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="yang-ieq3-2787588.gif"/> </inline-formula> results returned to a data user. We also conduct extensive experiments to demonstrate the efficiency of the new system.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1545-5971
1941-0018
DOI:10.1109/TDSC.2017.2787588