Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes

Carles Padro

Paper 2013/047

Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes

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.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Unknown where it was published
Keywords: secet sharing linear secret sharing schemes lower bounds on the information ratio.
Contact author(s): cpadro @ ma4 upc edu
History: 2013-01-30: received
Short URL: https://ia.cr/2013/047
License: CC BY

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}
}