Semantic-Aware Searching Over Encrypted Data for Cloud Computing

被引:60
作者
Fu, Zhangjie [1 ]
Xia, Lili [1 ]
Sun, Xingming [1 ]
Liu, Alex X. [2 ]
Xie, Guowu [3 ]
机构
[1] Nanjing Univ Informat Sci & Technol, Sch Comp & Software, Nanjing 210044, Jiangsu, Peoples R China
[2] Michigan State Univ, Dept Comp Sci & Engn, E Lansing, MI 48824 USA
[3] Univ Calif Riverside, Sch Comp & Engn, Riverside, CA 92521 USA
基金
中国博士后科学基金; 中国国家社会科学基金;
关键词
Searchable encryption; cloud computing; smart semantic search; concept hierarchy; KEYWORD RANKED SEARCH; SECURE; PRIVACY;
D O I
10.1109/TIFS.2018.2819121
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
With the increasing adoption of cloud computing, a growing number of users outsource their datasets to cloud. To preserve privacy, the datasets are usually encrypted before outsourcing. However, the common practice of encryption makes the effective utilization of the data difficult. For example, it is difficult to search the given keywords in encrypted datasets. Many schemes are proposed to make encrypted data searchable based on keywords. However, keyword-based search schemes ignore the semantic representation information of users' retrieval, and cannot completely meet with users search intention. Therefore, how to design a content-based search scheme and make semantic search more effective and context-aware is a difficult challenge. In this paper, we propose ECSED, a novel semantic search scheme based on the concept hierarchy and the semantic relationship between concepts in the encrypted datasets. ECSED uses two cloud servers. One is used to store the outsourced datasets and return the ranked results to data users. The other one is used to compute the similarity scores between the documents and the query and send the scores to the first server. To further improve the search efficiency, we utilize a tree-based index structure to organize all the document index vectors. We employ the multi-keyword ranked search over encrypted cloud data as our basic frame to propose two secure schemes. The experiment results based on the real world datasets show that the scheme is more efficient than previous schemes. We also prove that our schemes are secure under the known ciphertext model and the known background model.
引用
收藏
页码:2359 / 2371
页数:13
相关论文
共 60 条
  • [1] Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
  • [2] SABRE: a Sensitive Attribute Bucketization and REdistribution framework for t-closeness
    Cao, Jianneng
    Karras, Panagiotis
    Kalnis, Panos
    Tan, Kian-Lee
    [J]. VLDB JOURNAL, 2011, 20 (01) : 59 - 81
  • [3] Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data
    Cao, Ning
    Wang, Cong
    Li, Ming
    Ren, Kui
    Lou, Wenjing
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (01) : 222 - 233
  • [4] Cash D, 2013, LECT NOTES COMPUT SC, V8042, P353, DOI 10.1007/978-3-642-40041-4_20
  • [5] Structured Encryption and Controlled Disclosure
    Chase, Melissa
    Kamara, Seny
    [J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT 2010, 2010, 6477 : 577 - 594
  • [6] An Efficient Privacy-Preserving Ranked Keyword Search Method
    Chen, Chi
    Zhu, Xiaojie
    Shen, Peisong
    Hu, Jiankun
    Guo, Song
    Tari, Zahir
    Zomaya, Albert Y.
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (04) : 951 - 963
  • [7] Dual-Server Public-Key Encryption With Keyword Search for Secure Cloud Storage
    Chen, Rongmao
    Mu, Yi
    Yang, Guomin
    Guo, Fuchun
    Wang, Xiaofen
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2016, 11 (04) : 789 - 798
  • [8] New Algorithms for Secure Outsourcing of Modular Exponentiations
    Chen, Xiaofeng
    Li, Jin
    Ma, Jianfeng
    Tang, Qiang
    Lou, Wenjing
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (09) : 2386 - 2396
  • [9] Chen Yifan, 2008, WSDM, P251
  • [10] Cheng FQ, 2014, LECT NOTES COMPUT SC, V8485, P348, DOI 10.1007/978-3-319-08010-9_37