Paper 2003/151
Secret sharing schemes on sparse homogeneous access structures with rank three
Jaume Martí-Farré and Carles Padró
Abstract
One of the main open problems in secret sharing is the characterization of the ideal access structures. This problem has been studied for several families of access structures with similar results. Namely, in all these families, the ideal access structures coincide with the vector space ones and, besides, the optimal information rate of a non-ideal access structure is at most
Note: 5 Jan 2007: Publication info updated
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. This is the preliminary version of the paper that appeared in ElectronicJournal of Combinatorics. A previous version appeared in the Proceedings of the International Workshop on Coding and Cryptography WCC 2003, Versailles, France.
- Keywords
- Secret sharingInformation rateIdeal secret sharing schemes.
- Contact author(s)
- matcpl @ mat upc es
- History
- 2007-01-05: last of 2 revisions
- 2003-07-31: received
- See all versions
- Short URL
- https://ia.cr/2003/151
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/151, author = {Jaume Martí-Farré and Carles Padró}, title = {Secret sharing schemes on sparse homogeneous access structures with rank three}, howpublished = {Cryptology {ePrint} Archive, Paper 2003/151}, year = {2003}, url = {https://eprint.iacr.org/2003/151} }