P. M., M. Hamdi, Vijayakumar Varadarajan, B. Rawal, M. Maode
{"title":"Building an Authentic and Ethical Keyword Search by applying Decentralised (Blockchain) Verification","authors":"P. M., M. Hamdi, Vijayakumar Varadarajan, B. Rawal, M. Maode","doi":"10.1109/infocomwkshps50562.2020.9162859","DOIUrl":null,"url":null,"abstract":"As a very appealing computing standard, cloud computing makes it feasible for resource constrained clients to experience rate effective and flexible resources at ease. In the prevailing systems, the conventional cloud storage scheme is bound to operate its primitive functions in centralized mode. This reason possess problems like data availability, information protection and excessive operational charge. With the improvement of block chain generation, the decentralized scheme has entered the general public view. Compared to contemporary and cutting edge cloud storage, they are predicted to be more scalable, secured and comfortable. But, the use of end-to-end encryption in a decentralized scheme, limits the search functionality as the existing searchable encryption methods are designed only for the centralized device. Moreover, the existing decentralized cloud storage doesn't restrict any data user to get access to all of the files for any keyword search made purposefully through them. Thus, in this manner, user integrity of files and keyword searches are compromised throughout the network. Therefore, as a manner to solve these complications, we systematically join techniques of encryption and hashing to furnish reliable keyword search over encrypted files in decentralized storage. Consequently using the block chain system, the architecture remains incorruptible and protects all the confidential files and keywords in a fully controlled file access environment.","PeriodicalId":104136,"journal":{"name":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/infocomwkshps50562.2020.9162859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44
Abstract
As a very appealing computing standard, cloud computing makes it feasible for resource constrained clients to experience rate effective and flexible resources at ease. In the prevailing systems, the conventional cloud storage scheme is bound to operate its primitive functions in centralized mode. This reason possess problems like data availability, information protection and excessive operational charge. With the improvement of block chain generation, the decentralized scheme has entered the general public view. Compared to contemporary and cutting edge cloud storage, they are predicted to be more scalable, secured and comfortable. But, the use of end-to-end encryption in a decentralized scheme, limits the search functionality as the existing searchable encryption methods are designed only for the centralized device. Moreover, the existing decentralized cloud storage doesn't restrict any data user to get access to all of the files for any keyword search made purposefully through them. Thus, in this manner, user integrity of files and keyword searches are compromised throughout the network. Therefore, as a manner to solve these complications, we systematically join techniques of encryption and hashing to furnish reliable keyword search over encrypted files in decentralized storage. Consequently using the block chain system, the architecture remains incorruptible and protects all the confidential files and keywords in a fully controlled file access environment.