Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (Q3557032): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1690694664 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:23, 20 March 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
