Weakly secure regenerating codes for cloud storage against eavesdropper

被引：0

作者：

Liu, Jian ^{[1
]}

Wang, Hui-Mei ^{[1
]}

Xian, Ming ^{[1
]}

Huang, Kun ^{[1
]}

机构：

[1] State Key Lab. of Complex Electromagnetic Environ. Effects on Electronics and Information System, National University of Defense Technology

来源：

Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology | 2014年 / 36卷 / 05期

关键词：

All-or-Nothing transform; Cloud storage; Eavesdropper; Regenerating codes; Security;

D O I：

10.3724/SP.J.1146.2013.01035

中图分类号：

学科分类号：

摘要：

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.

引用

页码：1221 / 1228

页数：7

共 20 条

[1]

Bessani A., Correia M., Quaresma B., Et al., DepSky: dependable and secure storage in a cloud-of-clouds, Proceedings of ACM EuroSys, pp. 31-46, (2011)

[2]

Dimakis A.G., Godfrey P.G., Wu Y., Et al., Network coding for distributed storage systems, IEEE Transactions on Information Theory, 56, 9, pp. 4539-4551, (2010)

[3]

Shamir A., How to share a secret, Communications of the ACM, 22, 11, pp. 612-613, (1979)

[4]

Yamamoto H., Secret sharing system using (k, l, n) threshold scheme, Electronics and Communications in Japan (Part I: Communications), 69, 9, pp. 46-54, (1986)

[5]

Oliveira P.F., Lima L., Vinhoza T.T.V., Et al., Coding for trusted storage in untrusted networks, IEEE Transactions on Information Forensics and Security, 7, 6, pp. 1890-1899, (2012)

[6]

Kurihara M., Kuwakado H., Secret sharing schemes based on minimum bandwidth regenerating codes, 2012 International Symposium on Information Theory and its Applications (ISITA), pp. 255-259, (2012)

[7]

Rawat A.S., Koyluoglu O.O., Silberstein N., Et al., Optimal locally repairable and secure codes for distributed storage systems, (2013)

[8]

Rawat A.S., Koyluoglu O.O., Silberstein N., Et al., Secure locally repairable codes for distributed storage systems, (2013)

[9]

Pawar S., Rouayheb E.S., Ramchandran K., Securing dynamic distributed storage systems against eavesdroppingand adversarial attacks, IEEE Transactions on Information Theory, 58, 10, pp. 6734-6753, (2012)

[10]

Shah N.B., Rashmi K.V., Kumar P.V., Information-theoretically secure regenerating codes for distributed storage, Proceedings of IEEE Global Communications Conference (GLOBECOM), pp. 1-5, (2011)

← 1 2 →