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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of mathematical cryptology Ročník 4; číslo 2; s. 95 - 120
Hlavní autori:	Martí-Farré Jaume, Padró Carles
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	De Gruyter 01.10.2010
Predmet:	ideal secret sharing schemes matroids optimization of secret sharing schemes for general access structures polymatroids secret sharing
ISSN:	1862-2976, 1862-2984
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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