A dynamic searchable encryption scheme for secure cloud server operation reserving multi-keyword ranked search

Tasnim Kabir, Muhammad Abdullah Adnan
{"title":"A dynamic searchable encryption scheme for secure cloud server operation reserving multi-keyword ranked search","authors":"Tasnim Kabir, Muhammad Abdullah Adnan","doi":"10.1109/NSYSS2.2017.8267793","DOIUrl":null,"url":null,"abstract":"Cloud computing is becoming more and more popular day by day due to its maintenance, multitenancy and performance. Data owners are motivated to outsource their data to the cloud servers for resource pooling and productivity where multiple users can work on the same data concurrently. These servers offer great convenience and reduced cost for the computation, storage and management of data. But concerns can persist for loss of control over certain sensitive information. The complexity of security is largely intensified when data is distributed over a greater number of devices and data is shared among unrelated users. So these sensitive data should be encrypted for solving these security issues that many consumers cannot afford to tackle. In this paper, we present a dynamic searchable encryption scheme whose update operation can be completed by cloud server while reserving the ability to support multi-keyword ranked search. We have designed a scheme where dynamic operations on data like insert, update and delete are performed by cloud server without decrypting the data. Thus this scheme not only ensures dynamic operations on data but also provides a secure technique by performing those tasks without decryption. The state-of-the-art methods let the data users retrieve the data, re-encrypt it under the new policy and then send it again to the cloud. But our proposed method saves this high computational overhead by reducing the burden of performing dynamic operation by the data owners. The secure and widely used TF × IDF model is used along with kNN algorithm for construction of the index and generation of the query. We have used a tree-based index structure, so our proposed scheme can achieve a sub-linear search time. We have conducted experiments on Amazon EC2 cloud server with three datasets by updating a file, appending a file and deleting a file from the document collection and compared our result with the state-of-the-art method. Results show that our scheme has an average running time of 42ms which is 75% less than the existing method.","PeriodicalId":144799,"journal":{"name":"2017 4th International Conference on Networking, Systems and Security (NSysS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 4th International Conference on Networking, Systems and Security (NSysS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSYSS2.2017.8267793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Cloud computing is becoming more and more popular day by day due to its maintenance, multitenancy and performance. Data owners are motivated to outsource their data to the cloud servers for resource pooling and productivity where multiple users can work on the same data concurrently. These servers offer great convenience and reduced cost for the computation, storage and management of data. But concerns can persist for loss of control over certain sensitive information. The complexity of security is largely intensified when data is distributed over a greater number of devices and data is shared among unrelated users. So these sensitive data should be encrypted for solving these security issues that many consumers cannot afford to tackle. In this paper, we present a dynamic searchable encryption scheme whose update operation can be completed by cloud server while reserving the ability to support multi-keyword ranked search. We have designed a scheme where dynamic operations on data like insert, update and delete are performed by cloud server without decrypting the data. Thus this scheme not only ensures dynamic operations on data but also provides a secure technique by performing those tasks without decryption. The state-of-the-art methods let the data users retrieve the data, re-encrypt it under the new policy and then send it again to the cloud. But our proposed method saves this high computational overhead by reducing the burden of performing dynamic operation by the data owners. The secure and widely used TF × IDF model is used along with kNN algorithm for construction of the index and generation of the query. We have used a tree-based index structure, so our proposed scheme can achieve a sub-linear search time. We have conducted experiments on Amazon EC2 cloud server with three datasets by updating a file, appending a file and deleting a file from the document collection and compared our result with the state-of-the-art method. Results show that our scheme has an average running time of 42ms which is 75% less than the existing method.
一种动态可搜索的安全云服务器操作加密方案,保留多关键字排序搜索
云计算由于其可维护性、多租户性和高性能而日益流行。数据所有者倾向于将他们的数据外包给云服务器,以实现资源池和生产力,这样多个用户可以并发地处理相同的数据。这些服务器为数据的计算、存储和管理提供了极大的便利和降低了成本。但对某些敏感信息失去控制的担忧仍然存在。当数据分布在更多的设备上,并且数据在不相关的用户之间共享时,安全性的复杂性大大增强。因此,这些敏感数据应该被加密,以解决许多消费者无法承担的安全问题。本文提出了一种动态可搜索的加密方案,其更新操作可以由云服务器完成,同时保留了支持多关键字排序搜索的能力。我们设计了一个方案,在不解密数据的情况下,云服务器对数据进行动态操作,如插入、更新和删除。因此,该方案不仅保证了对数据的动态操作,而且通过执行这些任务而不进行解密提供了一种安全技术。最先进的方法可以让数据用户检索数据,在新政策下重新加密,然后再次发送到云。但是我们提出的方法通过减少数据所有者执行动态操作的负担来节省这种高计算开销。安全且广泛使用的TF × IDF模型与kNN算法一起用于构建索引和生成查询。我们使用了基于树的索引结构,因此我们提出的方案可以实现亚线性的搜索时间。我们在Amazon EC2云服务器上使用三个数据集进行了实验,分别从文档集合中更新文件、追加文件和删除文件,并将我们的结果与最先进的方法进行了比较。结果表明,该方案的平均运行时间为42ms,比现有方法缩短了75%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信