Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (Q3557032): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:41, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming |
scientific article |
Statements
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (English)
0 references
27 April 2010
0 references
secret sharing
0 references
optimization of secret sharing schemes for general access structures
0 references
