Paper 2013/047 Original: eprint.iacr.org/2013/047 ↗
Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes
Abstract
Superpolynomial lower bounds on the average information ratio of linear secret sharing scheme are presented in this note for the first time. The previously known superpolynomial lower bounds applied only to the average information ratio of linear schemes in which the secret is a single field element. The new bounds are obtained by a simple adaptation of the techniques in those previous works.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2013-01-30: last updated
- 2013-01-30: published
- Short URL
- https://ia.cr/2013/047
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2013/047,
author = {Carles Padro},
title = {Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/047},
year = {2013},
url = {https://eprint.iacr.org/2013/047}
}