An Efficient Multi-keyword top-k Search Scheme over Encrypted Cloud Data

被引:1
作者
Xu, Jian [1 ,2 ]
Huang, Xinyu [1 ,2 ]
Yang, Geng [1 ]
Wu, Yuanyuan [1 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Comp Sci, Nanjing, Jiangsu, Peoples R China
[2] Jiangsu Key Lab Big Data Secur & Intelligent Proc, Nanjing, Jiangsu, Peoples R China
来源
2018 15TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS AND NETWORKS (I-SPAN 2018) | 2018年
基金
美国国家科学基金会;
关键词
Cloud Computing; privacy preserving; group B plus tree; searchable encryption; multi-keyword; SECURE;
D O I
10.1109/I-SPAN.2018.00059
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
With the rapid development of cloud computing, an increasing number of data owners are motivated to outsource their sensitive data to cloud servers for flexibility and reduced cost in data management. However, privacy is a big concern for outsourcing data to the cloud, particularly for data sets like health records and financial records which usually contain sensitive information. A practical and widely used technique for data privacy preservation is to encrypt data before outsourcing to the cloud servers. In this case, the retrieval of required files from the encrypted cloud becomes a problem which requires searching over the encrypted data. In this paper, we propose an efficient multi-keyword ranked search scheme over encrypted data in cloud using the data structure group B+ tree. To improve the query efficiency, we construct a B+ tree index structure based on the group of data sets, which can optimize the index structure and provide efficient and fast relevance between the query and cloud data. Specifically, for the privacy concern of query data, we use the improved KNN-based algorithm to encrypt sensitive data; the searchable encryption of this scheme achieves accuracy multi-keyword query over encrypted cloud data and returns the highest relevant top-k results. Extensive experimental results on real-life data sets demonstrate that the proposed approach can significantly reduce the index storage and improve the retrieval efficiency.
引用
收藏
页码:305 / 310
页数:6
相关论文
共 19 条
[1]  
[Anonymous], IEEE T INF FORENSICS
[2]  
Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
[3]  
Cao N, 2011, IEEE INFOCOM SER, P829, DOI 10.1109/INFCOM.2011.5935306
[4]  
Curtmola Reza, 2006, P 13 ACM C COMP COMM, DOI DOI 10.1145/1180405.1180417
[5]   Privacy-Preserving Multi-Keyword Top-k Similarity Search Over Encrypted Data [J].
Ding, Xiaofeng ;
Liu, Peng ;
Jin, Hai .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2019, 16 (02) :344-357
[6]  
Goh, 2004, SECURE INDEXES UNPUB
[7]   Secure conjunctive keyword search over encrypted data [J].
Golle, P ;
Staddon, J ;
Waters, B .
APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2004, 3089 :31-45
[8]  
Hans D., 2015, INTORDUCTION CRYPTOG
[9]  
Kamara S., 2013, FINANCIAL CRYPTOGRAP, P258, DOI DOI 10.1007/978-3-642-39884-1
[10]   Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data [J].
Li, Hongwei ;
Yang, Yi ;
Luan, Tom H. ;
Liang, Xiaohui ;
Zhou, Liang ;
Shen, Xuemin .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2016, 13 (03) :312-325