A Caltech Library Service

Secret Sharing with Optimal Decoding and Repair Bandwidth

Huang, Wentao and Bruck, Jehoshua (2017) Secret Sharing with Optimal Decoding and Repair Bandwidth. Parallel and Distributed Systems Group Technical Reports, 135. California Institute of Technology , Pasadena, CA. (Unpublished)

[img] PDF - Draft Version
See Usage Policy.


Use this Persistent URL to link to this item:


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.

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:135
Record Number:CaltechAUTHORS:20180709-102239656
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:87638
Deposited By: George Porter
Deposited On:09 Jul 2018 17:30
Last Modified:22 Nov 2019 09:58

Repository Staff Only: item control page