CryptoDB
Secret sharing schemes on access structures with intersection number equal to one
| Authors: | |
|---|---|
| Download: | |
| Abstract: | The characterization of ideal access structures and the search for bounds on the optimal information rate are two important problems in secret sharing. These problems are studied in this paper for access structures with intersection number equal to one, that is, access structures such that there is at most one participant in the intersection of any two different minimal qualified subsets. The main result in this work is the complete characterization of the ideal access structures with intersection number equal to one. Besides, bounds on the optimal information rate are provided for the non-ideal case. |
BibTeX
@misc{eprint-2002-11629,
title={Secret sharing schemes on access structures with intersection number equal to one},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / secret sharing, information rate, ideal secret sharing schemes},
url={http://eprint.iacr.org/2002/106},
note={This is a preliminary version of the paper that appeared in Discrete Applied Mathematics. A previous version appeared in the Proceedings of SCN'02, Amalfi, Italy, 2002 matcpl@mat.upc.es 13528 received 30 Jul 2002, last revised 15 Jan 2007},
author={Jaume Martí-Farré and Carles Padró},
year=2002
}