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 July 9, 2018 | Draft
Report Open

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

Created:
August 19, 2023
Modified:
January 14, 2024