加密云数据安全多关键字搜索两步排名

Jun Xu, Weiming Zhang, Ce Yang, Jiajia Xu, Nenghai Yu
{"title":"加密云数据安全多关键字搜索两步排名","authors":"Jun Xu, Weiming Zhang, Ce Yang, Jiajia Xu, Nenghai Yu","doi":"10.1109/CSC.2012.26","DOIUrl":null,"url":null,"abstract":"To protect privacy of users, sensitive data need to be encrypted before outsourcing to cloud, which makes effective data retrieval a very tough task. In this paper, we proposed a novel order-preserving encryption(OPE) based ranked search scheme over encrypted cloud data, which uses the encrypted keyword frequency to rank the results and provide accurate results via two-step ranking strategy. The first step coarsely ranks the documents with the measure of coordinate matching, i.e., classifying the documents according to the number of query terms included in each document. In the second step, for each category obtained in the first step, a fine ranking process is executed by adding up the encrypted score. Extensive experiments show that this new method is indeed an advanced solution for secure multi-keyword retrieval.","PeriodicalId":183800,"journal":{"name":"2012 International Conference on Cloud and Service Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Two-Step-Ranking Secure Multi-Keyword Search over Encrypted Cloud Data\",\"authors\":\"Jun Xu, Weiming Zhang, Ce Yang, Jiajia Xu, Nenghai Yu\",\"doi\":\"10.1109/CSC.2012.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To protect privacy of users, sensitive data need to be encrypted before outsourcing to cloud, which makes effective data retrieval a very tough task. In this paper, we proposed a novel order-preserving encryption(OPE) based ranked search scheme over encrypted cloud data, which uses the encrypted keyword frequency to rank the results and provide accurate results via two-step ranking strategy. The first step coarsely ranks the documents with the measure of coordinate matching, i.e., classifying the documents according to the number of query terms included in each document. In the second step, for each category obtained in the first step, a fine ranking process is executed by adding up the encrypted score. Extensive experiments show that this new method is indeed an advanced solution for secure multi-keyword retrieval.\",\"PeriodicalId\":183800,\"journal\":{\"name\":\"2012 International Conference on Cloud and Service Computing\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Cloud and Service Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSC.2012.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Cloud and Service Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSC.2012.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

为了保护用户的隐私,敏感数据需要在外包到云之前进行加密,这使得有效的数据检索成为一项非常艰巨的任务。本文提出了一种新的基于保序加密(OPE)的加密云数据排序搜索方案,该方案利用加密后的关键字频率对搜索结果进行排序,并通过两步排序策略提供准确的搜索结果。第一步使用坐标匹配度量对文档进行粗略排序,即根据每个文档中包含的查询词的数量对文档进行分类。在第二步中,对于第一步中获得的每个类别,通过将加密分数相加来执行精细排名过程。大量的实验表明,该方法确实是多关键字安全检索的一种先进解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Two-Step-Ranking Secure Multi-Keyword Search over Encrypted Cloud Data
To protect privacy of users, sensitive data need to be encrypted before outsourcing to cloud, which makes effective data retrieval a very tough task. In this paper, we proposed a novel order-preserving encryption(OPE) based ranked search scheme over encrypted cloud data, which uses the encrypted keyword frequency to rank the results and provide accurate results via two-step ranking strategy. The first step coarsely ranks the documents with the measure of coordinate matching, i.e., classifying the documents according to the number of query terms included in each document. In the second step, for each category obtained in the first step, a fine ranking process is executed by adding up the encrypted score. Extensive experiments show that this new method is indeed an advanced solution for secure multi-keyword retrieval.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A New Task Scheduling Algorithm in Hybrid Cloud Environment A Resource-Oriented Middleware Framework for Heterogeneous Internet of Things Cloud Storage-oriented Secure Information Gateway A Fast Privacy-Preserving Multi-keyword Search Scheme on Cloud Data Combined Cache Policy for Service Workflow Execution Acceleration
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1