Efficient and secure data forwarding for erasure-code-based cloud storage

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.
基于擦除码的云存储高效、安全的数据转发
云计算是一种很有前途的计算范式,已经引起了学术界和工业界的广泛关注。由于云很可能在用户的信任域之外,因此对外包数据的保密性产生了严重的担忧。传统的加密方法保证了数据的机密性,但也限制了云存储的功能,因为在加密数据上支持的操作很少。本文的主要技术贡献在于,我们提出了一种有效的数据转发方案,用于擦除编码和加密云,该方案使云不仅提供数据的可靠性和机密性,而且还支持加密数据可以转发给另一个用户而不被检索回来的功能。具体来说,我们设计了一种基于全有或全无变换的加密算法和一种基于elgamal的代理重加密算法的变体,并将它们与Reed-Solomon擦除码混合在一起,我们的方案比以前的研究更高效,只需要更新部分数据块而不是整个文件进行数据转发。此外,我们的方案还满足了另一个实用属性,即在数据转发完成后,原始数据所有者无法再对重新加密的数据进行解密或再次转发给其他用户,在我们的研究中称为“原始不可访问性”。分析表明,该方案是安全的、令人满意的。最后对该方案进行了理论和实验评价,结果表明该方案在文件分散、转发和检索过程中是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信