Complexity of universal access structures (Q413265): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Tight bounds on the information rate of secret sharing schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An impossibility result on graph secret sharing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3686615 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Secret sharing schemes with three or four minimal qualified subsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal complexity of secret sharing schemes with four minimal qualified subsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decomposition constructions for secret-sharing schemes / rank | |||
Normal rank | |||
Revision as of 03:19, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of universal access structures |
scientific article |
Statements
Complexity of universal access structures (English)
0 references
4 May 2012
0 references
cryptography
0 references
secret-sharing
0 references
complexity
0 references
entropy method
0 references
harmonic series
0 references
