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. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 609-613. ISBN 978-1-5090-4096-4.

Full text is not posted in this repository. Consult Related URLs below.

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:Book Section
Related URLs:
URLURL TypeDescription ItemTechnical Report
Huang, Wentao0000-0003-0963-3624
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© 2017 IEEE. This work was supported in part by the Caltech Lee Center.
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Record Number:CaltechAUTHORS:20170816-162125720
Persistent URL:
Official Citation:W. Huang and J. Bruck, "Secure RAID schemes from EVENODD and STAR codes," 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017, pp. 609-613. doi: 10.1109/ISIT.2017.8006600
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:80527
Deposited By: Kristin Buxton
Deposited On:16 Aug 2017 23:26
Last Modified:22 Nov 2019 09:58

Repository Staff Only: item control page