On secret sharing schemes, matroids and polymatroids
Martí-Farré Jaume, Padró Carles
Journal of Mathematical Cryptology · 2010
doi:10.1515/jmc.2010.004 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.