Paper 2016/348

A Note on Non-Perfect Secret Sharing

Oriol Farràs, Sebastià Martín, and Carles Padró

Abstract

By using a recently introduced framework for non-perfect secret sharing, several known results on perfect secret sharing are generalized to non-perfect secret sharing schemes with constant increment, in which the amount of information provided by adding a single share to a set is either zero or some constant value. Specifically, we discuss ideal secret sharing schemes, constructions of efficient linear secret sharing schemes, and the search for lower bounds on the length of the shares. Similarly to perfect secret sharing, matroids and polymatroids are very useful to analyze these questions.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
Secret sharingNon-perfect secret sharingInformation RatioPolymatroid
Contact author(s)
oriol farras @ urv cat
History
2017-02-04: revised
2016-04-01: received
See all versions
Short URL
https://ia.cr/2016/348
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/348,
      author = {Oriol Farràs and Sebastià Martín and Carles Padró},
      title = {A Note on Non-Perfect Secret Sharing},
      howpublished = {Cryptology ePrint Archive, Paper 2016/348},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/348}},
      url = {https://eprint.iacr.org/2016/348}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.