Privacy-Preserving Ranked Fuzzy Keyword Search over Encrypted Cloud Data

Qunqun Xu, Hong Shen, Yingpeng Sang, Hui Tian
{"title":"Privacy-Preserving Ranked Fuzzy Keyword Search over Encrypted Cloud Data","authors":"Qunqun Xu, Hong Shen, Yingpeng Sang, Hui Tian","doi":"10.1109/PDCAT.2013.44","DOIUrl":null,"url":null,"abstract":"As Cloud Computing becomes popular, more and more data owners prefer to store their data into the cloud for great flexibility and economic savings. In order to protect the data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a challenging task. Although traditional searchable symmetric encryption schemes allow users to securely search over encrypted data through keywords and selectively retrieve files of interest without capturing any relevance of data files or search keywords, and fuzzy keyword search on encrypted data allows minor typos and format inconsistencies, secure ranked keyword search captures the relevance of data files and returns the results that are wanted most by users. These techniques function unilaterally, which greatly reduces the system usability and efficiency. In this paper, for the first time, we define and solve the problem of privacy-preserving ranked fuzzy keyword search over encrypted cloud data. Ranked fuzzy keyword search greatly enhances system usability and efficiency when exact match fails. It returns the matching files in a ranked order with respect to certain relevance criteria (e.g., keyword frequency) based on keyword similarity semantics. In our solution, we exploit the edit distance to quantify keyword similarity and dictionary-based fuzzy set construction to construct fuzzy keyword sets, which greatly reduces the index size, storage and communication costs. We choose the efficient similarity measure of \"coordinate matching\", i.e., as many matches as possible, to obtain the relevance of data files to the search keywords.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT.2013.44","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

As Cloud Computing becomes popular, more and more data owners prefer to store their data into the cloud for great flexibility and economic savings. In order to protect the data privacy, sensitive data usually have to be encrypted before outsourcing, which makes effective data utilization a challenging task. Although traditional searchable symmetric encryption schemes allow users to securely search over encrypted data through keywords and selectively retrieve files of interest without capturing any relevance of data files or search keywords, and fuzzy keyword search on encrypted data allows minor typos and format inconsistencies, secure ranked keyword search captures the relevance of data files and returns the results that are wanted most by users. These techniques function unilaterally, which greatly reduces the system usability and efficiency. In this paper, for the first time, we define and solve the problem of privacy-preserving ranked fuzzy keyword search over encrypted cloud data. Ranked fuzzy keyword search greatly enhances system usability and efficiency when exact match fails. It returns the matching files in a ranked order with respect to certain relevance criteria (e.g., keyword frequency) based on keyword similarity semantics. In our solution, we exploit the edit distance to quantify keyword similarity and dictionary-based fuzzy set construction to construct fuzzy keyword sets, which greatly reduces the index size, storage and communication costs. We choose the efficient similarity measure of "coordinate matching", i.e., as many matches as possible, to obtain the relevance of data files to the search keywords.
基于加密云数据的保隐私排序模糊关键字搜索
随着云计算的流行,越来越多的数据所有者倾向于将数据存储到云中,以获得极大的灵活性和经济效益。为了保护数据隐私,敏感数据通常需要在外包之前进行加密,这使得有效利用数据成为一项具有挑战性的任务。虽然传统的可搜索对称加密方案允许用户通过关键字安全地搜索加密数据,并有选择地检索感兴趣的文件,而不会捕获数据文件或搜索关键字的任何相关性,并且对加密数据的模糊关键字搜索允许轻微的拼写错误和格式不一致,但安全排名关键字搜索捕获数据文件的相关性并返回用户最需要的结果。这些技术的功能是单方面的,大大降低了系统的可用性和效率。本文首次定义并解决了加密云数据上的隐私保护排序模糊关键字搜索问题。排序模糊关键字搜索在精确匹配失败的情况下,大大提高了系统的可用性和效率。它根据关键字相似语义,按照特定的相关标准(例如,关键字频率)按顺序返回匹配的文件。在我们的解决方案中,我们利用编辑距离来量化关键字相似度,并基于字典构建模糊关键字集来构建模糊关键字集,从而大大减少了索引大小、存储和通信成本。我们选择“坐标匹配”的高效相似性度量,即尽可能多的匹配,以获得数据文件与搜索关键词的相关性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信