Paper 2002/050 Original: eprint.iacr.org/2002/050 ↗
Secret sharing schemes with three or four minimal qualified subsets
Abstract
In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2002-04-19: last updated
- 2002-04-19: published
- Short URL
- https://ia.cr/2002/050
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2002/050,
author = {Jaume Martí-Farré and Carles Padró},
title = {Secret sharing schemes with three or four minimal qualified subsets},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/050},
year = {2002},
url = {https://eprint.iacr.org/2002/050}
}