Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads
Rawad Bitar, Salim El Rouayheb · IEEE Transactions on Information Theory · 2016
We study the communication efficient secret sharing (CESS) problem. A classical threshold secret sharing scheme encodes a secret into n shares given to n parties, such that any set of at least t, tn. However, Staircase codes may require dividing the secret and the shares into many symbols. We also describe how Staircase codes can be used to construct threshold changeable secret sharing with minimum storage cost, i.e., minimum share size.