International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Secret sharing schemes with three or four minimal qualified subsets

Authors:
Jaume Martí-Farré
Carles Padró
Download:
URL: http://eprint.iacr.org/2002/050
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2002-11574,
  title={Secret sharing schemes with three or four minimal qualified subsets},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / secret sharing schemes, information rate, ideal secret sharing schemes, linear secret sharing schemes},
  url={http://eprint.iacr.org/2002/050},
  note={ matcpl@mat.upc.es 11796 received 19 Apr 2002},
  author={Jaume Martí-Farré and Carles Padró},
  year=2002
}