The arXiv announcement for Secret Sharing from Non-Extractable Randomness opens by recalling a theorem of Bosley and Dodis (TCC 2007). That earlier result showed that a class of imperfect randomness sources—those sufficient for information-theoretic encryption of messages longer than the logarithm of the key length—must admit deterministic extraction of some property. The announcement's sentence is cut off, leaving the precise extraction guarantee unstated.

The paper's title suggests the authors are extending this line of work to secret sharing, a primitive in which a secret is split into shares that only reveal the secret when combined. The abstract does not yet provide details of the construction or the main theorem, as the announcement is truncated.

Because there is only one source, there are no conflicting accounts to reconcile. This digest is necessarily limited to what the abstract makes public.