An efficient and privacy-preserving ranked fuzzy keywords search over encrypted cloud data

S. Ding, Yidong Li, Jianhui Zhang, Liang Chen, Zhen Wang, Qunqun Xu
{"title":"An efficient and privacy-preserving ranked fuzzy keywords search over encrypted cloud data","authors":"S. Ding, Yidong Li, Jianhui Zhang, Liang Chen, Zhen Wang, Qunqun Xu","doi":"10.1109/BESC.2016.7804500","DOIUrl":null,"url":null,"abstract":"As cloud computing becomes widespread, more and more users prefer to outsource their local sensitive data into the cloud. In order to protect data privacy, these sensitive data usually has to be encrypted before outsourcing, which makes effective data utilization a very difficult task. Although traditional searchable encryption techniques allow users to securely search over encrypted cloud data, they only support exact single keyword search, i.e. they do not allow any minor spelling errors or format inconsistencies. Besides, these traditional schemes support only Boolean search, without capturing any relevance of data files and rarely sort the search result. Recently, fuzzy keyword search over encrypted data techniques are introdeced to resolve the problem of spelling errors and format inconsistencis. However, they may incur large index size, search result inaccuracy and high search complexity, which greatly reduce the system usability and efficiency. In this paper, we propose the solution for privacy preserving ranked fuzzy keyword search over encrypted cloud data with small index. We use k-grams and Jaccard coefficient to constrcuct fuzzy keyword set and produce fuzzy results, and efficient relevance criteria (e.g., TF × IDF) to capture the relevance between data files and search requests. Extensive experiment result shows the efficiency of proposed scheme.","PeriodicalId":225942,"journal":{"name":"2016 International Conference on Behavioral, Economic and Socio-cultural Computing (BESC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Behavioral, Economic and Socio-cultural Computing (BESC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BESC.2016.7804500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

As cloud computing becomes widespread, more and more users prefer to outsource their local sensitive data into the cloud. In order to protect data privacy, these sensitive data usually has to be encrypted before outsourcing, which makes effective data utilization a very difficult task. Although traditional searchable encryption techniques allow users to securely search over encrypted cloud data, they only support exact single keyword search, i.e. they do not allow any minor spelling errors or format inconsistencies. Besides, these traditional schemes support only Boolean search, without capturing any relevance of data files and rarely sort the search result. Recently, fuzzy keyword search over encrypted data techniques are introdeced to resolve the problem of spelling errors and format inconsistencis. However, they may incur large index size, search result inaccuracy and high search complexity, which greatly reduce the system usability and efficiency. In this paper, we propose the solution for privacy preserving ranked fuzzy keyword search over encrypted cloud data with small index. We use k-grams and Jaccard coefficient to constrcuct fuzzy keyword set and produce fuzzy results, and efficient relevance criteria (e.g., TF × IDF) to capture the relevance between data files and search requests. Extensive experiment result shows the efficiency of proposed scheme.
一种高效且保护隐私的模糊关键词搜索算法
随着云计算的普及,越来越多的用户倾向于将本地敏感数据外包到云中。为了保护数据隐私,这些敏感数据通常需要在外包之前进行加密,这使得有效利用数据成为一项非常困难的任务。虽然传统的可搜索加密技术允许用户安全地搜索加密的云数据,但它们只支持精确的单个关键字搜索,即不允许任何轻微的拼写错误或格式不一致。此外,这些传统的模式只支持布尔搜索,没有捕获数据文件的任何相关性,也很少对搜索结果进行排序。近年来,模糊关键字搜索技术被引入加密数据,以解决拼写错误和格式不一致的问题。但是,索引规模大,搜索结果不准确,搜索复杂度高,大大降低了系统的可用性和效率。本文提出了一种在小索引加密云数据上保持隐私的排序模糊关键字搜索方案。我们使用k-grams和Jaccard系数来构建模糊关键字集并产生模糊结果,并使用高效的关联标准(如TF × IDF)来捕获数据文件与搜索请求之间的相关性。大量的实验结果表明了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信