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) https://resolver.caltech.edu/CaltechAUTHORS:20180709-101600551
![]() |
PDF
- Submitted Version
See Usage Policy. 259kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20180709-101600551
Abstract
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: |
| |||||||||
ORCID: |
| |||||||||
Group: | Parallel and Distributed Systems Group | |||||||||
Other Numbering System: |
| |||||||||
Series Name: | Parallel and Distributed Systems Group Technical Reports | |||||||||
Issue or Number: | 136 | |||||||||
Record Number: | CaltechAUTHORS:20180709-101600551 | |||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20180709-101600551 | |||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
ID Code: | 87637 | |||||||||
Collection: | CaltechPARADISE | |||||||||
Deposited By: | George Porter | |||||||||
Deposited On: | 09 Jul 2018 17:26 | |||||||||
Last Modified: | 22 Nov 2019 09:58 |
Repository Staff Only: item control page