For a universal access structure with n minimal qualified sets, the optimal share size grows at least as n/log2 n and at most as n/2.7182.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Complexity of universal access structures
For a universal access structure with n minimal qualified sets, the optimal share size grows at least as n/log2 n and at most as n/2.7182.