Secure RAID schemes for distributed storage

Secure RAID schemes for distributed storage
复制标题

分布式存储的安全 RAID 方案

DOI:
--
复制
发表时间:
2016
期刊:
International Symposium on Information Theory
影响因子:
--
通讯作者:
Jehoshua Bruck
Jehoshua Bruck
中科院分区:
--
文献类型:
--
作者:
Wentao Huang;Jehoshua Bruck

文献摘要

被引文献

相似文献

我们提出安全磁盘阵列冗余(RAID),即低复杂度的方案,以分布式方式存储信息,该方式对节点故障有恢复能力且能抵御节点窃听。我们将系统编码的概念推广到安全RAID,并表明系统方案在编码、解码和随机访问的效率方面具有显著优势。对于实际的高速率情况,我们从广泛应用于RAID架构的阵列码——EVENODD码和B码构建了三个基于异或(XOR)的具有最优编码和解码复杂度的系统安全RAID方案。这些方案能最优地容忍两个节点故障和两个窃听节点。对于更一般的参数,我们从里德 - 所罗门码构建了高效的系统安全RAID方案。我们的结果表明,在RAID架构中构建“无密钥”的信息理论安全是可行的。
We propose secure RAID, i.e., low-complexity schemes to store information in a distributed manner that is resilient to node failures and resistant to node eavesdropping. We generalize the concept of systematic encoding to secure RAID and show that systematic schemes have significant advantages in the efficiencies of encoding, decoding and random access. For the practical high rate regime, we construct three XOR-based systematic secure RAID schemes with optimal encoding and decoding complexities, from the EVENODD codes and B codes, which are array codes widely used in the RAID architecture. These schemes optimally tolerate two node failures and two eavesdropping nodes. For more general parameters, we construct efficient systematic secure RAID schemes from Reed-Solomon codes. Our results suggest that building “keyless”, information-theoretic security into the RAID architecture is practical.