期刊文献+

云存储中一种抗窃听攻击的弱安全再生码

Weakly Secure Regenerating Codes for Cloud Storage against Eavesdropper
下载PDF
导出
摘要 纠删码和再生码是保证云存储可靠性的有效机制,但是它们并不能提供节点被窃听情况下存储数据的机密性。该文设计了两类抗窃听攻击的弱安全再生码方案,方案结合All-or-Nothing变换与精确修复再生码策略,保证了攻击者在窃听能力有限的情况下无法获取关于原始数据符号的任何有意义信息,同时具有较小的数据修复带宽。该文给出了通用编码构造方法,证明了其安全性,并通过实验进行了对比分析,结果表明与其它安全再生码相比该方案的编解码时间更短,且具有更好的秘密数据存储能力。 Erasure codes and regenerating codes can guarantee data reliability, but fail to provide data confidential when some nodes are observed by eavesdropper. Thus, two regenerating code schemes satisfying the security property against the eavesdropper are proposed in this paper. Combining the All-or-Nothing transform and exact repair regenerating codes, the proposed schemes not only ensure that an intruder eavesdropping limited number of nodes are unable to obtain any meaningful information about the original data symbols, but also provide data reliability with low repair bandwidth. Furthermore, a general construction method is presented, and the security is proved, and the performance of the proposed scheme is evaluated by a serial of experiments. The result shows that the proposed schemes achieve faster encode/decode procedures and better secrecy capacity compared with other secure regenerating coding schemes or threshold storage schemes.
出处 《电子与信息学报》 EI CSCD 北大核心 2014年第5期1221-1228,共8页 Journal of Electronics & Information Technology
关键词 云存储 再生码 安全 窃听 All-or-Nothing变换 Cloud storage Regenerating codes Security Eavesdropper All-or-Nothing transform
  • 相关文献

参考文献20

  • 1Bessani A,Correia M,Quarcsma B,et al.DepSky:dependable and secure storage in a cloud-of-clouds[C].Proceedings of ACM EuroSys,Salzburg,Austria,2011:31-46.
  • 2Dimakis A G,Godfrey P G,Wu Y,et al.Network coding for distributed storage systems[J].IEEE Transactions on InfoTvnation Theory,2010,56(9):4539-4551.
  • 3Shamir A.How to share a secret[J].Communications of the ACM,1979,22(11):612-613.
  • 4Yamamoto H.Secret sharing system using(k,l,n)threshold scheme[J].Electronics and Communications in Yapan(Part I:Communications),1986,69(9):46-54.
  • 5Oliveira P F,Lima L,Vinhoza T T V,et al.Coding for trusted storage in untrusted networks[J].IEEE Transactions on Information Forensics and Security,2012,7(6):1890-1899.
  • 6Kurihara M and Kuwakado H.Secret sharing schemes based on minimum bandwidth regenerating codes[C].2012 International Symposium on Information Theory and its Applications(ISITA),Honolulu,Hawaii,USA,2012:255-259.
  • 7Rawat A S,Koyluoglu O O,Silberstein N,et al.Optimal locally repairable and secure codes for distributed storage systems[OL].http://arxiv.org/pdf/1210.6594v2.pdf,2013.
  • 8Rawat A S,Koyluoglu O O,Silberstein N,et al.Secure locally repairable cedes for distributed storage systems[OL].https://webspace.utexas.edu/ok 756/www/pdfs/ISIW13\_Se crecyLocal.pdf,2013.
  • 9Pawar S,Rouayheb E S,and Ramchandran K.Securing dynamic distributed storage systems against eavesdropping and adversarial attacks[J].IEEE Transactions on Information Theory,2012,58(10):6734-6753.
  • 10Shah N B,Rashmi K V,and Kumar P V.Information-theoretically secure regenerating codes for distributed storage[C].Proceedings of IEEE Global Communications Conference(GLOBECOM),Houston,TX,USA,2011:1-5.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部