A Caltech Library Service

Secure RAID Schemes from EVENODD and STAR Codes

Huang, Wentao and Bruck, Jehoshua (2017) Secure RAID Schemes from EVENODD and STAR Codes. Parallel and Distributed Systems Group Technical Reports, 136. California Institute of Technology , Pasadena, CA. (Unpublished)

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


We study 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 describe a technique to shorten the secure EVENODD scheme in [6], which can optimally tolerate 2 node failures and 2 eavesdropping nodes. The shortening technique allows us to obtain secure EVENODD schemes of arbitrary lengths, which is important for practical application. We also construct a new secure RAID scheme from the STAR code. The scheme can tolerate 3 node failures and 3 eavesdropping nodes with optimal encoding/decoding and random access complexity.

Item Type:Report or Paper (Technical Report)
Related URLs:
URLURL TypeDescription Report ItemConference 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
Series Name:Parallel and Distributed Systems Group Technical Reports
Issue or Number:136
Record Number:CaltechAUTHORS:20180709-101600551
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:87637
Deposited By: George Porter
Deposited On:09 Jul 2018 17:26
Last Modified:22 Nov 2019 09:58

Repository Staff Only: item control page