Published January 2017
| Submitted
Technical Report
Open
Secure RAID Schemes from EVENODD and STAR Codes
- Creators
-
Huang, Wentao
-
Bruck, Jehoshua
Chicago
An error occurred while generating the citation.
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.
Attached Files
Submitted - etr136.pdf
Files
etr136.pdf
Files
(259.6 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:185827c2bbacf6ea17f1af78e462ae2f
|
259.6 kB | Preview Download |
Additional details
- Eprint ID
- 87637
- Resolver ID
- CaltechAUTHORS:20180709-101600551
- Created
-
2018-07-09Created from EPrint's datestamp field
- Updated
-
2019-11-22Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group
- Series Name
- Parallel and Distributed Systems Group Technical Reports
- Series Volume or Issue Number
- 136
- Other Numbering System Name
- PARADISE
- Other Numbering System Identifier
- etr-136