Published January 2017
| Draft
Technical Report
Open
Secret Sharing with Optimal Decoding and Repair Bandwidth
- Creators
-
Huang, Wentao
-
Bruck, Jehoshua
Chicago
An error occurred while generating the citation.
Abstract
This paper studies the communication efficiency of threshold secret sharing schemes. We construct a family of Shamir's schemes with asymptotically optimal decoding bandwidth for arbitrary parameters. We also construct a family of secret sharing schemes with both optimal decoding bandwidth and optimal repair bandwidth for arbitrary parameters. The construction also leads to a family of regenerating codes allowing centralized repair of multiple node failures with small sub-packetization.
Attached Files
Draft - etr135.pdf
Files
etr135.pdf
Files
(223.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:3ed9ce685eb583a9973ca03bdd35c843
|
223.0 kB | Preview Download |
Additional details
- Eprint ID
- 87638
- Resolver ID
- CaltechAUTHORS:20180709-102239656
- 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
- 135
- Other Numbering System Name
- PARADISE
- Other Numbering System Identifier
- etr-135