Cryptology ePrint Archive: Report 2019/1397

How to compartment secrets

Gaëlle Candel and Rémi Géraud-Stewart and David Naccache

Abstract: Secret sharing splits a secret $s$ into $\ell$ shares in such a way that $k\leq \ell$ shares suffice to reconstruct $s$. Let $\rho_{i,j}$ be the probability that shareholder $i$ disclose their share to shareholder $j$, with $0 \leq i,j < n$.

Given $k \leq \ell \leq n$, to whom $\ell$ individuals should we hand shares, if we wish to minimize the probability that one of them reconstitutes $s$?

Category / Keywords: cryptographic protocols / secret sharing, secure storage, algorithms

Original Publication (in the same form): WISTP 2019

Date: received 3 Dec 2019

Contact author: gaelle candel at ens fr,remi geraud@ens fr,david naccache@ens fr

Available format(s): PDF | BibTeX Citation

Version: 20191204:082204 (All versions of this report)

Short URL: ia.cr/2019/1397


[ Cryptology ePrint archive ]