2015/12/09 by Bitar, Rawad, Rouayheb, Salim El
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1512.02990
We study the communication efficient secret sharing (CESS) problem introduced by Huang, Langberg, Kliewer and Bruck. A classical threshold secret sharing scheme randomly encodes a secret into n shares given to n parties, such that any set of at least t, t n. We describe two explicit constructions of Staircase codes that achieve minimum communication and read overheads respectively for a fixed d, and universally for all possible values of d, t≤ d≤ n.