Welcome to the resource topic for 2013/047
Title:
Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes
Authors: Carles Padro
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.
ePrint: https://eprint.iacr.org/2013/047
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .