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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematical cryptology Jg. 4; H. 2; S. 95 - 120
Hauptverfasser: Martí-Farré Jaume, Padró Carles
Format: Journal Article
Sprache:Englisch
Veröffentlicht: De Gruyter 01.10.2010
Schlagworte:
ideal secret sharing schemes
matroids
optimization of secret sharing schemes for general access structures
polymatroids
secret sharing
ISSN:1862-2976, 1862-2984
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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