Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2017 | public
Book Section - Chapter

Secret sharing with optimal decoding and repair bandwidth

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 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.

Additional Information

© 2017 IEEE. This work was supported in part by the Caltech Lee Center.

Additional details

Created:
August 19, 2023
Modified:
October 17, 2023