Design of New Multi Keyword Ranked Search Scheme and Validation for Cloud Computing

P. Tanwar, A. Khunteta, V. Goar
{"title":"Design of New Multi Keyword Ranked Search Scheme and Validation for Cloud Computing","authors":"P. Tanwar, A. Khunteta, V. Goar","doi":"10.1145/2979779.2979885","DOIUrl":null,"url":null,"abstract":"Cloud computing has been emerged as a revolution in the world of information technology. It provides a flexible and economic strategy for the sharing of resources management of data. Preservation of privacy and data security are the major concerns in the current scenario. To achieve the purpose of security and privacy number of schemes are analyzed and proposed to support keyword basis searching. In this paper we are going to design a Multi Keyword Ranked Search Scheme upon Cloud Data (MKRSCD), basically emphasizing on index and query. We can make expansion in the scheme with the help of already available secure inner product scheme and k nearest neighbor (kNN) technique. The secure inner product technique is not fit for our scheme MKRSCD, it is observed. The reason behind it is that the single randomness included is the scale factor for the generation of trapdoor, which does not provide optimum non-determinacy required by the unlinking of trapdoor as well as privacy of keyword requirement. Finally we are providing more advanced scheme MKRSCD-CM (Multi Keyword Ranked Search Scheme for Cloud Data in Known Ciphertext Model). To obtain the result, complete analysis of security and performance evaluation on experiments performed on the real world dataset which demonstrate that the scheme indeed accords with our proposed design goals.","PeriodicalId":298730,"journal":{"name":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on Advances in Information Communication Technology & Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2979779.2979885","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Cloud computing has been emerged as a revolution in the world of information technology. It provides a flexible and economic strategy for the sharing of resources management of data. Preservation of privacy and data security are the major concerns in the current scenario. To achieve the purpose of security and privacy number of schemes are analyzed and proposed to support keyword basis searching. In this paper we are going to design a Multi Keyword Ranked Search Scheme upon Cloud Data (MKRSCD), basically emphasizing on index and query. We can make expansion in the scheme with the help of already available secure inner product scheme and k nearest neighbor (kNN) technique. The secure inner product technique is not fit for our scheme MKRSCD, it is observed. The reason behind it is that the single randomness included is the scale factor for the generation of trapdoor, which does not provide optimum non-determinacy required by the unlinking of trapdoor as well as privacy of keyword requirement. Finally we are providing more advanced scheme MKRSCD-CM (Multi Keyword Ranked Search Scheme for Cloud Data in Known Ciphertext Model). To obtain the result, complete analysis of security and performance evaluation on experiments performed on the real world dataset which demonstrate that the scheme indeed accords with our proposed design goals.
面向云计算的多关键字排序搜索新方案设计及验证
云计算已经成为信息技术领域的一场革命。它为资源共享和数据管理提供了一种灵活、经济的策略。保护隐私和数据安全是当前情况下的主要关注点。为了达到安全和隐私的目的,分析并提出了支持基于关键字的搜索的方案。在本文中,我们将设计一个基于云数据的多关键字排名搜索方案(MKRSCD),主要侧重于索引和查询。我们可以利用已有的安全内积方案和k近邻技术对该方案进行扩展。结果表明,安全内积技术并不适合我们的方案MKRSCD。其原因是所包含的单一随机性是生成活板门的尺度因子,不能提供活板门解链所需要的最优不确定性以及关键字的私密性要求。最后,我们提供了更高级的方案MKRSCD-CM(已知密文模型中云数据的多关键字排名搜索方案)。为了获得结果,在真实世界数据集上进行了完整的安全性分析和性能评估实验,证明该方案确实符合我们提出的设计目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信