Paper 2002/106

Secret sharing schemes on access structures with intersection number equal to one

Jaume Marti-Farre and Carles Padro

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.

Note: 15 January 2007: Publication Info updated.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. 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
Keywords
secret sharinginformation rateideal secret sharing schemes
Contact author(s)
matcpl @ mat upc es
History
2007-01-15: revised
2002-08-02: received
See all versions
Short URL
https://ia.cr/2002/106
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2002/106,
      author = {Jaume Marti-Farre and Carles Padro},
      title = {Secret sharing schemes on access structures with intersection  number equal to one},
      howpublished = {Cryptology ePrint Archive, Paper 2002/106},
      year = {2002},
      note = {\url{https://eprint.iacr.org/2002/106}},
      url = {https://eprint.iacr.org/2002/106}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.