Paper 2019/1397 Original: eprint.iacr.org/2019/1397 ↗
How to compartment secrets
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
- Preprint.
- History
- 2019-12-04: last updated
- 2019-12-04: published
- Short URL
- https://ia.cr/2019/1397
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2019/1397,
author = {Gaëlle Candel and Rémi Géraud-Stewart and David Naccache},
title = {How to compartment secrets},
howpublished = {Cryptology {ePrint} Archive, Paper 2019/1397},
year = {2019},
url = {https://eprint.iacr.org/2019/1397}
}