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

被引:39
|
作者
Yang, Yang [1 ,2 ,3 ,4 ,5 ]
Liu, Ximeng [1 ,2 ,3 ,4 ,5 ]
Deng, Robert H. [2 ]
机构
[1] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou 350002, Fujian, Peoples R China
[2] Singapore Management Univ, Sch Informat Syst, Singapore 188065, Singapore
[3] Fuzhou Univ, Univ Key Lab Informat Secur Network Syst, Fuzhou 350002, Fujian, Peoples R China
[4] Fuzhou Univ, Fujian Prov Key Lab Network Comp & Intelligent In, Fuzhou 350002, Fujian, Peoples R China
[5] Minist Educ, Key Lab Spatial Data Min & Informat Sharing, Fuzhou 350002, Fujian, Peoples R China
基金
新加坡国家研究基金会; 中国国家自然科学基金;
关键词
Searchable encryption; multiple keyword; rank; top-k; privacy-preserving; PUBLIC-KEY ENCRYPTION; SYMMETRIC-ENCRYPTION; CLOUD DATA; RETRIEVAL; SUPPORT; SCHEME;
D O I
10.1109/TDSC.2017.2787588
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-keyword rank searchable encryption (MRSE) returns the top-$k$k 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 $k$k-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-$k$k results returned to a data user. We also conduct extensive experiments to demonstrate the efficiency of the new system.
引用
收藏
页码:320 / 334
页数:15
相关论文
共 50 条
  • [1] Multi-User Multi-Keyword Privacy Preserving Ranked Based Search Over Encrypted Cloud Data
    Rane, Deepali D.
    Ghorpade, V. R.
    2015 INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING (ICPC), 2015,
  • [2] Multi-user noisy keyword search over encrypted data
    Yang, B. (byang@snnu.edu.cn), 1973, Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States (09):
  • [3] Secure Multi-keyword Similarity Search Over Encrypted Cloud Data Supporting Efficient Multi-user Setup
    Strizhov, Mikhail
    Ray, Indrajit
    TRANSACTIONS ON DATA PRIVACY, 2016, 9 (02) : 131 - 159
  • [5] Approximate Multi-keyword Rank Search on Encrypted Cloud Data
    Shih, Wan-Ni
    Chin, Tai-Lin
    GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE, 2017,
  • [6] Multi-keyword Similarity Search over Encrypted Cloud Data
    Strizhov, Mikhail
    Ray, Indrajit
    ICT SYSTEMS SECURITY AND PRIVACY PROTECTION, IFIP TC 11 INTERNATIONAL CONFERENCE, SEC 2014, 2014, 428 : 52 - 65
  • [7] Efficient verifiable multi-keyword search over encrypted data
    Miao, Yinbin
    Ma, Jianfeng
    Zhang, Junwei
    Liu, Zhiquan
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2017, 44 (04): : 18 - 23
  • [8] Secure Multi-Keyword Search Over Encrypted Outsourced Data
    Anukrishna, P. R.
    Paul, Vince
    International Journal of Computer Science and Network Security, 2016, 16 (11): : 86 - 89
  • [9] EFFICIENT MULTI-USER KEYWORD SEARCH OVER ENCRYPTED DATA IN CLOUD COMPUTING
    Li, Jin
    Chen, Xiaofeng
    COMPUTING AND INFORMATICS, 2013, 32 (04) : 723 - 738
  • [10] Secure Rank-ordered Search of Multi-keyword Trapdoor over Encrypted Cloud Data
    Ibrahim, Ayad
    Jin, Hai
    Yassin, Ali A.
    Zou, Deqing
    2012 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE (APSCC), 2012, : 263 - 270