On secret sharing schemes, matroids and polymatroids

Journal of Mathematical Cryptology

Padró Carles¹  Martí-Farré Jaume² 

[1] Universitat Politècnica de Catalunya, Carrer de Jordi Girona 1–3, 08034 Barcelona, Spain. E-mail: [e-mail];Universitat Politècnica de Catalunya, Carrer de Jordi Girona 1–3, 08034 Barcelona, Spain. E-mail: [e-mail];

关键词: secret sharing;    optimization of secret sharing schemes for general access structures;    ideal secret sharing schemes;    matroids;    polymatroids;   

DOI  :  10.1515/jmc.2010.004

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown