云计算中保护数据隐私的快速多关键词语义排序搜索方案  

Fast Multi-Keyword Semantic Ranked Search in Cloud Computing

作　　者：杨旸[1,2,3] 刘佳 蔡圣暐[1,2] 杨书略 YANG Yang;LIU Jia;CAI Sheng-Wei;YANG Shu-Lue(College of Mathematics and Computer Science,Fuzhou University,Fuzhou 350108;University Key Laboratory of Information Security of Network Systems（Fuzhou University）,Fujian Province,Fuzhou 350108;Fujian Provincial Key Laboratory of Information Processing and Intelligent Control（Minjiang University）,Fuzhou 350121;College of Physics and Information Engineering,Fuzhou University,Fuzhou 350108)

机构地区：[1]福州大学数学与计算机科学学院,福州350108 [2]网络系统信息安全福建省高校重点实验室(福州大学),福州350108 [3]福建省信息处理与智能控制重点实验室(闽江学院),福州350121 [4]福州大学物理与信息工程学院,福州350108

出　　处：《计算机学报》2018年第6期1346-1359,共14页Chinese Journal of Computers

基　　金：国家自然科学基金(61402112;61472307;61472309;61303198);福建省教育厅科技项目(JA12028);闽江学院福建省信息处理与智能控制重点实验室开放课题(MJUKF201734);福建省重大区域产业项目(2014H4015);福建省重大科技项目(2015H6013)资助~~

摘　　要：可搜索加密技术主要解决在云服务器不完全可信的情况下,支持用户在密文上进行搜索.该文提出了一种快速的多关键词语义排序搜索方案.首先,该文首次将域加权评分的概念引入文档的评分当中,对标题、摘要等不同域中的关键词赋予不同的权重加以区分.其次,对检索关键词进行语义拓展,计算语义相似度,将语义相似度、域加权评分和相关度分数三者结合,构造了更加准确的文档索引.然后,针对现有的MRSE(Multi-keyword Ranked Search over Encrypted cloud data)方案效率不高的缺陷,将创建的文档向量分块,生成维数较小的标记向量.通过对文档标记向量和查询标记向量的匹配,有效地过滤了大量的无关文档,减少了计算文档相关度分数和排序的时间,提高了搜索的效率.最后,在加密文档向量时,将文档向量分段,每一段与对应维度的矩阵相乘,使得构建索引的时间减少,进一步提高了方案的效率.理论分析和实验结果表明:该方案实现了快速的多关键词语义模糊排序搜索,在保障数据隐私安全的同时,有效地提高了检索效率,减少了创建索引的时间,并返回更加满足用户需求的排序结果.With the growing popularity of cloud computing,the individuals and corporations are motivated to outsource their data to the public cloud server for economic savings and accessing to data at any time,any place,and with any device.Note that the outsourced data may be private and contain sensitive information,such as financial trading files,electronic health records,private secret logs and individual sensitive multimedia data.To minimize the probability of the risk of sensitive data leakage,it is desirable for the data owners to encrypt sensitive data before sending them to cloud.However,it also hinders the usability of outsourced data,such as data retrieval operation.Searchable encryption（SE）technology is an important approach to deal with this problem,which enables the users to search over encrypted data to realize effective datautilization.In searchable encryption schemes,the cloud storage server is assumed honest-but-curious（or say,semi-trusted）,who is honest to execute the required storage and retrieval operations,but also curious to discover the plaintext keyword or file of users.The security requirement of SE should guarantee that only authorized users can decrypt encrypted data with decryption keys and then obtain plaintext files.In recent years,diverse SE schemes are proposed,which pay attention to both privacy and practicability of the system.However,most of the existing multi-keyword searchable encryption schemes have neither taken into consideration the location information of thekeywords nor measured the similarity of the synonym keywords.At the same time,the search efficiency is low and the index construction time is too long.In this paper,we propose a fast multi-keyword semantic ranked search scheme.Firstly,for the first time,the concept of weighted domain scoring is introduced to searchable encryption to calculate the document relevance scores.The keywords in different domains（title,abstract,etc.）are measured by different weighted domain score.Secondly,the retrieved keywords are semantic

关 键 词：云计算 可搜索加密 语义相似度 域加权评分 快速KNN(K-Nearest Neighbor)算法 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]