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ženo v:
Podrobná bibliografie
Vydáno v:Journal of mathematical cryptology Ročník 4; číslo 2; s. 95 - 120
Hlavní autoři: Martí-Farré Jaume, Padró Carles
Médium: Journal Article
Jazyk:angličtina
Vydáno: De Gruyter 01.10.2010
Témata:
ideal secret sharing schemes
matroids
optimization of secret sharing schemes for general access structures
polymatroids
secret sharing
ISSN:1862-2976, 1862-2984
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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