Paper 2002/050

Secret sharing schemes with three or four minimal qualified subsets

Jaume Martí-Farré and Carles Padró

Abstract

In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
secret sharing schemesinformation rateideal secret sharing schemeslinear secret sharing schemes
Contact author(s)
matcpl @ mat upc es
History
2002-04-19: received
Short URL
https://ia.cr/2002/050
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2002/050,
      author = {Jaume Martí-Farré and Carles Padró},
      title = {Secret sharing schemes with three or four minimal qualified subsets},
      howpublished = {Cryptology ePrint Archive, Paper 2002/050},
      year = {2002},
      note = {\url{https://eprint.iacr.org/2002/050}},
      url = {https://eprint.iacr.org/2002/050}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.