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. In: 2017 IEEE International Symposium on Information Theory (ISIT). IEEE , Piscataway, NJ, pp. 1813-1817. 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:


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 and optimal repair bandwidth for arbitrary parameters. The construction leads to a family of regenerating codes allowing centralized repair of multiple node failures with small sub-packetization.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
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-153318334
Persistent URL:
Official Citation:W. Huang and J. Bruck, "Secret sharing with optimal decoding and repair bandwidth," 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017, pp. 1813-1817. doi: 10.1109/ISIT.2017.8006842
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:80514
Deposited By: Kristin Buxton
Deposited On:16 Aug 2017 23:27
Last Modified:22 Nov 2019 09:58

Repository Staff Only: item control page