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}
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.