EFUMS:高效的文件上传和多关键字搜索加密云数据

M. Bhavya, N. PushpaC., J. Thriveni, R. VenugopalK.
{"title":"EFUMS:高效的文件上传和多关键字搜索加密云数据","authors":"M. Bhavya, N. PushpaC., J. Thriveni, R. VenugopalK.","doi":"10.1109/ICCCNT49239.2020.9225653","DOIUrl":null,"url":null,"abstract":"In the present era, cloud computing is built to provide many computation techniques and storage resources to the data user for later access. Data encryption is very important to ensure privacy before outsourcing it to the cloud server. Querying the cloud for encrypted data retrieval is a time-consuming process because of processing overhead and huge amount of data stored in cloud. In the existing system, the VPSearch scheme offers only verifiability of search results and privacy protection. It does not offer an efficient file uploading and index generation which consumes more time thereby slowing the searching process. It would be a challenging task to minimize the time to efficiently search on the cloud for a particular document. In order to overcome these challenges, we have proposed an efficient index generation scheme using tree based index technique with Greedy Depth-first search algorithm, that minimizes the file uploading and search time. The proposed EFUMS-Efficient File Upload and Mutli-Keyword Search over Encrypted Cloud Data scheme reduces the time taken to compute an index tree for all the files that are to be uploaded in a document and also helps to store the files in a structured tree format. This resulted in minimizing the document upload time and a faster and efficient data access using multi-keyword search.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"2 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"EFUMS: Efficient File Upload and Mutli-Keyword Search over Encrypted Cloud Data\",\"authors\":\"M. Bhavya, N. PushpaC., J. Thriveni, R. VenugopalK.\",\"doi\":\"10.1109/ICCCNT49239.2020.9225653\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the present era, cloud computing is built to provide many computation techniques and storage resources to the data user for later access. Data encryption is very important to ensure privacy before outsourcing it to the cloud server. Querying the cloud for encrypted data retrieval is a time-consuming process because of processing overhead and huge amount of data stored in cloud. In the existing system, the VPSearch scheme offers only verifiability of search results and privacy protection. It does not offer an efficient file uploading and index generation which consumes more time thereby slowing the searching process. It would be a challenging task to minimize the time to efficiently search on the cloud for a particular document. In order to overcome these challenges, we have proposed an efficient index generation scheme using tree based index technique with Greedy Depth-first search algorithm, that minimizes the file uploading and search time. The proposed EFUMS-Efficient File Upload and Mutli-Keyword Search over Encrypted Cloud Data scheme reduces the time taken to compute an index tree for all the files that are to be uploaded in a document and also helps to store the files in a structured tree format. This resulted in minimizing the document upload time and a faster and efficient data access using multi-keyword search.\",\"PeriodicalId\":6581,\"journal\":{\"name\":\"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)\",\"volume\":\"2 1\",\"pages\":\"1-6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCNT49239.2020.9225653\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCNT49239.2020.9225653","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在当今时代,云计算的建立是为了向数据用户提供许多计算技术和存储资源,供以后访问。在将数据外包给云服务器之前,数据加密对于确保隐私非常重要。由于处理开销和云中存储的大量数据,在云中查询加密数据检索是一个耗时的过程。在现有的系统中,VPSearch方案只提供搜索结果的可验证性和隐私保护。它不提供有效的文件上传和索引生成,这会消耗更多的时间,从而减慢搜索过程。最小化在云上有效搜索特定文档的时间将是一项具有挑战性的任务。为了克服这些挑战,我们提出了一种高效的索引生成方案,该方案采用基于树的索引技术和贪婪深度优先搜索算法,最大限度地减少了文件上传和搜索时间。提出的efums -高效文件上传和加密云数据上的多关键字搜索方案减少了为要在文档中上传的所有文件计算索引树的时间,也有助于以结构化树格式存储文件。这样可以最大限度地减少文档上传时间,并使用多关键字搜索实现更快、更高效的数据访问。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
EFUMS: Efficient File Upload and Mutli-Keyword Search over Encrypted Cloud Data
In the present era, cloud computing is built to provide many computation techniques and storage resources to the data user for later access. Data encryption is very important to ensure privacy before outsourcing it to the cloud server. Querying the cloud for encrypted data retrieval is a time-consuming process because of processing overhead and huge amount of data stored in cloud. In the existing system, the VPSearch scheme offers only verifiability of search results and privacy protection. It does not offer an efficient file uploading and index generation which consumes more time thereby slowing the searching process. It would be a challenging task to minimize the time to efficiently search on the cloud for a particular document. In order to overcome these challenges, we have proposed an efficient index generation scheme using tree based index technique with Greedy Depth-first search algorithm, that minimizes the file uploading and search time. The proposed EFUMS-Efficient File Upload and Mutli-Keyword Search over Encrypted Cloud Data scheme reduces the time taken to compute an index tree for all the files that are to be uploaded in a document and also helps to store the files in a structured tree format. This resulted in minimizing the document upload time and a faster and efficient data access using multi-keyword search.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信