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

Bibliographic Details
Main Authors: Martí-Farré Jaume, Padró Carles
Format: Article
Language:English
Published: De Gruyter 2010-10-01
Series:Journal of Mathematical Cryptology
Subjects:
Online Access:https://doi.org/10.1515/jmc.2010.004