Jian Liu, Kun Huang, Hong Rong, Huimei Wang, Ming Xian
{"title":"Efficient and secure data forwarding for erasure-code-based cloud storage","authors":"Jian Liu, Kun Huang, Hong Rong, Huimei Wang, Ming Xian","doi":"10.1109/ICCW.2015.7247445","DOIUrl":null,"url":null,"abstract":"Cloud computing is a promising computing paradigm which has drawn extensive attention from both academia and industry. Since that the cloud is very likely to be outside of the trust domain of the users, serious concerns over the confidentiality of the outsourced data are arising. Traditional encryption methods guarantee data confidentiality, but also limit the functionality of the cloud storage as few operations are supported over encrypted data. The main technique contribution of this paper is that we present an efficient data forwarding scheme for the erasure-coded and encrypted cloud, which enforces the cloud not only provide data reliability and confidentiality, but also support the functionality that the encrypted data can be forwarded to another user without being retrieved back. Specifically, we design an all-or-nothing transform based encryption and a variant of ElGamal-based proxy re-encryption algorithms, blending them with the Reed-Solomon erasure code, our scheme is quite more efficient compared with previous studies and only needs to update partial data blocks instead of the whole file for data forwarding. In addition, our scheme also satisfies another practical property that the original data owner can no longer decrypt or forward the re-encrypted data again to other users after a complete data forwarding, which is termed to be “original inaccessibility” in our study. Analysis shows that our scheme is secure and satisfactory. Finally we theoretically and experimentally evaluate the performance of our scheme and the results indicate that our scheme is efficient in the procedure of file dispersal, forward and retrieval.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":"460 1","pages":"1820-1826"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247445","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Cloud computing is a promising computing paradigm which has drawn extensive attention from both academia and industry. Since that the cloud is very likely to be outside of the trust domain of the users, serious concerns over the confidentiality of the outsourced data are arising. Traditional encryption methods guarantee data confidentiality, but also limit the functionality of the cloud storage as few operations are supported over encrypted data. The main technique contribution of this paper is that we present an efficient data forwarding scheme for the erasure-coded and encrypted cloud, which enforces the cloud not only provide data reliability and confidentiality, but also support the functionality that the encrypted data can be forwarded to another user without being retrieved back. Specifically, we design an all-or-nothing transform based encryption and a variant of ElGamal-based proxy re-encryption algorithms, blending them with the Reed-Solomon erasure code, our scheme is quite more efficient compared with previous studies and only needs to update partial data blocks instead of the whole file for data forwarding. In addition, our scheme also satisfies another practical property that the original data owner can no longer decrypt or forward the re-encrypted data again to other users after a complete data forwarding, which is termed to be “original inaccessibility” in our study. Analysis shows that our scheme is secure and satisfactory. Finally we theoretically and experimentally evaluate the performance of our scheme and the results indicate that our scheme is efficient in the procedure of file dispersal, forward and retrieval.