You are looking at a specific version 20191204:082204 of this paper.
See the latest version.
Paper 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$?
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. WISTP 2019
- Keywords
- secret sharingsecure storagealgorithms
- Contact author(s)
- gaelle candel @ ens fr,remi geraud @ ens fr,david naccache @ ens fr
- History
- 2019-12-04: received
- Short URL
- https://ia.cr/2019/1397
- License
-
CC BY
