On secret sharing schemes, matroids and polymatroids

The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing. We explore in this paper the co...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of mathematical cryptology Vol. 4; no. 2; pp. 95 - 120
Main Authors:	Martí-Farré Jaume, Padró Carles
Format:	Journal Article
Language:	English
Published:	De Gruyter 01.10.2010
Subjects:	ideal secret sharing schemes matroids optimization of secret sharing schemes for general access structures polymatroids secret sharing
ISSN:	1862-2976, 1862-2984
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and very difficult open problem in secret sharing. We explore in this paper the connections of this open problem with matroids and polymatroids.
ISSN:	1862-2976 1862-2984
DOI:	10.1515/jmc.2010.004