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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2010-10-01
|
| Series: | Journal of Mathematical Cryptology |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jmc.2010.004 |
| _version_ | 1817994840615419904 |
|---|---|
| author | Martí-Farré Jaume Padró Carles |
| author_facet | Martí-Farré Jaume Padró Carles |
| author_sort | Martí-Farré Jaume |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-14T01:57:29Z |
| format | Article |
| id | doaj.art-c58b49ad138842799c8e75672bbb5b1f |
| institution | Directory Open Access Journal |
| issn | 1862-2976 1862-2984 |
| language | English |
| last_indexed | 2024-04-14T01:57:29Z |
| publishDate | 2010-10-01 |
| publisher | De Gruyter |
| record_format | Article |
| series | Journal of Mathematical Cryptology |
| spelling | doaj.art-c58b49ad138842799c8e75672bbb5b1f2022-12-22T02:18:59ZengDe GruyterJournal of Mathematical Cryptology1862-29761862-29842010-10-01429512010.1515/jmc.2010.004On secret sharing schemes, matroids and polymatroidsMartí-Farré Jaume0Padró Carles1Universitat Politècnica de Catalunya, Carrer de Jordi Girona 1–3, 08034 Barcelona, Spain. E-mail: jaumem@ma4.upc.eduUniversitat Politècnica de Catalunya, Carrer de Jordi Girona 1–3, 08034 Barcelona, Spain. E-mail: cpadro@ma4.upc.eduThe 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.https://doi.org/10.1515/jmc.2010.004secret sharingoptimization of secret sharing schemes for general access structuresideal secret sharing schemesmatroidspolymatroids |
| spellingShingle | Martí-Farré Jaume Padró Carles On secret sharing schemes, matroids and polymatroids Journal of Mathematical Cryptology secret sharing optimization of secret sharing schemes for general access structures ideal secret sharing schemes matroids polymatroids |
| title | On secret sharing schemes, matroids and polymatroids |
| title_full | On secret sharing schemes, matroids and polymatroids |
| title_fullStr | On secret sharing schemes, matroids and polymatroids |
| title_full_unstemmed | On secret sharing schemes, matroids and polymatroids |
| title_short | On secret sharing schemes, matroids and polymatroids |
| title_sort | on secret sharing schemes matroids and polymatroids |
| topic | secret sharing optimization of secret sharing schemes for general access structures ideal secret sharing schemes matroids polymatroids |
| url | https://doi.org/10.1515/jmc.2010.004 |
| work_keys_str_mv | AT martifarrejaume onsecretsharingschemesmatroidsandpolymatroids AT padrocarles onsecretsharingschemesmatroidsandpolymatroids |