A Caltech Library Service

Secure RAID Schemes for Distributed Storage

Huang, Wentao and Bruck, Jehoshua (2016) Secure RAID Schemes for Distributed Storage. California Institute of Technology , Pasadena, CA. (Unpublished)

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


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 or almost optimal encoding and decoding complexities, from the EVENODD codes and B codes, which are array codes widely used in the RAID architecture. The schemes can tolerate up to two node failures and two eavesdropping nodes. For more general parameters we construct systematic secure RAID schemes from Reed-Solomon codes, and show that they are significantly more efficient than Shamir’s secret sharing scheme. Our results suggest that building “keyless”, information-theoretic security into the RAID architecture is practical.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription Paper
Huang, Wentao0000-0003-0963-3624
Bruck, Jehoshua0000-0001-8474-0812
Group:Parallel and Distributed Systems Group
Other Numbering System:
Other Numbering System NameOther Numbering System ID
Record Number:CaltechAUTHORS:20160125-120110556
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:63931
Deposited On:25 Jan 2016 22:31
Last Modified:10 Nov 2021 23:23

Repository Staff Only: item control page