Succinct Computational Secret Sharing

ePrint Report: Succinct Computational Secret Sharing

Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan

A secret-sharing scheme enables a dealer to share a secret $s$ among $n$ parties such that only authorized subsets of parties, specified by a monotone access structure $f:\{0,1\}^n\to\{0,1\}$, can reconstruct $s$ from their shares. Other subsets of parties learn nothing about $s$.


The question of minimizing the (largest) share size for a given $f$ has been the subject of a large body …

access amos computational eprint report report secret share sharing